CciMST: a clustering algorithm based on minimum spanning tree and cluster centers

DOI10.1155/2018/8451796zbMath1428.62284OpenAlexW2905070103WikidataQ128738368 ScholiaQ128738368MaRDI QIDQ1721537

Hui Huang, Yan Ma, Xiaofu He, Jie Yang, Xiaobo Lv

Publication date: 8 February 2019

Published in: Mathematical Problems in Engineering (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1155/2018/8451796

Mathematics Subject Classification ID

Classification and discrimination; cluster analysis (statistical aspects) (62H30) Pattern recognition, speech recognition (68T10)

Related Items (2)

A multi-stage hierarchical clustering algorithm based on centroid of tree and cut edge constraint ⋮ CciMST

Uses Software

• UCI-ml

Cites Work

• Unnamed Item
• On the shortest spanning subtree of a graph and the traveling salesman problem
• Resonance, stability and chaotic vibration of a quarter-car vehicle model with time-delay feedback
• Chameleon based on clustering feature tree and its application in customer segmentation
• A graph-theoretical clustering method based on two rounds of minimum spanning trees
• Least squares quantization in PCM
• An Initialization Method Based on Hybrid Distance for k-Means Algorithm
• Graph-Theoretical Methods for Detecting and Describing Gestalt Clusters
• Foundations of Information and Knowledge Systems

This page was built for publication: CciMST: a clustering algorithm based on minimum spanning tree and cluster centers