Adaptive density peak clustering algorithm combined with sparse search

With the advantages of few parameters and the ability to deal with clusters of arbitrary shape, the density peak clustering algorithm has attracted wide attention since it came out. However, the algorithm has problems such as high time complexity, poor clustering effect on complex data sets, and the...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Journal of physics. Conference series Ročník 2493; číslo 1; s. 12010 - 12019
Hlavní autoři: Ma, Weiyuan, Duan, Baobin, Wei, Ping
Médium: Journal Article
Jazyk:angličtina
Vydáno: Bristol IOP Publishing 01.05.2023
Témata:
Algorithms
Clustering
Complexity
Data points
Datasets
Density
Physics
Search algorithms
Spatial data
ISSN:1742-6588, 1742-6596
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:With the advantages of few parameters and the ability to deal with clusters of arbitrary shape, the density peak clustering algorithm has attracted wide attention since it came out. However, the algorithm has problems such as high time complexity, poor clustering effect on complex data sets, and the need to manually select cluster centers. Aiming at the above shortcomings, an improved density peak clustering algorithm is proposed. Combined with the sparse search algorithm, the calculation of the similarity between each point and its nearest neighbor is simplified, and the problem of the high time complexity of the algorithm is overcome. A new local density definition method is adopted to make the density of data points better reflect the spatial structure of data distribution and to improve the clustering accuracy of the algorithm. Finally, a strategy for automatically selecting cluster centers is proposed to improve the adaptability of the algorithm. The algorithm is used to compare with the other improved algorithm on artificial data sets and real data sets. The experimental results show that the proposed algorithm can show a better clustering effect and can quickly and accurately identify various complex clusters.
Bibliografie:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:1742-6588
1742-6596
DOI:10.1088/1742-6596/2493/1/012010