返回
Robust Multi-View Subspace Clustering Via Weighted Multi-Kernel Learning and Co-Regularization
DOI:10.1109/ACCESS.2020.3003013.png)
摘要
En 中文
Using multi-kernel learning to deal with the non-linear relationship of data has become a new research topic in the field of multi-view subspace clustering. However, the existing methods have the following three defects: 1) the simple consensus kernel weighting strategy cannot give full play to the advantages of multiple kernels; 2) they are sensitive to non-Gaussian noise and their learning affinity matrices cannot meet the block diagonal properties required by clustering, resulting in low clustering performance; 3) the complementary feature information between the data of each view cannot be fully mined. In this paper, a novel robust multi-view subspace clustering method is proposed based on weighted multi-kernel learning and co-regularization (WMKMSC). Based on the self-expression learning framework, block diagonal regularizer (BDR), multi-kernel learning strategy and co-regularization are integrated into the proposed model. Especially, as a robust learning method, the mixture correntropy is used to construct a robust multi-kernel weighting strategy, which is helpful to learn the best consensus kernel. Our method is more effective and robust than several of the most advanced methods on five commonly used datasets.
Keyword:
Kernel
Clustering methods
Clustering algorithms
Roads
Learning systems
Licenses
Task analysis
Multi-kernel learning
multi-view subspace clustering
block diagonal regularizer
co-regularization
AI总结
对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
3.6
论文数:
9.8W
被引数:
29.4W
机构
引用论文
Enhancing multi-view clustering through common subspace integration by considering both global similarities and local structures
NEUROCOMPUTING
IF6.5

