Clustering with minimum spanning trees: how good can it be?
From MaRDI portal
Cites work
- A clustering procedure based on the comparison between the \(k\) nearest neighbors graph and the minimal spanning tree.
- A fast minimum spanning tree algorithm based on \(K\)-means
- A Fuzzy Relative of the ISODATA Process and Its Use in Detecting Compact Well-Separated Clusters
- A general framework for evaluating and comparing soft clusterings
- A graph-theoretical clustering method based on two rounds of minimum spanning trees
- A hyperbolic approach for learning communities on graphs
- A Kemeny distance-based robust fuzzy clustering for preference data
- A multi-stage hierarchical clustering algorithm based on centroid of tree and cut edge constraint
- A Survey of Recent Advances in Hierarchical Clustering Algorithms
- Characteristics of distance matrices based on Euclidean, Manhattan and Hausdorff coefficients
- Cluster analysis: a modern statistical review
- Comparing hard and overlapping clusterings
- Finding Groups in Data
- Foundations of Data Science
- Graph-Theoretical Methods for Detecting and Describing Gestalt Clusters
- Handwritten chinese text line segmentation by clustering with distance metric learning
- Hierarchical clustering via joint between-within distances: extending Ward's minimum variance method
- Hierarchical clustering with prototypes via minimax linkage
- scientific article; zbMATH DE number 3942813 (Why is no real title available?)
- scientific article; zbMATH DE number 3567782 (Why is no real title available?)
- scientific article; zbMATH DE number 3429948 (Why is no real title available?)
- Introduction to algorithms.
- Iterative shrinking method for clustering problems
- Least squares quantization in PCM
- Lower Bounds for the Partitioning of Graphs
- Modern algorithms of cluster analysis
- On clustering validation techniques
- On the History of the Minimum Spanning Tree Problem
- On the shortest spanning subtree of a graph and the traveling salesman problem
- Scikit-learn: machine learning in Python
- Silhouettes: a graphical aid to the interpretation and validation of cluster analysis
- Sur la liaison et la division des points d'un ensemble fini
- The area under the ROC curve as a measure of clustering quality
- Understanding the adjusted Rand index and other partition comparison indices based on counting object pairs
- Über ein Minimalproblem.
- Über ein Minimalproblem.
This page was built for publication: Clustering with minimum spanning trees: how good can it be?
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6994987)
