arrow
Return

Auto-weighted multi-view clustering via kernelized graph learning

delete2019-04-01
delete187
PRE
AI
S
Shudong Huang
Z
Zhao Kang
I
Ivor W. Tsang
Z
Zenglin Xu *
DOI:10.1016/j.patcog.2018.11.007delete
deleteOriginal
deleteOriginal request for help
deleteShare
deleteSave
Abstract

Abstract

En 中文
Datasets are often collected from different resources or comprised of multiple representations (i.e., views). Multi-view clustering aims to analyze the multi-view data in an unsupervised way. Owing to the efficiency of uncovering the hidden structures of data, graph-based approaches have been investigated widely for various multi-view learning tasks. However, similarity measurement in these methods is challenging since the construction of similarity graph is impacted by several factors such as the scale of data, neighborhood size, choice of similarity metric, noise and outliers. Moreover, nonlinear relationships usually exist in real-world datasets, which have not been considered by most existing methods. In order to address these challenges, a novel model which simultaneously performs multi-view clustering task and learns similarity relationships in kernel spaces is proposed in this paper. The target optimal graph can be directly partitioned into exact c connected components if there are c clusters. Furthermore, our model can assign ideal weight for each view automatically without additional parameters as previous methods do. Since the performance is often sensitive to the input kernel matrix, the proposed model is further extended with multiple kernel learning ability. With the proposed joint model, three subtasks including construct the most accurate similarity graph, automatically allocate optimal weight for each view and find the cluster indicator matrix can be simultaneously accomplished. By this joint learning, each sub task can be mutually enhanced. Experimental results on benchmark datasets demonstrate that our model outperforms other state-of-the-art multi-view clustering algorithms. (C) 2018 Elsevier Ltd. All rights reserved.
Keywords:
Graph learning
Multi-view clustering
Multiple kernel learning
Auto-weighted strategy
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

Pattern Recognition cover
Pattern Recognition
IF:
7.6
Papers:
1.3W
Citations:
4.5W

Organization

U
university of technology sydney
Scholars:
1.6W
Papers: 2.0W
Citations: 25
Cited Papers

Cited Papers

Multi-view clustering via multi-manifold regularized non-negative matrix factorization
err2017-04-01
err220
errOAAI
errZong, Linlin; Zhang, Xianchao; Zhao, Long; Yu, Hong; Zhao, Qianli
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
Spectral co-clustering ensemble
err2015-08-01
err46
PREAI
errHuang, Shudong; Wang, Hongjun; Li, Dingcheng; Yang, Yan; Li, Tianrui
errShare
errSave
Multi-layer multi-view topic model for classifying advertising video
err2017-08-01
err33
PREAI
errHou, Sujuan; Chen, Ling; Tao, Dacheng; Zhou, Shangbo; Liu, Wenjie; Zheng, Yuanjie
errShare
errSave
Pairwise constraints based multiview features fusion for scene classification
err2013-02-01
err126
PREAI
errYu, Jun; Tao, Dacheng; Rui, Yong; Cheng, Jun
errShare
errSave
Weighted Multi-view Clustering with Feature. Selection
err2016-05-01
err157
PREAI
errXu, Yu-Meng; Wang, Chang-Dong; Lai, Jian-Huang
errShare
errSave
researcher View more