arrow
返回

Bipartite Graph Based Multi-View Clustering

delete2020-01-01
delete58
PRE
AI
L
Lusi Li
H
Haibo He *
DOI:10.1109/TKDE.2020.3021649delete
delete原文链接
delete原文求助
delete分享
delete收藏
摘要

摘要

En 中文
For graph-based multi-view clustering, a critical issue is to capture consensus cluster structures via a two-stage learning scheme. Specifically, first learn similarity graph matrices of multiple views and then fuse them into a unified superior graph matrix. Most current methods learn pairwise similarities between data points for each view independently, which is widely used in single view. However, the consensus information contained in multiple views are ignored, and the involved biases lead to an undesirable unified graph matrix. To this end, we propose a bipartite graph based multi-view clustering (BIGMC) approach. The consensus information can be represented by a small number of representative uniform anchor points for different views. A bipartite graph is constructed between data points and the anchor points. BIGMC constructs the bipartite graph matrices of all views and fuses them to produce a unified bipartite graph matrix. The unified bipartite graph matrix in turn improves the bipartite graph similarity matrix of each view and updates the anchor points. The final unified graph matrix forms the final clusters directly. In BIGMC, an adaptive weight is added for each view to avoid outlier views. A low-rank constraint is imposed on the Laplacian matrix of the unified matrix to construct a multi-component unified bipartite graph, where the component number corresponds to the required cluster number. The objective function is optimized in an alternating optimization fashion. Experimental results on synthetic and real-world data sets demonstrate its effectiveness and superiority compared with the state-of-the-art baselines.
Keyword:
Bipartite graph
Clustering methods
Data mining
Kernel
Fuses
Laplace equations
Optimization
Multi-view clustering
similarity matrix
consensus information
bipartite graph
AI总结

AI总结

对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。

期刊

IEEE Transactions on Knowledge and Data Engineering 封面图
IEEE Transactions on Knowledge and Data Engineering
IF:
10.4
论文数:
6.9K
被引数:
3.2W

机构

U
University of Rhode Island
学者数:
5.0K
论文数: 4.5K
被引数: 6.3K
引用论文

引用论文

err分享
err收藏
err分享
err收藏
err分享
err收藏
err分享
err收藏
err分享
err收藏
Graph Learning for Multiview Clustering面向多视图聚类的图学习
err2018-10-01
err393
PREAI
errZhan, Kun; Zhang, Changqing; Guan, Junpeng; Wang, Junsheng
err分享
err收藏
Robust Low-Rank Kernel Subspace Clustering based on the Schatten p-norm and Correntropy
err2020-12-01
err21
PREAI
errZhang, Xiaoqian; Chen, Beijia; Sun, Huaijiang; Liu, Zhigui; Ren, Zhenwen; Li, Yanmeng
err分享
err收藏
学者 查看更多内容