Clustering with prim's sequential representation of minimum spanning tree
DOI10.1016/J.AMC.2014.09.026zbMATH Open1338.90436OpenAlexW1983116226MaRDI QIDQ297768FDOQ297768
Authors: Guan-Wei Wang, Chunxia Zhang, Jian Zhuang 
Publication date: 17 June 2016
Published in: Applied Mathematics and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.amc.2014.09.026
Recommendations
- Computing hierarchies of clusters from the Euclidean minimum spanning tree in linear time
- On a minimal spanning tree approach in the cluster validation problem
- An improved clustering algorithm for minimum spanning trees in multidimensional data
- Graph Clustering and Minimum Cut Trees
- A graph-theoretical clustering method based on two rounds of minimum spanning trees
- A minimal spanning tree algorithm applied to spatial cluster analysis
- A grid clustering technique based on minimal spanning trees
Classification and discrimination; cluster analysis (statistical aspects) (62H30) Programming involving graphs or networks (90C35) Trees (05C05) Graph algorithms (graph-theoretic aspects) (05C85)
Cites Work
- UCI-ml
- A survey of kernel and spectral methods for clustering
- A graph-theoretical clustering method based on two rounds of minimum spanning trees
- Engineering graph clustering: models and experimental evaluation
- A segmentation algorithm for noisy images: Design and evaluation
- Two-phase clustering process for outliers detection
- Identification of regulatory binding sites using minimum spanning trees
- Resonance, stability and chaotic vibration of a quarter-car vehicle model with time-delay feedback
- Graph-Theoretical Methods for Detecting and Describing Gestalt Clusters
- A clustering algorithm based on maximal \(\varTheta\)-distant subtrees
Cited In (8)
- A novel dynamic minimum spanning tree based clustering method for image mining
- A multi-stage hierarchical clustering algorithm based on centroid of tree and cut edge constraint
- Integer linear programming formulations for the minimum connectivity inference problem and model reduction principles
- Robust MST-based clustering algorithm
- An improved clustering algorithm for minimum spanning trees in multidimensional data
- Clustering gene expression data using minimum spanning trees
- CciMST: a clustering algorithm based on minimum spanning tree and cluster centers
- A fast minimum spanning tree algorithm based on \(K\)-means
Uses Software
This page was built for publication: Clustering with prim's sequential representation of minimum spanning tree
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q297768)
