The DOI matches its Crossref record; 33 of the 33 references it cites were found in a registry or an index.
Graph Representation Learning via Graphical Mutual Information Maximization
Open accessAbstract
The richness in the content of various information networks such as social networks and communication networks provides the unprecedented potential for learning high-quality expressive representations without external supervision. This paper investigates how to preserve and extract the abundant information from graph-structured data into embedding space in an unsupervised manner. To this end, we propose a novel concept, Graphical Mutual Information (GMI), to measure the correlation between input graphs and high-level hidden representations. GMI generalizes the idea of conventional mutual information computations from vector space to the graph domain where measuring mutual information from two aspects of node features and topological structure is indispensable. GMI exhibits several benefits: First, it is invariant to the isomorphic transformation of input graphs—an inevitable constraint in many existing graph representation learning algorithms; Besides, it can be efficiently estimated and maximized by current mutual information estimation methods such as MINE; Finally, our theoretical analysis confirms its correctness and rationality. With the aid of GMI, we develop an unsupervised learning model trained by maximizing GMI between the input and output of a graph neural encoder. Considerable experiments on transductive as well as inductive node classification and link prediction demonstrate that our method outperforms state-of-the-art unsupervised counterparts, and even sometimes exceeds the performance of supervised ones.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Deep Residual Learning for Image Recognition
He, K., Zhang, X., Ren, S., & Sun, J. (2016) · 2016 IEEE Conference on Computer Vision and Pattern Recognition (CVPR) · doi:10.1109/cvpr.2016.90 · Cited by 235,474
Scikit-learn: Machine Learning in Python
Pedregosa, F., Varoquaux, G., Gramfort, A., Michel, V., Thirion, B., Grisel, O., Blondel, M., Müller, A., Nothman, J., Louppe, G., et al. (2012) · arXiv · doi:10.48550/arxiv.1201.0490 · Cited by 71,016
(2008) · Journal of Machine Learning Research · Cited by 33,051
Silhouettes: A graphical aid to the interpretation and validation of cluster analysis
Rousseeuw, P. J. (1987) · Journal of Computational and Applied Mathematics · doi:10.1016/0377-0427(87)90125-7 · Cited by 21,392
(2010) · Cited by 14,134
node2vec: Scalable Feature Learning for Networks
Grover, A., & Leskovec, J. (2016) · Proceedings of the 22nd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining · doi:10.1145/2939672.2939754 · Cited by 10,926
Inductive Representation Learning on Large Graphs
Hamilton, W. L., Ying, R., & Leskovec, J. (2017) · arXiv · doi:10.48550/arxiv.1706.02216 · Cited by 10,639
DeepWalk: online learning of social representations
Perozzi, B., Al-Rfou, R., & Skiena, S. (2014) · Proceedings of the 20th ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/2623330.2623732 · Cited by 10,123
Representation Learning with Contrastive Predictive Coding
Oord, A. V. D., Li, Y., & Vinyals, O. (2018) · arXiv · doi:10.48550/arxiv.1807.03748 · Cited by 6,242
LINE: Large-scale Information Network Embedding
Tang, J., Qu, M., Wang, M., Zhang, M., Yan, J., & Mei, Q. (2015) · Proceedings of the 24th International Conference on World Wide Web · doi:10.1145/2736277.2741093 · Cited by 5,416
Semi-supervised learning using Gaussian fields and harmonic functions
Zhu, X., Zoubin Ghahramani, A., & Lafferty, J. (2003) · Cited by 3,509
Collective Classification in Network Data
Sen, P., Namata, G., Bilgic, M., Getoor, L., Gallagher, B., & Eliassi‐Rad, T. (2008) · AI Magazine · doi:10.1609/aimag.v29i3.2157 · Cited by 3,293
The link‐prediction problem for social networks
Liben‐Nowell, D., & Kleinberg, J. (2007) · Journal of the American Society for Information Science and Technology · doi:10.1002/asi.20591 · Cited by 3,043
Elements of Information Theory
Nalewajski, R. F. (2011) · Perspectives in Electronic Structure Theory · doi:10.1007/978-3-642-20180-6_8 · Cited by 2,309
GraRep: Learning Graph Representations with Global Structural Information
Cao, S., Lu, W., & Xu, Q. (2015) · Proceedings of the 24th ACM International on Conference on Information and Knowledge Management · doi:10.1145/2806416.2806512 · Cited by 1,571
Deep Graph InfomaxPreprint
Veličković, P., Fedus, W., Hamilton, W. L., Lió, P., Bengio, Y., & Hjelm, R. D. (2018) · arXiv (Cornell University) · doi:10.48550/arxiv.1809.10341 · Cited by 1,506
f-GAN: Training Generative Neural Samplers using Variational Divergence Minimization
Nowozin, S., Cseke, B., & Tomioka, R. (2016) · arXiv · doi:10.48550/arxiv.1606.00709 · Cited by 1,183
Asymptotic evaluation of certain markov process expectations for large time, II
Donsker, M. D., & Varadhan, S. R. S. (1975) · Communications on Pure and Applied Mathematics · doi:10.1002/cpa.3160280206 · Cited by 1,025
Mutual Information Neural Estimation.
Belghazi, M. I., Baratin, A., Rajeshwar, S., Ozair, S., Bengio, Y., Courville, A. C., & Hjelm, D. (2018) · International Conference on Machine Learning · Cited by 920
Network Embedding as Matrix Factorization: Unifying DeepWalk, LINE, PTE, and node2vec
Qiu, J., Dong, Y., Ma, H., Li, J., Wang, K., & Tang, J. (2018) · Proceedings of the Eleventh ACM International Conference on Web Search and Data Mining · doi:10.1145/3159652.3159706 · Cited by 717
Predicting multicellular function through multi-layer tissue networks
Zitnik, M., & Leskovec, J. (2017) · Bioinformatics · doi:10.1093/bioinformatics/btx252 · Cited by 519
Ketkar, N. (2017) · Deep Learning with Python · doi:10.1007/978-1-4842-2766-4_12 · Cited by 443
Asymptotic evaluation of certain markov process expectations for large time. IV
Donsker, M. D., & Varadhan, S. R. S. (1983) · Communications on Pure and Applied Mathematics · doi:10.1002/cpa.3160360204 · Cited by 392
Zaheer, M., Kottur, S., Ravanbakhsh, S., Póczos, B., Salakhutdinov, R. R., & Smola, A. J. (2017) · neural information processing systems · Cited by 279
Link Prediction Based on Graph Neural Networks
Zhang, M., & Chen, Y. (2018) · arXiv (Cornell University) · doi:10.48550/arxiv.1802.09691 · Cited by 263
REGAL: Representation Learning-based Graph Alignment
Heimann, M., Shen, H., Safavi, T., & Koutra, D. (2018) · Proceedings of the 27th ACM International Conference on Information and Knowledge Management · doi:10.1145/3269206.3271788 · Cited by 257
Bayesian Graph Convolutional Neural Networks for Semi-Supervised Classification
Zhang, Y., Pal, S., Coates, M., & Ustebay, D. (2019) · Proceedings of the AAAI Conference on Artificial Intelligence · doi:10.1609/aaai.v33i01.33015829 · Cited by 199
Molecular Generation with Recurrent Neural Networks (RNNs)Preprint
Bjerrum, E. J., & Threlfall, R. (2017) · arXiv (Cornell University) · doi:10.48550/arxiv.1705.04612 · Cited by 178
Semi-supervised Learning on Graphs with Generative Adversarial Nets
Ding, M., Tang, J., & Zhang, J. (2018) · ACM International Conference on Information and Knowledge Management (CIKM) · doi:10.1145/3269206.3271768 · Cited by 144
The link-prediction problem for social networks
Liben-NowellDavid, & KleinbergJon (2007) · Journal of the American Society for Information Science and Technology · doi:10.5555/1241540.1241551 · Cited by 125
Learning Graph Representations with Embedding Propagation
Durán, A. G., & Niepert, M. (2017) · neural information processing systems · Cited by 78
MISEP - Linear and Nonlinear ICA Based on Mutual Information
Redol, R. A. (2003) · Cited by 38
Jointly Learning Entity and Relation Representations for Entity AlignmentPreprint
Wu, Y., Liu, X., Feng, Y., Wang, Z., & Zhao, D. (2019) · arXiv (Cornell University) · doi:10.48550/arxiv.1909.09317 · Cited by 26
Cited by
Graph Contrastive Learning with Adaptive Augmentation
Zhu, Y., Xu, Y., Yu, F., Liu, Q., Wu, S., & Wang, L. (2021) · Proceedings of the Web Conference 2021 · doi:10.1145/3442381.3449802 · Cited by 1,066
Graph Contrastive Learning with Augmentations
You, Y., Chen, T., Sui, Y., Chen, T., Wang, Z., & Shen, Y. (2020) · arXiv (Cornell University) · doi:10.48550/arxiv.2010.13902 · Cited by 824
Improving Graph Collaborative Filtering with Neighborhood-enriched Contrastive Learning
Lin, Z., Tian, C., Hou, Y., & Zhao, W. X. (2022) · Proceedings of the ACM Web Conference 2022 · doi:10.1145/3485447.3512104 · Cited by 572
A comprehensive survey on pretrained foundation models: a history from BERT to ChatGPT
Zhou, C., Li, Q., Li, C., Yu, J., Liu, Y., Wang, G., Zhang, K., Ji, C., Yan, Q., He, L., et al. (2025) · International Journal of Machine Learning and Cybernetics · doi:10.1007/s13042-024-02443-6 · Cited by 557
Self-Supervised Multi-Channel Hypergraph Convolutional Network for Social Recommendation
Yu, J., Yin, H., Li, J., Wang, Q., Hung, N. Q. V., & Zhang, X. (2021) · Proceedings of the Web Conference 2021 · doi:10.1145/3442381.3449844 · Cited by 519
Metadata
- Authors
- Peng, Z., Huang, W., Luo, M., Zheng, Q., Rong, Y., Xu, T., & Huang, J.
- Venue
- Proceedings of The Web Conference 2020
- Publisher
- ACM
- Published
- 2020-04-20
- Pages
- 259-270
- OpenAlex
- W3012816161
- Cited by
- 536
- References
- 33
- FWCI
- 31.14
- Type
- conference paper
- Language
- en
- Open access
- gold
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.