Variational Co-embedding Learning for Attributed Network Clustering
- URL: http://arxiv.org/abs/2104.07295v1
- Date: Thu, 15 Apr 2021 08:11:47 GMT
- Title: Variational Co-embedding Learning for Attributed Network Clustering
- Authors: Shuiqiao Yang, Sunny Verma, Borui Cai, Jiaojiao Jiang, Kun Yu, Fang
Chen, Shui Yu
- Abstract summary: Recent works for attributed network clustering utilize graph convolution to obtain node embeddings and simultaneously perform clustering assignments on the embedding space.
We propose a variational co-embedding learning model for attributed network clustering (ANC)
ANC is composed of dual variational auto-encoders to simultaneously embed nodes and attributes.
- Score: 30.7006907516984
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: Recent works for attributed network clustering utilize graph convolution to
obtain node embeddings and simultaneously perform clustering assignments on the
embedding space. It is effective since graph convolution combines the
structural and attributive information for node embedding learning. However, a
major limitation of such works is that the graph convolution only incorporates
the attribute information from the local neighborhood of nodes but fails to
exploit the mutual affinities between nodes and attributes. In this regard, we
propose a variational co-embedding learning model for attributed network
clustering (VCLANC). VCLANC is composed of dual variational auto-encoders to
simultaneously embed nodes and attributes. Relying on this, the mutual affinity
information between nodes and attributes could be reconstructed from the
embedding space and served as extra self-supervised knowledge for
representation learning. At the same time, trainable Gaussian mixture model is
used as priors to infer the node clustering assignments. To strengthen the
performance of the inferred clusters, we use a mutual distance loss on the
centers of the Gaussian priors and a clustering assignment hardening loss on
the node embeddings. Experimental results on four real-world attributed network
datasets demonstrate the effectiveness of the proposed VCLANC for attributed
network clustering.
Related papers
- AdaRC: Mitigating Graph Structure Shifts during Test-Time [66.40525136929398]
Test-time adaptation (TTA) has attracted attention due to its ability to adapt a pre-trained model to a target domain without re-accessing the source domain.
We propose AdaRC, an innovative framework designed for effective and efficient adaptation to structure shifts in graphs.
arXiv Detail & Related papers (2024-10-09T15:15:40Z) - A Dirichlet stochastic block model for composition-weighted networks [0.0]
We propose a block model for composition-weighted networks based on direct modelling of compositional weight vectors.
Inference is implemented via an extension of the classification expectation-maximisation algorithm.
The model is validated using simulation studies, and showcased on network data from the Erasmus exchange program and a bike sharing network for the city of London.
arXiv Detail & Related papers (2024-08-01T15:41:07Z) - Exact Recovery and Bregman Hard Clustering of Node-Attributed Stochastic
Block Model [0.16385815610837165]
This paper presents an information-theoretic criterion for the exact recovery of community labels.
It shows how network and attribute information can be exchanged in order to have exact recovery.
It also presents an iterative clustering algorithm that maximizes the joint likelihood.
arXiv Detail & Related papers (2023-10-30T16:46:05Z) - Reinforcement Graph Clustering with Unknown Cluster Number [91.4861135742095]
We propose a new deep graph clustering method termed Reinforcement Graph Clustering.
In our proposed method, cluster number determination and unsupervised representation learning are unified into a uniform framework.
In order to conduct feedback actions, the clustering-oriented reward function is proposed to enhance the cohesion of the same clusters and separate the different clusters.
arXiv Detail & Related papers (2023-08-13T18:12:28Z) - Collaborative Graph Neural Networks for Attributed Network Embedding [63.39495932900291]
Graph neural networks (GNNs) have shown prominent performance on attributed network embedding.
We propose COllaborative graph Neural Networks--CONN, a tailored GNN architecture for network embedding.
arXiv Detail & Related papers (2023-07-22T04:52:27Z) - Interpolation-based Correlation Reduction Network for Semi-Supervised
Graph Learning [49.94816548023729]
We propose a novel graph contrastive learning method, termed Interpolation-based Correlation Reduction Network (ICRN)
In our method, we improve the discriminative capability of the latent feature by enlarging the margin of decision boundaries.
By combining the two settings, we extract rich supervision information from both the abundant unlabeled nodes and the rare yet valuable labeled nodes for discnative representation learning.
arXiv Detail & Related papers (2022-06-06T14:26:34Z) - Deep Embedded Clustering with Distribution Consistency Preservation for
Attributed Networks [15.895606627146291]
In this study, we propose an end-to-end deep embedded clustering model for attributed networks.
It utilizes graph autoencoder and node attribute autoencoder to respectively learn node representations and cluster assignments.
The proposed model achieves significantly better or competitive performance compared with the state-of-the-art methods.
arXiv Detail & Related papers (2022-05-28T02:35:34Z) - Self-supervised Contrastive Attributed Graph Clustering [110.52694943592974]
We propose a novel attributed graph clustering network, namely Self-supervised Contrastive Attributed Graph Clustering (SCAGC)
In SCAGC, by leveraging inaccurate clustering labels, a self-supervised contrastive loss, are designed for node representation learning.
For the OOS nodes, SCAGC can directly calculate their clustering labels.
arXiv Detail & Related papers (2021-10-15T03:25:28Z) - Attention-driven Graph Clustering Network [49.040136530379094]
We propose a novel deep clustering method named Attention-driven Graph Clustering Network (AGCN)
AGCN exploits a heterogeneous-wise fusion module to dynamically fuse the node attribute feature and the topological graph feature.
AGCN can jointly perform feature learning and cluster assignment in an unsupervised fashion.
arXiv Detail & Related papers (2021-08-12T02:30:38Z) - A Framework for Joint Unsupervised Learning of Cluster-Aware Embedding
for Heterogeneous Networks [6.900303913555705]
Heterogeneous Information Network (HIN) embedding refers to the low-dimensional projections of the HIN nodes that preserve the HIN structure and semantics.
We propose ours for joint learning of cluster embeddings as well as cluster-aware HIN embedding.
arXiv Detail & Related papers (2021-08-09T11:36:36Z)
This list is automatically generated from the titles and abstracts of the papers in this site.
This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.