A graph-theoretical clustering method based on two rounds of minimum spanning trees

DOI10.1016/j.patcog.2009.07.010zbMath1187.68520OpenAlexW2034887891MaRDI QIDQ2654240

Caiming Zhong, Duoqian Miao, Ruizhi Wang

Publication date: 15 January 2010

Published in: Pattern Recognition (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.patcog.2009.07.010

zbMATH Keywords

graph-based clusteringtouching clustertwo rounds of MSTwell-separated cluster

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Pattern recognition, speech recognition (68T10)

Related Items (5)

Clustering with prim's sequential representation of minimum spanning tree ⋮ CciMST: a clustering algorithm based on minimum spanning tree and cluster centers ⋮ A fast minimum spanning tree algorithm based on \(K\)-means ⋮ Integer linear programming formulations for the minimum connectivity inference problem and model reduction principles ⋮ A novel fast heuristic to handle large-scale shape clustering

Uses Software

• MOCK
• clustervalidation

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Correlation clustering
• Fast and robust fuzzy \(c\)-means clustering algorithms incorporating local information for image segmentation
• A clustering algorithm based on maximal \(\varTheta\)-distant subtrees
• Automatic clustering and boundary detection algorithm based on adaptive influence function
• The relative neighbourhood graph of a finite planar set
• A clustering procedure based on the comparison between the \(k\) nearest neighbors graph and the minimal spanning tree.
• Robust path-based spectral clustering
• Graph-Theoretical Methods for Detecting and Describing Gestalt Clusters
• Data mining. Concepts and techniques

This page was built for publication: A graph-theoretical clustering method based on two rounds of minimum spanning trees