Fast clustering algorithm based on MST of representative points
Minimum spanning tree (MST)-based clustering algorithms are widely used to detect clusters with diverse densities and irregular shapes. However, most algorithms require the entire dataset to construct an MST, which leads to significant computational overhead. To alleviate this issue, our proposed al...
Main Authors: | Hui Du, Depeng Lu, Zhihe Wang, Cuntao Ma, Xinxin Shi, Xiaoli Wang |
---|---|
Format: | Article |
Language: | English |
Published: |
AIMS Press
2023-07-01
|
Series: | Mathematical Biosciences and Engineering |
Subjects: | |
Online Access: | https://www.aimspress.com/article/doi/10.3934/mbe.2023705?viewType=HTML |
Similar Items
-
Clustering of online learning resources via minimum spanning tree
by: Qingyuan Wu, et al.
Published: (2016-09-01) -
A novel density peaks clustering algorithm for automatic selection of clustering centers based on K-nearest neighbors
by: Zhihe Wang, et al.
Published: (2023-05-01) -
Converting MST to TSP Path by Branch Elimination
by: Pasi Fränti, et al.
Published: (2020-12-01) -
Some models for inverse minimum spanning tree problem with uncertain edge weights
by: Sagarika Biswal, et al.
Published: (2022-10-01) -
MSClustering: A Cytoscape Tool for Multi-Level Clustering of Biological Networks
by: Bo-Kai Ge, et al.
Published: (2022-11-01)