Journal of Computer Applications ›› 2022, Vol. 42 ›› Issue (12): 3740-3749.DOI: 10.11772/j.issn.1001-9081.2021101756

• Data science and technology • Previous Articles    

Multi-view clustering via subspace merging on Grassmann manifold

Jiaojiao GUAN(), Xuezhong QIAN, Shibing ZHOU, Kaibin JIANG, Wei SONG   

  1. School of Artificial Intelligence and Computer Science,Jiangnan University,Wuxi Jiangsu 214122,China
  • Received:2021-10-12 Revised:2022-01-10 Accepted:2022-01-24 Online:2022-03-04 Published:2022-12-10
  • Contact: Jiaojiao GUAN
  • About author:QIAN Xuezhong,born in 1967, M. S., associate professor. His research interests include data mining, machine learning, artificial intelligence.
    ZHOU Shibing, born in 1972, Ph. D., associate professor. His research interests include pattern recognition, artificial intelligence.
    JIANG Kaibin, born in 1998, M. S. candidate. His research interests include artificial intelligence, machine learning.
    SONG Wei, born in 1981, Ph. D., professor. His research interests include data mining, machine learning, pattern recognition.
  • Supported by:
    National Natural Science Foundation of China(62076110);Natural Science Foundation of Jiangsu Province(BK20181341)

基于格拉斯曼流形子空间融合的多视图聚类

管娇娇(), 钱雪忠, 周世兵, 姜凯彬, 宋威   

  1. 江南大学 人工智能与计算机学院,江苏 无锡 214122
  • 通讯作者: 管娇娇
  • 作者简介:钱雪忠(1967—),男,江苏无锡人,副教授,硕士,CCF会员,主要研究方向:数据挖掘、机器学习、人工智能
    周世兵(1972—),男,江苏盐城人,副教授,博士,主要研究方向:模式识别、人工智能
    姜凯彬(1998—),男,山东烟台人,硕士研究生,CCF会员,主要研究方向:人工智能、机器学习
    宋威(1981—),男,湖北恩施人,教授,博士,主要研究方向:数据挖掘、机器学习、模式识别。
  • 基金资助:
    国家自然科学基金资助项目(62076110);江苏省自然科学基金资助项目(BK20181341)

Abstract:

Most of the existing multi-view clustering algorithms assume that there is a linear relationship between multi-view data points, and fail to maintain the locality of original feature space during the learning process. At the same time, merging subspace in Euclidean space is too rigid to align learned subspace representations. To solve the above problems, a multi-view clustering algorithm via subspaces merging on Grassmann manifold was proposed. Firstly, the kernel trick and the learning of local manifold structure were combined to obtain the subspace representations of different views. Then, the subspace representations were merged on the Grassmann manifold to obtain the consensus affinity matrix. Finally, spectral clustering was performed on the consensus affinity matrix to obtain the final clustering result. And Alternating Direction Method of Multipliers (ADMM) was used to optimize the proposed model. Compared with Kernel Multi-view Low-Rank Sparse Subspace Clustering (KMLRSSC) algorithm, the proposed algorithm has the clustering accuracy improved by 20.83 percentage points, 9.47 percentage points and 7.33 percentage points on MSRCV1, Prokaryotic and Not-Hill datasets. Experimental results verify the effectiveness and good performance of the multi-view clustering algorithm via subspace merging on Grassmann manifold.

Key words: subspace merging, multi-view clustering, kernel trick, local manifold structure, Grassmann manifold

摘要:

现有的多视图聚类算法大多假设多视图数据点之间为线性关系,且在学习过程中无法保留原始特征空间的局部性;而在欧氏空间中进行子空间融合又过于单调,无法将学习到的子空间表示对齐。针对以上问题,提出了基于格拉斯曼流形融合子空间的多视图聚类算法。首先,将核技巧和局部流形结构学习结合以得到不同视图的子空间表示;然后,在格拉斯曼流形上融合这些子空间表示以得到一致性亲和矩阵;最后,对一致性亲和矩阵执行谱聚类来得到最终的聚类结果,并利用交替方向乘子法(ADMM)来优化所提模型。与核多视图低秩稀疏子空间聚类(KMLRSSC)算法相比,所提算法的聚类精度在MSRCV1、Prokaryotic、Not-Hill数据集上分别提高了20.83个百分点、9.47个百分点和7.33个百分点。实验结果验证了基于格拉斯曼流形融合子空间的多视图聚类算法的有效性和良好性能。

关键词: 子空间融合, 多视图聚类, 核技巧, 局部流形结构, 格拉斯曼流形

CLC Number: