Density-based O-means clustering algorithm using minimum spanning tree
From MaRDI portal
Publication:2833282
Recommendations
- Structural similarity micro clustering algorithm for local outliers and hubs using dynamic minimum spanning tree
- CciMST: a clustering algorithm based on minimum spanning tree and cluster centers
- Adaptive clustering algorithm based on minimal spanning tree cutting
- Foundations of Information and Knowledge Systems
- An improved clustering algorithm for minimum spanning trees in multidimensional data
Cites work
- scientific article; zbMATH DE number 3919830 (Why is no real title available?)
- scientific article; zbMATH DE number 41467 (Why is no real title available?)
- A randomized linear-time algorithm to find minimum spanning trees
- Efficient algorithms for finding minimum spanning trees in undirected and directed graphs
- Graph-Theoretical Methods for Detecting and Describing Gestalt Clusters
- K-Means-Type Algorithms: A Generalized Convergence Theorem and Characterization of Local Optimality
- The NP-completeness column: An ongoing guide
- Two-phase clustering process for outliers detection
Cited in
(4)- Foundations of Information and Knowledge Systems
- Structural similarity micro clustering algorithm for local outliers and hubs using dynamic minimum spanning tree
- Clustering and outlier detection using isoperimetric number of trees
- A multi-stage hierarchical clustering algorithm based on centroid of tree and cut edge constraint
This page was built for publication: Density-based O-means clustering algorithm using minimum spanning tree
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2833282)
