Git: Clustering Based on Graph of Intensity Topology

Code

• github.com/gaozhangyang/git
  OfficialIn papernone★ 10
• github.com/gaozhangyang/DGC
  pytorch★ 10
• github.com/2024-MindSpore-1/Code2/tree/main/model-1/git
  mindspore★ 0
• github.com/yangyucheng000/University/tree/main/model-2/git
  mindspore★ 0

Abstract

Accuracy, Robustness to noises and scales, Interpretability, Speed, and Easy to use (ARISE) are crucial requirements of a good clustering algorithm. However, achieving these goals simultaneously is challenging, and most advanced approaches only focus on parts of them. Towards an overall consideration of these aspects, we propose a novel clustering algorithm, namely GIT (Clustering Based on Graph of Intensity Topology). GIT considers both local and global data structures: firstly forming local clusters based on intensity peaks of samples, and then estimating the global topological graph (topo-graph) between these local clusters. We use the Wasserstein Distance between the predicted and prior class proportions to automatically cut noisy edges in the topo-graph and merge connected local clusters as final clusters. Then, we compare GIT with seven competing algorithms on five synthetic datasets and nine real-world datasets. With fast local cluster detection, robust topo-graph construction and accurate edge-cutting, GIT shows attractive ARISE performance and significantly exceeds other non-convex clustering methods. For example, GIT outperforms its counterparts about 10\% (F1-score) on MNIST and FashionMNIST. Code is available at https://github.com/gaozhangyang/GIT.

Tasks

Benchmark Results

Reproductions