An Improved Integrated Clustering Learning Strategy Based on Three-Stage Affinity Propagation Algorithm with Density Peak Optimization Theory. (7th January 2021)
- Record Type:
- Journal Article
- Title:
- An Improved Integrated Clustering Learning Strategy Based on Three-Stage Affinity Propagation Algorithm with Density Peak Optimization Theory. (7th January 2021)
- Main Title:
- An Improved Integrated Clustering Learning Strategy Based on Three-Stage Affinity Propagation Algorithm with Density Peak Optimization Theory
- Authors:
- Wang, Limin
Sun, Wenjing
Han, Xuming
Hao, Zhiyuan
Zhou, Ruihong
Yu, Jinglin
Parmar, Milan - Other Names:
- Hassanien Abd E.I.-Baset Academic Editor.
- Abstract:
- Abstract : To better reflect the precise clustering results of the data samples with different shapes and densities for affinity propagation clustering algorithm (AP), an improved integrated clustering learning strategy based on three-stage affinity propagation algorithm with density peak optimization theory (DPKT-AP) was proposed in this paper. DPKT-AP combined the ideology of integrated clustering with the AP algorithm, by introducing the density peak theory and k-means algorithm to carry on the three-stage clustering process. In the first stage, the clustering center point was selected by density peak clustering. Because the clustering center was surrounded by the nearest neighbor point with lower local density and had a relatively large distance from other points with higher density, it could help the k-means algorithm in the second stage avoiding the local optimal situation. In the second stage, the k-means algorithm was used to cluster the data samples to form several relatively small spherical subgroups, and each of subgroups had a local density maximum point, which is called the center point of the subgroup. In the third stage, DPKT-AP used the AP algorithm to merge and cluster the spherical subgroups. Experiments on UCI data sets and synthetic data sets showed that DPKT-AP improved the clustering performance and accuracy for the algorithm.
- Is Part Of:
- Complexity. Volume 2021(2021)
- Journal:
- Complexity
- Issue:
- Volume 2021(2021)
- Issue Display:
- Volume 2021, Issue 2021 (2021)
- Year:
- 2021
- Volume:
- 2021
- Issue:
- 2021
- Issue Sort Value:
- 2021-2021-2021-0000
- Page Start:
- Page End:
- Publication Date:
- 2021-01-07
- Subjects:
- Chaotic behavior in systems -- Periodicals
Complexity (Philosophy) -- Periodicals
003 - Journal URLs:
- https://onlinelibrary.wiley.com/journal/10990526 ↗
http://onlinelibrary.wiley.com/ ↗
https://www.hindawi.com/journals/complexity/ ↗ - DOI:
- 10.1155/2021/6666619 ↗
- Languages:
- English
- ISSNs:
- 1076-2787
- Deposit Type:
- Legaldeposit
- View Content:
- Available online (eLD content is only available in our Reading Rooms) ↗
- Physical Locations:
- British Library DSC - 3364.585500
British Library HMNTS - ELD Digital store - Ingest File:
- 15548.xml