.png){kind=icon}
返回
One-step Kernel Multi-view Subspace Clustering
.png){kind=icon}
PRE
AI
DOI：10.1016/j.knosys.2019.105126.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Multi-view subspace clustering is essential to many scientific problems. However, most existing methods suffer from three aspects of issues. First, these methods usually adopt a two-step framework, lacking the ability to achieve an optimal common affinity matrix across multiple views. Second, these methods are intended to solve the clustering problem in linear subspaces but may fail in practice as most real-world data sets may exhibit non-linear structures. Third, most existing subspace-based methods force the negative elements in the coefficient matrix to be positive, which may damage the inherent correlation among the data. To address above issues, we propose a novel approach termed One-step Kernel Multi-view Subspace Clustering (OKMSC). The common affinity matrix is learned from all views under one-step framework, which integrates the nonnegative and discriminative property of affinity matrix into the computation. Further, a kernelized model is designed to address the nonlinear multi-view clustering problem. And an iterative optimization method is designed to solve the objective function in this model. Extensive experiments have validated the superiority of the proposed method over several state-of-art clustering methods. (C) 2019 Elsevier B.V. All rights reserved.
Keyword:
Subspace clustering
Multi-view data
One-step strategy
Kernelized model
Simplex constraint
Rank constraint
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
K
IF:
7.6
论文数:
1.3W
被引数:
4.5W
机构
引用论文
Evaluating the Interpersonal Needs Questionnaire: Comparison of the Reliability, Factor Structure, and Predictive Validity across Five Versions评估人际需求问卷: 五个版本的可靠性，因素结构和预测效度的比较
PREAI
分享收藏Unsupervised feature extraction by low-rank and sparsity preserving embedding.png)
NEURAL NETWORKS
NEURAL NETWORKSIF6.3
PREAI
分享收藏
查看更多内容