arrow
Return

Simultaneous Global and Local Graph Structure Preserving for Multiple Kernel Clustering

delete2021-05-01
delete126
PRE
AI
任
任珍文 (Zhenwen Ren)
孙
孙权森 (Quansen Sun) *
DOI:10.1109/TNNLS.2020.2991366delete
deleteOriginal
deleteOriginal request for help
deleteShare
deleteSave
Abstract

Abstract

En 中文
Multiple kernel learning (MKL) is generally recognized to perform better than single kernel learning (SKL) in handling nonlinear clustering problem, largely thanks to MKL avoids selecting and tuning predefined kernel. By integrating the self-expression learning framework, the graph-based MKL subspace clustering has recently attracted considerable attention. However, the graph structure of data in kernel space is largely ignored by previous MKL methods, which is a key concept of affinity graph construction for spectral clustering purposes. In order to address this problem, a novel MKL method is proposed in this article, namely, structure-preserving multiple kernel clustering (SPMKC). Specifically, SPMKC proposes a new kernel affine weight strategy to learn an optimal consensus kernel from a predefined kernel pool, which can assign a suitable weight for each base kernel automatically. Furthermore, SPMKC proposes a kernel group self-expressiveness term and a kernel adaptive local structure learning term to preserve the global and local structure of the input data in kernel space, respectively, rather than the original space. In addition, an efficient algorithm is proposed to solve the resulting unified objective function, which iteratively updates the consensus kernel and the affinity graph so that collaboratively promoting each of them to reach the optimum condition. Experiments on both image and text clustering demonstrate that SPMKC outperforms the state-of-the-art MKL clustering methods in terms of clustering performance and computational cost.
Keywords:
Kernel
Sun
Clustering methods
Linear programming
Learning systems
Tuning
Computational efficiency
Affinity graph learning
kernel self-expression
multiple kernel learning (MKL)
structure preserving
subspace clustering
AI Summary

AI Summary

Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.

Journal

IEEE Transactions on Neural Networks and Learning Systems cover
IEEE Transactions on Neural Networks and Learning Systems
IF:
8.9
Papers:
7.6K
Citations:
7.2W

Organization

No organization information available
Cited Papers

Cited Papers

Environmental engagements through the lens of disclosure practices
err2006-03-01
err0
PREAI
errHaslinda Yusoff; Glen Lehman; Noraini Mohd Nasir
errShare
errSave
Low-rank kernel learning for graph-based clustering
err2019-01-01
err150
errOAAI
errKang, Zhao; Wen, Liangjian; Chen, Wenyu; Xu, Zenglin
errShare
errSave
Optimal detection strategy for super-resolving quantum lidar
err2016-01-13
err0
PREAI
errQ. Wang; L. Hao; Y. Zhang; C. Yang; X. Yang; L. Xu; Y. Zhao
errShare
errSave
A general kernelization framework for learning algorithms based on kernel PCA
err2010-01-01
err91
PREAI
errZhang, Changshui; Nie, Feiping; Xiang, Shiming
errShare
errSave
errShare
errSave
errShare
errSave
researcher View more