.png){kind=icon}
返回
Multiple kernel subspace clustering with local structural graph and low-rank consensus kernel learning
.png){kind=icon}
PRE
AI
DOI：10.1016/j.knosys.2019.105040.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Multiple kernel learning (MKL) methods are generally believed to perform better than single kernel learning (SKL) methods in handling nonlinear subspace clustering problem, largely thanks to MKL avoids selecting and tuning a pre-defined kernel. However, previous MKL methods mainly focused on how to define a kernel weighting strategy, but ignored the structural characteristics of the input data in both the original space and the kernel space. In this paper, we first propose a novel graph based MKL method for subspace clustering, namely, Local Structural Graph and Low-Rank Consensus Multiple Kernel Learning (LLMKL). It jointly learns an optimal affinity graph and a suitable consensus kernel for clustering purpose by elegantly integrating the MKL technology, the global structure in the kernel space, the local structure in the original space, and the Hilbert space self-expressiveness property in a unified optimization model. In particular, to capture the data global structure, we employ a substitute of the desired consensus kernel, and then introduce a low-rank constraint on the substitute to encourage that the structure of linear subspaces is present in the feature space. Moreover, the data local structure is explored by building a complete graph, where each sample is treated as a node, and an edge codes the pairwise affinity between two samples. By such, the consensus kernel learning and the affinity graph learning can promote each other such that the data in resulting Hilbert space are both self-expressive and low-rank. Experiments on both image and text clustering well demonstrate that LLMKL outperforms the state-of-the-art methods. (C) 2019 Elsevier B.V. All rights reserved.
Keyword:
Multiple kernel learning
Subspace clustering
Self-expressiveness
Structure learning
Low-rank kernel
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
K
IF:
7.6
论文数:
1.2W
被引数:
4.5W
机构
引用论文
Multi-view manifold regularized learning-based method for prioritizing candidate disease miRNAs
.png){kind=icon}
PREAI
分享收藏
Dual Graph Regularized Latent Low-Rank Representation for Subspace Clustering用于子空间聚类的对偶图正则化潜在低秩表示
PREAI
分享收藏Seroepidemiological survey forBorrelia burgdorferi (Lyme disease) in dogs from northwestern of Spain
PREAI
分享收藏分享收藏
查看更多内容