Density-based O-Means clustering algorithm using minimum spanning tree

DOI10.1080/09720529.2012.10698380zbMath1350.05163OpenAlexW2312278921MaRDI QIDQ2833282

S. John Peter

Publication date: 17 November 2016

Published in: Journal of Discrete Mathematical Sciences and Cryptography (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/09720529.2012.10698380

zbMATH Keywords

outliersclusteringEuclidean minimum spanning treecluster separationobject density

Mathematics Subject Classification ID

Trees (05C05) Extremal problems in graph theory (05C35) Graph algorithms (graph-theoretic aspects) (05C85)

Cites Work

• Unnamed Item
• Unnamed Item
• Efficient algorithms for finding minimum spanning trees in undirected and directed graphs
• K-Means-Type Algorithms: A Generalized Convergence Theorem and Characterization of Local Optimality
• A randomized linear-time algorithm to find minimum spanning trees
• Two-phase clustering process for outliers detection
• Graph-Theoretical Methods for Detecting and Describing Gestalt Clusters
• The NP-completeness column: An ongoing guide

This page was built for publication: Density-based O-Means clustering algorithm using minimum spanning tree