Robust MST-Based Clustering Algorithm

DOI10.1162/neco_a_01081zbMath1476.62139OpenAlexW2798186325WikidataQ88350849 ScholiaQ88350849MaRDI QIDQ5157196

Guangjing Wang, Ruisheng Zhang, Zhenghai Wang, Mengyao Jiao, Qidong Liu, Zhili Zhao

Publication date: 12 October 2021

Published in: Neural Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1162/neco_a_01081

zbMATH Keywords

clusteringminimum spanning tree (MST)

Mathematics Subject Classification ID

Computational methods for problems pertaining to statistics (62-08) Programming involving graphs or networks (90C35) Nonparametric robustness (62G35) Classification and discrimination; cluster analysis (statistical aspects) (62H30) Applications of graph theory (05C90) Minimax procedures in statistical decision theory (62C20)

Related Items

A multi-stage hierarchical clustering algorithm based on centroid of tree and cut edge constraint

Uses Software

• apcluster
• APCluster

Cites Work

• Unnamed Item
• Unnamed Item
• Clustering by Passing Messages Between Data Points
• Robust path-based spectral clustering
• Spectral clustering with eigenvector selection
• Density-Weighted Nyström Method for Computing Large Kernel Eigensystems
• A Fast and High Quality Multilevel Scheme for Partitioning Irregular Graphs
• DSets-DBSCAN: A Parameter-Free Clustering Algorithm
• Graph-Theoretical Methods for Detecting and Describing Gestalt Clusters