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

DOI10.1080/09720529.2012.10698380zbMATH Open1350.05163OpenAlexW2312278921MaRDI QIDQ2833282FDOQ2833282

Authors: S. John Peter 

Publication date: 17 November 2016

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

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

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

zbMATH Keywords

outliersclusteringEuclidean minimum spanning treecluster separationobject density

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• The NP-completeness column: An ongoing guide
• Efficient algorithms for finding minimum spanning trees in undirected and directed graphs
• 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
• K-Means-Type Algorithms: A Generalized Convergence Theorem and Characterization of Local Optimality

Cited In (4)

• Structural similarity micro clustering algorithm for local outliers and hubs using dynamic minimum spanning tree
• A multi-stage hierarchical clustering algorithm based on centroid of tree and cut edge constraint
• Foundations of Information and Knowledge Systems
• Clustering and outlier detection using isoperimetric number of trees

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)