基于最小生成树与统计特征的层次聚类算法OA
Hierarchical clustering algorithm based on minimum spanning tree and statistical features
针对Chameleon算法在参数敏感性、噪声鲁棒性及计算效率上的不足,提出一种基于最小生成树与统计特征的层次聚类算法(statistical-MST integrated hierarchical clustering algorithm,SHCA).采用最小生成树构建稀疏图,消除人工参数干预,利用最小生成树的全局最优性避免跨簇伪连接;设计动态统计合并策略,结合局部距离阈值过滤噪声,并通过簇间连通性检验,迭代合并子簇,确保簇内紧密性与簇间分离性;在20个人工数据集与10个真实数据集上进行对比实验.结果表明:SHCA的聚类性能优于对比算法;针对部分数据集表现下降的情况,分析发现流形重叠是主要影响因素.SHCA有效提升了聚类精度与结果稳定性,为后续大规模、复杂流形数据的聚类研究提供了参考.
To address the limitations of the Chameleon algorithm in terms of parameter sensitivity,noise robustness,and computational efficiency,this study proposed a statistical-MST integrated hierarchical clustering algorithm(SHCA)based on the minimum spanning tree and statistical features.The minimum spanning tree was used to construct a sparse graph,eliminating manual parameter intervention,and the global optimality of the minimum spanning tree was used to avoid false cross cluster connections.The dynamic statistical merging strategy was designed to filter the noise combined with the local distance threshold,and the sub clusters were merged iteratively through the inter cluster connectivity test to ensure the intra cluster compactness and inter cluster separation.Experiment on 20 synthetic datasets and 10 real-world datasets was conducted.The result shows that the proposed SHCA algorithm outperforms existing methods in clustering performance;In cases where performance degradation is observed on certain datasets,the analysis reveals that manifold overlap is the primary contributing factor.Overall,SHCA significantly enhances clustering accuracy and result stability,providing some reference for subsequent research on clustering of large-scale and complex manifold data.
刘子康;周长杰;姚卫
河北科技大学理学院,河北 石家庄 050018河北科技大学理学院,河北 石家庄 050018南京信息工程大学数学与统计学院,江苏 南京 210044
信息技术与安全科学
人工智能理论聚类层次聚类算法最小生成树动态统计合并策略
artificial intelligence theoryclusteringhierarchical clustering algorithmminimum spanning treedynamic sta-tistical merging strategy
《河北科技大学学报》 2026 (1)
49-59,11
国家自然科学基金(12371462)
评论