GBMST: An Efficient Minimum Spanning Tree Clustering Based on Granular-Ball Computing

2023/03/02 by Jiang Xie, Xie, Jiang, Shuyin Xia +5
Engineering · #Advanced Fiber Optic Sensors #Artificial Intelligence (cs.AI) #Databases (cs.DB) #FOS: Computer and information sciences #Machine Learning (cs.LG)

paper · pdf · doi:10.48550/arxiv.2303.01082

openalex publication_date 2023/03/02 · openalex created_date 2023/03/05 · openalex updated_date 2026/07/28

Abstract

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 noise. Therefore, we propose a clustering algorithm that combines multi-granularity Granular-Ball and minimum spanning tree (MST). We construct coarsegrained granular-balls, and then use granular-balls and MST to implement the clustering method based on "large-scale priority", which can greatly avoid the influence of outliers and accelerate the construction process of MST. Experimental results on several data sets demonstrate the power of the algorithm. All codes have been released at https://github.com/xjnine/GBMST.

Related

• GBCT: An Efficient and Adaptive Granular-Ball Clustering Algorithm for Complex Data
• Clustering with minimum spanning trees: How good can it be?
• GBC: An Efficient and Adaptive Clustering Algorithm Based on Granular-Ball
• GBSK: Skeleton Clustering via Granular-ball Computing and Multi-Sampling for Large-Scale Data
• Study Morphology of Minimum Spanning Tree Problem and Generalized Algorithms