A spectral clustering algorithm based on attribute fluctuation and density peaks clustering algorithm

Spectral clustering (SC) has become a popular choice for data clustering by converting a dataset to a graph structure and then by identifying optimal subgraphs by graph partitioning to complete the clustering. However, k-means is taken at the clustering stage to randomly select the initial cluster c...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Applied intelligence (Dordrecht, Netherlands) Ročník 53; číslo 9; s. 10520 - 10534
Hlavní autoři: Song, Xin, Li, Shuhua, Qi, Ziqiang, Zhu, Jianlin
Médium: Journal Article
Jazyk:angličtina
Vydáno: New York Springer US 01.05.2023
Springer Nature B.V
Témata:
Algorithms
Artificial Intelligence
Clustering
Computer Science
Datasets
Density
Euclidean geometry
Graph theory
Machines
Manufacturing
Mathematical analysis
Mechanical Engineering
Processes
Density peaks clustering algorithm
Histogram clustering algorithm
Spectral clustering
Attribute fluctuation
ISSN:0924-669X, 1573-7497
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í:Spectral clustering (SC) has become a popular choice for data clustering by converting a dataset to a graph structure and then by identifying optimal subgraphs by graph partitioning to complete the clustering. However, k-means is taken at the clustering stage to randomly select the initial cluster centers, which leads to unstable performance. Notably, k-means needs to specify the number of clusters (prior knowledge). Second, SC calculates the similarity matrix using the linear Euclidean distance, losing part of the effective information. Third, real datasets usually contain redundant features, but traditional SC does not adequately address multi-attribute data. To solve these issues, we propose an SC algorithm based on the attribute fluctuation and density peaks clustering algorithm (AFDSC) to improve the clustering accuracy and effect. Furthermore, to verify the idea of the AFDSC algorithm, we extract the attribute fluctuation factor and propose a histogram clustering algorithm based on attribute fluctuation (AFHC) divorced from spectral clustering. Experimental results show that both the AFDSC algorithm and AFHC algorithm have achieved better performance on fifteen UCI datasets compared with other clustering algorithms.
Bibliografie:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:0924-669X
1573-7497
DOI:10.1007/s10489-022-04058-2