Clustering with prim's sequential representation of minimum spanning tree

DOI10.1016/J.AMC.2014.09.026zbMath1338.90436OpenAlexW1983116226MaRDI QIDQ297768

Guan-Wei Wang, Jian Zhuang, Chun-Xia Zhang

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

zbMATH Keywords

clusteringminimum spanning treegraph partitioninconsistent edgeprim's sequential representation

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Classification and discrimination; cluster analysis (statistical aspects) (62H30) Trees (05C05) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (1)

Integer linear programming formulations for the minimum connectivity inference problem and model reduction principles

Uses Software

• UCI-ml
• MNIST

Cites Work

• Unnamed Item
• Unnamed Item
• UCI-ml
• Resonance, stability and chaotic vibration of a quarter-car vehicle model with time-delay feedback
• A clustering algorithm based on maximal \(\varTheta\)-distant subtrees
• A survey of kernel and spectral methods for clustering
• A graph-theoretical clustering method based on two rounds of minimum spanning trees
• A segmentation algorithm for noisy images: Design and evaluation
• Two-phase clustering process for outliers detection
• Graph-Theoretical Methods for Detecting and Describing Gestalt Clusters

This page was built for publication: Clustering with prim's sequential representation of minimum spanning tree