Robust MST-based clustering algorithm
From MaRDI portal
Computational methods for problems pertaining to statistics (62-08) Nonparametric robustness (62G35) Classification and discrimination; cluster analysis (statistical aspects) (62H30) Applications of graph theory (05C90) Programming involving graphs or networks (90C35) Minimax procedures in statistical decision theory (62C20)
Recommendations
- CciMST: a clustering algorithm based on minimum spanning tree and cluster centers
- Adaptive clustering algorithm based on minimal spanning tree cutting
- A graph-theoretical clustering method based on two rounds of minimum spanning trees
- An improved clustering algorithm for minimum spanning trees in multidimensional data
- Clustering with prim's sequential representation of minimum spanning tree
Cites work
- scientific article; zbMATH DE number 928746 (Why is no real title available?)
- scientific article; zbMATH DE number 3340881 (Why is no real title available?)
- A Fast and High Quality Multilevel Scheme for Partitioning Irregular Graphs
- Clustering by passing messages between data points
- DSets-DBSCAN: A Parameter-Free Clustering Algorithm
- Density-Weighted Nyström Method for Computing Large Kernel Eigensystems
- Graph-Theoretical Methods for Detecting and Describing Gestalt Clusters
- Robust path-based spectral clustering
- Spectral clustering with eigenvector selection
Cited in
(3)
This page was built for publication: Robust MST-based clustering algorithm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5157196)