《计算机应用》唯一官方网站

• •    下一篇

基于加权锚点的自适应多视图互补聚类算法

区卓越1,邓秀勤2,陈磊2   

  1. 1. 广东工业大学
    2. 广东工业大学数学与统计学院
  • 收稿日期:2023-12-12 修回日期:2024-03-25 发布日期:2024-04-28 出版日期:2024-04-28
  • 通讯作者: 邓秀勤
  • 基金资助:
    国家自然科学基金青年基金资助项目;广东省研究生教育创新计划项目

Self-adaptive multi-view clustering algorithm with complementarity based on weighted anchors

  • Received:2023-12-12 Revised:2024-03-25 Online:2024-04-28 Published:2024-04-28
  • Contact: Deng XiuQin
  • Supported by:
    the National Natural Science Foundation of China Youth Fund Project;Postgraduate Educational Innovation Program of Guangdong

摘要: 摘 要: 在多视图聚类问题中,如何充分挖掘各视图间的关联信息,同时降低冗余信息对聚类效果的影响是当前亟需解决的问题。现有方法存在一些局限性,有的忽略各视图间的互补性信息,有的忽视各视图间的差异性,有的则没有考虑冗余信息带来的干扰,从而导致聚类效果不佳。针对这些局限性,提出了一种基于加权锚点的自适应多视图互补聚类算法(SMCWA)。在应对高维多视图数据的挑战时,首先将特征直连方法迁移至锚点机制,融合各锚图以利用视图间的互补性信息;其次,在迭代过程中,使用加权矩阵动态确定各锚点的权重,从而弱化冗余信息的表达。最后,使用自动权重机制,为各视图自适应地分配适当的权重,以利用视图间的差异性。将上述优化方案整合至同一框架中,使得视图互补性、冗余信息的弱化以及视图差异性在多步迭代中相互促进、相互学习,进而提高聚类效果。实验证明,在BDGP(a RGB-D Scene Understanding benchmark suite)数据集上,SMCWA算法在马修斯相关系数评价指标(MCC)上较基于特征直连的谱聚类算法(SC-Concat)提升了42%;在CCV(Columbia Consumer Video)数据集上,SMCWA算法在MCC上较大规模线性时间多视图子空间聚类算法(LMVSC)提升了12%;在Caltech101-all数据集上,SMCWA算法在MCC上均谱聚类算法(SC-Best)在各视图中的最佳结果提升了20%,表明该算法可充分利用互补性信息、视图差异和冗余信息以提高聚类效果。

关键词: 关键词: 自动权重机制, 互补性, 锚点机制, 子空间聚类, 多视图聚类

Abstract: Abstract: In multi view clustering problems, how to fully explore the correlation information between views while reducing the impact of redundant information on clustering performance is an urgent problem that needs to be solved. Existing methods have some limitations, some ignore the complementary information across views, some ignore the differences among views, and some do not consider the interference caused by redundant information, resulting in poor clustering performance. To address these issues, a Self-adaptive Multi-view clustering algorithm with Complementarity based on Weighted Anchors (SMCWA) was proposed. When dealing with the challenges of high-dimensional multi view data, firstly, feature concatenation was transferred to be applied in anchor mechanism to fuse the anchor graphs to utilize the complementary information between views, Secondly, to weaken the expression of redundant information, the weights of each anchor point were dynamically determined through a weighted matrix during the iteration process; Finally, to utilize the differences between views, an auto-weighted mechanism was used to adaptively assign appropriate weights to each view. The complementarity across views, the redundant information in each view, and differences among views promoted and learned from each other in multi-step iterations in a integrated framework to obtain better clustering performance. Experimental results show that the proposed algorithm improves Matthews Correlation Coefficient evaluation index (MCC) by 42% on dataset BDGP(a RGB-D Scene Understanding benchmark suite) compared to feature-Concatenated based Spectral Clustering(SC-Concat), improves MCC by 12% on dataset CCV(Columbia Consumer Video) compared to Large-scale Multi-View Subspace Clustering in linear time (LMVSC), and improves MCC by 20% on dataset Caltech101-all compared to the best result of Spectral Clustering(SC-Best) on each view, which means that it makes full use of the complementary information, the differences among the views and the redundant information to obtain better clustering performance.

Key words: Keywords: auto-weighted mechanism, complementarity, anchor mechanism, subspace clustering, multi-view clustering

中图分类号: