基于稀疏连接的层次化多核K-Means算法  

Hierarchical Multiple Kernel K-Means Algorithm Based on Sparse Connectivity

作　　者：王雷 杜亮[1,2] 周芃 WANG Lei;DU Liang;ZHOU Peng(College of Computer and Information Technology,Shanxi University,Taiyuan 030006,China;Institute of Big Data Science and Industry,Shanxi University,Taiyuan 030006,China;College of Computer Science and Technology,Anhui University,Hefei 230601,China)

机构地区：[1]山西大学计算机与信息技术学院,太原030006 [2]山西大学大数据科学与产业研究院,太原030006 [3]安徽大学计算机科学与技术学院,合肥230601

出　　处：《计算机科学》2023年第2期138-145,共8页Computer Science

基　　金：国家自然科学基金面上项目(61976129,62176001);山西省青年科技研究基金(201901D211168)。

摘　　要：多核学习(Multiple Kernel Learning,MKL)的目标是寻找一个最优的一致性核函数。在层次化多核聚类算法(HMKC)中,通过从高维空间中对样本特征进行逐层提取的方式来实现最大化地保留有效信息,但是却忽略了层与层之间的信息交互。该模型中只有相邻层中对应的结点会进行信息交互,对于其他结点来说是孤立的,而采用全连接的方式又会削弱最终一致性矩阵的多样性。因此,文中提出了一种基于稀疏连接的层次化多核K-Means算法(Sparse Connectivity Hierarchical Multiple Kernel K-Means,SCHMKKM)。该算法通过稀疏率来控制分配矩阵以达到稀疏连接的效果,从而将层与层之间信息蒸馏得到的特征进行局部融合。最后,在多个数据集上进行聚类分析,并在实验中与全连接的层次化多核K-Means算法(FCHMKKM)进行实验对比,证明了具有更多差异性的信息融合有利于学习更好的一致性划分矩阵,并且稀疏连接的融合策略优于全连接的策略。Multiple kernel learning(MKL)aims to find an optimal consistent kernel function.In the hierarchical multiple kernel clustering(HMKC)algorithm,the sample features are extracted layer by layer from high-dimensional space to maximize the retention of effective information,but the information interaction between layers is ignored.In this model,only the corresponding nodes in the adjacent layer will exchange information,but for other nodes,it is isolated,and if the full connection is adopted,the diversity of the final consistence matrix will be reduced.Therefore,this paper proposes a hierarchical multiple kernel K-Means(SCHMKKM)algorithm based on sparse connectivity,which controls the assignment matrix to achieve the effect of sparse connections through the sparsity rate,thereby locally fusing the features obtained by the distillation of information between layers.Finally,we perform cluster analysis on multiple data sets and compare it with the fully connected hierarchical multiple kernel K-Means(FCHMKKM)algorithm in experiment.Finally,it is proved that more discriminative information fusion is beneficial to learn a better consistent partition matrix,and the fusion strategy of sparse connection is better than the strategy of full connection.

关 键 词：多核学习 层次化多核聚类 稀疏连接 全连接 信息蒸馏 局部融合 

分 类 号：TP181[自动化与计算机技术—控制理论与控制工程]