paper-with-me

홈 › Papers

Deep Embedded Multi-View Clustering via Jointly Learning Latent Representations and Graphs

2022-05-08 · Zongmo Huang, Yazhou Ren, Xiaorong Pu, Lifang He

With the representation learning capability of the deep learning models, deep embedded multi-view clustering (MVC) achieves impressive performance in many scenarios and has become increasingly popular in recent years. Although great progress has been made in this field, most existing methods merely focus on learning the latent representations and ignore that learning the latent graph of nodes also provides available information for the clustering task. To address this issue, in this paper we propose Deep Embedded Multi-view Clustering via Jointly Learning Latent Representations and Graphs (DMVCJ), which utilizes the latent graphs to promote the performance of deep embedded MVC models from two aspects. Firstly, by learning the latent graphs and feature representations jointly, the graph convolution network (GCN) technique becomes available for our model. With the capability of GCN in exploiting the information from both graphs and features, the clustering performance of our model is significantly promoted. Secondly, based on the adjacency relations of nodes shown in the latent graphs, we design a sample-weighting strategy to alleviate the noisy issue, and further improve the effectiveness and robustness of the model. Experimental results on different types of real-world multi-view datasets demonstrate the effectiveness of DMVCJ.

📄 PDF Abstract BibTeX arXiv:2205.03803

Code (0)

등록된 구현이 없습니다.

Tasks

ClusteringRepresentation Learning

Methods 이 논문이 사용한 방법론

Convolution A convolution is a type of matrix operation, consisting of a kernel, a small matrix of weights, that slides over input data performing element-wise multiplication with the…
GCN A Graph Convolutional Network, or GCN, is an approach for semi-supervised learning on graph-structured data. It is based on an efficient variant of [convolutional neural…

Similar Papers 제목 키워드 기반

Dual Information Enhanced Multi-view Attributed Graph Clustering

2022-11-28 · Jia-Qi Lin, Man-Sheng Chen, Xi-Ran Zhu, Chang-Dong Wang 외

Multi-view attributed graph clustering is an important approach to partition multi-view data based on the attribute feature and adjacent matrices from different views. Some attempts have been made in utilizing Graph Neur…

AttributeClusteringGraph ClusteringGraph Neural Network

Jointly Deep Multi-View Learning for Clustering Analysis

2018-08-19 · Bingqian Lin, Yuan Xie, Yanyun Qu, Cuihua Li 외

In this paper, we propose a novel Joint framework for Deep Multi-view Clustering (DMJC), where multiple deep embedded features, multi-view fusion mechanism and clustering assignments can be learned simultaneously. Our ke…

ClusteringMultiview ClusteringMULTI-VIEW LEARNING

Multi-view Deep Subspace Clustering Networks

2019-08-06 · Pengfei Zhu, Xinjie Yao, Yu Wang, Binyuan Hui 외

Multi-view subspace clustering aims to discover the inherent structure of data by fusing multiple views of complementary information. Most existing methods first extract multiple types of handcrafted features and then le…

ClusteringDiversityModel SelectionMulti-view Subspace Clustering

One for all: A novel Dual-space Co-training baseline for Large-scale Multi-View Clustering

2024-01-28 · Zisen Kong, Zhiqiang Fu, Dongxia Chang, Yiming Wang 외

In this paper, we propose a novel multi-view clustering model, named Dual-space Co-training Large-scale Multi-view Clustering (DSCMC). The main objective of our approach is to enhance the clustering performance by levera…

AllClustering

Improving Deep Embedded Clustering via Learning Cluster-level Representations

2022-10-01 · COLING 2022 10 · Qing Yin, Zhihua Wang, Yunya Song, Yida Xu 외

Driven by recent advances in neural networks, various Deep Embedding Clustering (DEC) based short text clustering models are being developed. In these works, latent representation learning and text clustering are perform…

ClusteringContrastive LearningRepresentation LearningShort Text Clustering+1