Deep node clustering based on mutual information maximization
Variational Graph Autoencoders (VGAs) are generative models for unsupervised learning of node representations within graph data. While VGAs have been achieved state-of-the-art results for different predictive tasks on graph-structured data, they are susceptible to the over-pruning problem where only...
Main Authors: | Molaei, S, Ghanbari Bousejin, N, Zare, H, Jalili, M |
---|---|
Format: | Journal article |
Language: | English |
Published: |
Elsevier
2021
|
Similar Items
-
Learning graph representations with maximal cliques
by: Molaei, S, et al.
Published: (2021) -
Deep Image Clustering Based on Label Similarity and Maximizing Mutual Information across Views
by: Feng Peng, et al.
Published: (2023-01-01) -
Image Clustering Based on Multi-Scale Deep Maximize Mutual Information and Self-Training Algorithm
by: Siquan Yu, et al.
Published: (2020-01-01) -
Word sense induction with agglomerative clustering and mutual information maximization
by: Hadi Abdine, et al.
Published: (2023-01-01) -
Stable and Fast Deep Mutual Information Maximization Based on Wasserstein Distance
by: Xing He, et al.
Published: (2023-11-01)