[1]何玉林,杨振宇,肖又旗,等.一种新的稀疏表示驱动的大规模数据集成聚类算法[J].智能系统学报,2026,21(4):888-907.[doi:10.11992/tis.202509003]
HE Yulin,YANG Zhenyu,XIAO Youqi,et al.A new sparse representation-driven ensemble clustering algorithm for large-scale data[J].CAAI Transactions on Intelligent Systems,2026,21(4):888-907.[doi:10.11992/tis.202509003]
点击复制
《智能系统学报》[ISSN 1673-4785/CN 23-1538/TP] 卷:
21
期数:
2026年第4期
页码:
888-907
栏目:
学术论文—机器学习
出版日期:
2026-07-05
- Title:
-
A new sparse representation-driven ensemble clustering algorithm for large-scale data
- 作者:
-
何玉林1,2, 杨振宇1,2, 肖又旗1,2, 黄哲学1,2
-
1. 人工智能与数字经济广东省实验室(深圳) ,广东 深圳 518107;
2. 深圳大学 计算机与软件学院,广东 深圳 518060
- Author(s):
-
HE Yulin1,2, YANG Zhenyu1,2, XIAO Youqi1,2, HUANG Zhexue1,2
-
1. Guangdong Laboratory of Artificial Intelligence and Digital Economy(Shenzhen), Shenzhen 518107, China;
2. College of Computer Science and Software Engineering, Shenzhen University, Shenzhen 518060, China
-
- 关键词:
-
大规模聚类; 稀疏表示; 集成聚类; 代表点采样; 分布式计算; Spark; 大规模数据; 共识函数
- Keywords:
-
large-scale clustering; sparse representation; ensemble clustering; representative point selection; distributed computing; Spark; large-scale data; consensus function
- 分类号:
-
TP391.4
- DOI:
-
10.11992/tis.202509003
- 摘要:
-
针对大规模高维数据聚类中存在的采样代表性不足与计算开销过高的问题,本文提出了一种稀疏表示驱动的集成聚类(sparse representation-driven ensemble clustering,SREC)算法。在基聚类生成阶段,SREC算法引入了随机样本划分与K-means的混合代表点采样策略,结合FAISS(facebook AI similarity search)索引构建高效稀疏图,有效克服了局部采样难以覆盖全局分布的缺陷;在共识函数构建阶段,SREC算法采用了一种非迭代的加权谱共识函数,利用Tcut(transfer cut)策略在稀疏图中实现高精度的簇划分。在分布式环境下基于Spark计算框架实现了SREC算法,通过百万级数据集对其表现进行了系统性地验证。实验结果表明:SREC算法在评价指标NMI(normalized mutual information)、ARI(adjusted Rand index)和ACC(clustering accuracy)上优于选用的10种主流聚类算法,较之次优算法获得了4.15%、3.33%以及0.98%的性能提升;同时,SREC算法具备良好的稳定性,对基聚类算法个数的变化不敏感,NMI指标标准差仅为0.21%;另外,在处理五百万级样本数据的聚类问题时,相比次优算法,SREC算法的计算效率提升了51.8%,证实了其在处理大规模数据聚类问题时的优势。本文研究结果可为大规模数据的高效聚类分析、分布式数据挖掘及相关智能应用系统设计提供参考。
- Abstract:
-
To address the challenges of inadequate sampling representativeness and high computational cost in large-scale high-dimensional data clustering, this paper proposes a sparse representation-driven ensemble clustering(SREC) algorithm. In the base clustering generation stage, SREC algorithm incorporates a hybrid sampling strategy that combines random sample partitioning with K-means, along with facebook AI similarity search(FAISS) indexing to build an efficient sparse graph. This approach effectively mitigates the limitation of local sampling in capturing the global data distribution. For the consensus function construction, a non-iterative weighted spectral consensus function is introduced, which employs the Tcut strategy to achieve high-precision cluster partitioning within the sparse graph. The SREC algorithm is implemented in a distributed environment using the Spark computing framework, and its performance is systematically evaluated on datasets containing over one million samples. Experimental results show that SREC outperforms ten selected mainstream clustering algorithms on the NMI, ARI, and ACC evaluation metrics, with improvements of 4.15%, 3.33% and 0.98%, respectively, over the second-best algorithm. Moreover, SREC algorithm exhibits strong stability, demonstrating low sensitivity to changes in the number of base clusters, as reflected by an NMI standard deviation of only 0.21%. Furthermore, when applied to clustering tasks with five million samples, SREC algorithm achieves a 51.8% increase in computational efficiency compared to the next-best algorithm, confirming its advantages for large-scale data clustering. The findings of this study can provide a reference for efficient clustering analysis of large-scale data, distributed data mining, and the design of related intelligent application systems.
备注/Memo
收稿日期:2025-9-1。
基金项目:深圳市科技重大专项项目 (KJZD20230923114809020);深圳市基础研究面上项目(JCYJ20250604175602004).
作者简介:何玉林,研究员,博士,深圳市特支人才,主要研究方向为新型大数据理论模型、大数据高性能/并行计算平台、面向大数据的机器学习算法、复杂型大数据应用系统。主持国家级、省部级科研项目10余项,发表学术论文100余篇。E-mail:yulinhe@gml.ac.cn。;杨振宇,硕士研究生,主要研究方向为大规模数据聚类、集成聚类、机器学习。E-mail:yangzhenyu@gml.ac.cn。;肖又旗,硕士研究生,主要研究方向为大数据分布式计算、Spark能耗优化、高性能数据挖掘。E-mail:xiaoyouqi@gml.ac.cn。
通讯作者:杨振宇. E-mail:yangzhenyu@gml.ac.cn
更新日期/Last Update:
1900-01-01