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

Ful tanımlama

Detaylı Bibliyografya
Asıl Yazarlar: Hui Du, Depeng Lu, Zhihe Wang, Cuntao Ma, Xinxin Shi, Xiaoli Wang
Materyal Türü: Makale
Dil:English
Baskı/Yayın Bilgisi: AIMS Press 2023-07-01
Seri Bilgileri:Mathematical Biosciences and Engineering
Konular:
minimum spanning tree
inconsistent edges
mutual neighbors
clustering
density
Online Erişim: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

Benzer Materyaller