An Improved Integrated Clustering Learning Strategy Based on Three-Stage Affinity Propagation Algorithm with Density Peak Optimization Theory

Author:

Wang Limin1,Sun Wenjing2,Han Xuming3ORCID,Hao Zhiyuan4ORCID,Zhou Ruihong1,Yu Jinglin1,Parmar Milan2ORCID

Affiliation:

1. School of Internet Finance and Information Engineering, Guangdong University of Finance, Guangzhou 510520, China

2. School of Management Science and Information Engineering, Jilin University of Finance and Economics, Changchun 130117, Jilin, China

3. College of Information Science and Technology, Jinan University, Guangzhou 510632, China

4. School of Management, Jilin University, Changchun 130022, Jilin, China

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.

Funder

National Natural Science Foundation of China

Publisher

Hindawi Limited

Subject

Multidisciplinary,General Computer Science

Reference37 articles.

1. Using Data Mining Methods To Solve Classification Problems in Financial-Banking Institutions

2. Performance of deep learning in prediction of stock market volatility;K.-S. Moon;Economic Computation and Economic Cybernetics Studies and Research,2019

3. Developing an index score for the internal auditor profile in Romania based on real data analysis;M. Miheala;Economic Computation and Economic Cybernetics Studies and Research,2019

4. A Big Data Based Cosmetic Recommendation Algorithm

5. BinSanity: unsupervised clustering of environmental microbial assemblies using coverage and affinity propagation

Cited by 3 articles. 订阅此论文施引文献 订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献

1. Research on Mini-Batch Affinity Propagation Clustering Algorithm;2022 IEEE 9th International Conference on Data Science and Advanced Analytics (DSAA);2022-10-13

2. Improvement of K-Means Algorithm and Its Application in Air Passenger Grouping;Computational Intelligence and Neuroscience;2022-09-12

3. Hierarchical Unsupervised Partitioning of Large Size Data and Its Application to Hyperspectral Images;Remote Sensing;2021-11-30

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线,采集、加工和组织学术论文而形成的新型学术文献查询和分析系统,可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容,当前同舟云学术共收录了国内外主流学术期刊6万余种,收集的期刊论文及会议论文总量共计约1.5亿篇,并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询!咨询电话:010-8811{复制后删除}0370

www.globalauthorid.com

TOP

Copyright © 2019-2024 北京同舟云网络信息技术有限公司
京公网安备11010802033243号  京ICP备18003416号-3