电子学报2024，Vol.52Issue(3)：740-750,11.DOI:10.12263/DZXB.20221206
基于子博弈完美均衡的启发式聚类算法
Heuristic Clustering Algorithm Based on Sub-Game Perfect Equilibrium
摘要
Abstract
Clustering is a typical and important data mining method,but most of the existing clustering algorithms need to specify the number of clusters artificially,and the clustering results are sensitive to parameters.To address the above shortcomings,this paper proposes a heuristic clustering algorithm based on sub-game perfect equilibrium(HCSPE).The algorithm fully exploits the information of the distribution characteristics of data points themselves and obtains the adaptive parameter values by heuristic methods,so that the local density attribute values of data points are derived with ob-jectivity and universality,and the sensitivity of clustering results to parameters is reduced.Based on the idea of game,the two attributes of local density and relative distance are integrated to form the competitiveness of data points,and the auto-matic calculation of the number of clusters and the determination of cluster centers are completed by relying on the competi-tion mechanism.The experimental results on several data sets of different sizes and types show that the performance index-es of the proposed algorithm are better than other algorithms in general,and the clustering results are more in line with the objective requirements.关键词
博弈论/竞价机制/子博弈均衡/启发式算法/聚类Key words
game theory/bidding mechanism/sub-game equilibrium/heuristic algorithm/clustering分类
信息技术与安全科学引用本文复制引用
常璐瑶,牛新征,罗涛,钱早国..基于子博弈完美均衡的启发式聚类算法[J].电子学报,2024,52(3):740-750,11.基金项目
国家自然科学基金(No.62272087) （No.62272087）
四川省科技计划项目(No.2021YFS0391) National Natural Science Foundation of China(No.62272087) （No.2021YFS0391）
Technology Planning Project of Sichuan Province(No.2021YFS0391) （No.2021YFS0391）
