GBC: An Efficient and Adaptive Clustering Algorithm Based on Granular-Ball
Existing clustering methods are based on a single granularity of information, such as the distance and density of each data. This most fine-grained based approach is usually inefficient and susceptible to noise. Inspired by adaptive process of granular-ball division and differentiation, we present a novel clustering approach that retains the speed and efficiency of K-means clustering while out-performing time-tested density clustering approaches widely used in industry today. Our simple, robust, adaptive granular-ball clustering method can efficiently recognize clusters with unknown and complex shapes without the use of extra parameters. Moreover, the proposed method provides an efficient, adaptive way to depict the world, and will promote the research and development of adaptive and efficient AI technologies, especially density computing models, and improve the efficiency of many existing clustering methods.
Code (0)
등록된 구현이 없습니다.
Tasks
AstronomyClusteringMethods 이 논문이 사용한 방법론
Similar Papers 제목 키워드 기반
GBCT: An Efficient and Adaptive Granular-Ball Clustering Algorithm for Complex Data
Traditional clustering algorithms often focus on the most fine-grained information and achieve clustering by calculating the distance between each pair of data points or implementing other calculations based on points. T…
ClusteringGBMST: An Efficient Minimum Spanning Tree Clustering Based on Granular-Ball Computing
Most of the existing clustering methods are based on a single granularity of information, such as the distance and density of each data. This most fine-grained based approach is usually inefficient and susceptible to noi…
ClusteringGBSK: Skeleton Clustering via Granular-ball Computing and Multi-Sampling for Large-Scale Data
To effectively handle clustering task for large-scale datasets, we propose a novel scalable skeleton clustering algorithm, namely GBSK, which leverages the granular-ball technique to capture the underlying structure of d…
Granular-ball computing: an efficient, robust, and interpretable adaptive multi-granularity representation and computation method
Human cognition operates on a "Global-first" cognitive mechanism, prioritizing information processing based on coarse-grained details. This mechanism inherently possesses an adaptive multi-granularity description capacit…
MDL-GBG: A Non-parametric and Interpretable Granular-Ball Generation Method for Clustering
Existing granular-ball generation methods are still mainly driven by handcrafted quality measures and heuristic splitting or stopping criteria, which may weaken the transparency of local generation decisions in clusterin…