CciMST: a clustering algorithm based on minimum spanning tree and cluster centers
type: Item
instance of: scholarly article
title: CciMST: a clustering algorithm based on minimum spanning tree and cluster centers
zbMATH Open document ID: 1428.62284
DOI: 10.1155/2018/8451796
author: Xiaobo Lv
author: Yan Ma
author: Xiaofu He
author: Hui Huang
author: Jie Yang
published in: Mathematical Problems in Engineering
publication date: 2019-02-08T00:00:00Z
review text: Summary: The minimum spanning tree- (MST-) based clustering method can identify clusters of arbitrary shape by removing inconsistent edges. The definition of the inconsistent edges is a major issue that has to be addressed in all MST-based clustering algorithms. In this paper, we propose a novel MST-based clustering algorithm through the cluster center initialization algorithm, called cciMST. First, in order to capture the intrinsic structure of the data sets, we propose the cluster center initialization algorithm based on geodesic distance and dual densities of the points. Second, we propose and demonstrate that the inconsistent edge is located on the shortest path between the cluster centers, so we can find the inconsistent edge with the length of the edges as well as the densities of their endpoints on the shortest path. Correspondingly, we obtain two groups of clustering results. Third, we propose a novel intercluster separation by computing the distance between the points at the intersection of clusters. Furthermore, we propose a new internal clustering validation measure to select the best clustering result. The experimental results on the synthetic data sets, real data sets, and image data sets demonstrate the good performance of the proposed MST-based method.
Mathematics Subject Classification ID: 62H30
Mathematics Subject Classification ID: 68T10
zbMATH DE Number: 7019614
describes a project that uses: UCI-ml
MaRDI profile type: Publication
full work available at URL: https://doi.org/10.1155/2018/8451796
OpenAlex ID: W2905070103
cites work: Least squares quantization in PCM
cites work: Chameleon based on clustering feature tree and its application in customer segmentation
cites work: On the shortest spanning subtree of a graph and the traveling salesman problem
cites work: Graph-Theoretical Methods for Detecting and Describing Gestalt Clusters
cites work: A graph-theoretical clustering method based on two rounds of minimum spanning trees
cites work: Resonance, stability and chaotic vibration of a quarter-car vehicle model with time-delay feedback
cites work: Foundations of Information and Knowledge Systems
cites work: An Initialization Method Based on Hybrid Distance for k-Means Algorithm
cites work: Q5617409
Wikidata QID: Q128738368
description: scientific article; zbMATH DE number 7019614