Fast clustering algorithm based on MST of representative points

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...

Full description

Bibliographic Details
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:
minimum spanning tree
inconsistent edges
mutual neighbors
clustering
density
Online Access:https://www.aimspress.com/article/doi/10.3934/mbe.2023705?viewType=HTML

Internet

https://www.aimspress.com/article/doi/10.3934/mbe.2023705?viewType=HTML

Similar Items