WatE: A Wasserstein t-distributed Embedding Method for Information-enriched Graph Visualization
Minjie Cheng, Dixin Luo, Hongteng Xu
Abstract
As a fundamental problem of graph analysis, graph visualization aims to embed a set of graphs in a low-dimensional (e.g., 2D) space and provide insights into their distribution and clustering structure. Focusing on this problem, we propose a novel Wasserstein t-distributed embedding (WatE) method, leading to an information-enriched graph visualization paradigm. Our method learns a graph neural network to represent each graph as the mean and covariance of its node embedding distribution. Accordingly, our method can visualize each graph as an ellipse (determined by the mean and the covariance) rather than a single point. The positions of different ellipses reveal the relations among different graphs as traditional visualization methods do, while the size and shape of an ellipse preserve the node-level structural information of the corresponding graph. We propose a regularized t-distributed stochastic neighbor embedding (Rt-SNE) framework to learn the visualization model, deriving a Wasserstein distance-based Student's t-distribution of graph pairs and fitting the distribution to the data distribution under regularization. Both subjective and objective evaluations demonstrate that WatE achieves encouraging performance in various graph visualization and clustering tasks.
Ask about this paper
Your agent reads all of it.
Lune indexed this paper to the last equation, along with the top-tier papers that cite it. Ask a question and the answer quotes them.
Your agent calls
Luneget_paper_fulltext
Free to start. No credit card required.
Terminal
Install the CLIlune papers fulltext 42d3c9d7-e7ae-4b0a-8222-922501d78cd5Cited by top-tier papers1
Ask how each one uses itBuilds on5
- Graph Contrastive Learning with AugmentationsYuning You, Tianlong Chen, Yongduo Sui, Ting Chen et al.NeurIPS 2020 · 3,042 citations
- InfoGraph: Unsupervised and Semi-supervised Graph-Level Representation Learning via Mutual Information MaximizationFan-Yun Sun, Jordan Hoffmann, Vikas Verma, Jian TangICLR 2020 · 1,010 citations
- Adversarial Graph Augmentation to Improve Graph Contrastive LearningSusheel Suresh, Pan Li, Cong Hao, Jennifer NevilleNeurIPS 2021 · 475 citations
- Online Graph Dictionary LearningCédric Vincent-Cuaz, Titouan Vayer, Rémi Flamary, Marco Corneli et al.ICML 2021 · 58 citations
- Protein Representation Learning by Geometric Structure PretrainingZuobai Zhang, Minghao Xu, Arian Rokkum Jamasb, Vijil Chenthamarakshan et al.ICLR 2023 · 40 citations
Related papers
- Wasserstein Embedding for Graph LearningSoheil Kolouri, Navid NaderiAlizadeh, Gustavo K. Rohde, Heiko HoffmannICLR 2021 · 99 citations
- Robust Self-Supervised Structural Graph Neural Network for Social Network PredictionYanfu Zhang, Hongchang Gao, Jian Pei, Heng HuangWWW 2022 · 48 citations
- Unsupervised Graph Alignment with Wasserstein Distance DiscriminatorJi Gao, Xiao Huang, Jundong LiKDD 2021 · 53 citations
- Template based Graph Neural Network with Optimal Transport DistancesCédric Vincent-Cuaz, Rémi Flamary, Marco Corneli, Titouan Vayer et al.NeurIPS 2022 · 35 citations
- A Quasi-Wasserstein Loss for Learning Graph Neural NetworksMinjie Cheng, Hongteng XuWWW 2024 · 2 citations
