Fetching the paper…
Reading the bibliography…
Recently, maximizing mutual information has emerged as a powerful method for unsupervised graph representation learning.
T. Caliński and J. Harabasz, “A dendrite method for cluster analysis,” Communications in Statistics-theory and Methods , vol. 3, no. 1, pp. 1–27, 1974
1974
Earlier work this paper cites.
P. J. Rousseeuw, “Silhouettes: A graphical aid to the interpretation and validation of cluster analysis,” Journal of computational and applied mathematics , vol. 20, pp. 53–65, 1987
1987
Earlier work this paper cites.
X. Zhu, Z. Ghahramani, and J. D. Lafferty, “Semi-supervised learning using Gaussian fields and harmonic functions,” in Proceedings of the International Conference on Machine learning , 2003
2003
Earlier work this paper cites.
F. Scarselli, M. Gori, A. C. Tsoi, M. Hagenbuchner, and G. Monfardini, “The graph neural network model,” IEEE Transactions on Neural Networks , vol. 20, no. 1, pp. 61–80, 2008
2008
Earlier work this paper cites.
2008
Earlier work this paper cites.
X. Glorot and Y. Bengio, “Understanding the difficulty of training deep feedforward neural networks,” in Proceedings of the International Conference on Artificial Intelligence and Statistics , 2010
2010
Earlier work this paper cites.
B. Perozzi, R. Al-Rfou, and S. Skiena, “Deepwalk online learning of social representations,” in Proceedings of the ACM SIGKDD International Conference on Knowledge Discovery and Data Mining , 2014
2014
Earlier work this paper cites.
D. P. Kingma and J. Ba, “Adam a method for stochastic optimization,” in Proceedings of the International Conference on Learning Representations , 2015
2015
Earlier work this paper cites.
K. He, X. Zhang, S. Ren, and J. Sun, “Delving deep into rectifiers surpassing human-level performance on imagenet classification,” in Proceedings of the IEEE International Conference on Computer Vision , 2015
2015
Earlier work this paper cites.
T. N. Kipf and M. Welling, “Variational graph auto-encoders,” NeurIPS Workshop on Bayesian Deep Learning , 2016
2016
Earlier work this paper cites.
Z. Yang, W. Cohen, and R. Salakhudinov, “Revisiting semi-supervised learning with graph embeddings,” in Proceedings of the International Conference on Machine Learning , 2016
2016
Earlier work this paper cites.
T. N. Kipf and M. Welling, “Semi-supervised classification with graph convolutional networks,” in Proceedings of the International Conference on Learning Representations , 2017
2017
Earlier work this paper cites.
J. Gilmer, S. S. Schoenholz, P. F. Riley, O. Vinyals, and G. E. Dahl, “Neural message passing for quantum chemistry,” in Proceedings of the International Conference on Machine Learning , 2017
2017
Earlier work this paper cites.
W. L. Hamilton, R. Ying, and J. Leskovec, “Inductive representation learning on large graphs,” in Proceedings of the International Conference on Neural Information Processing Systems , 2017, pp. 1025–1035
2017
Earlier work this paper cites.
P. Velivckovi’c, G. Cucurull, A. Casanova, A. Romero, P. Li’o, and Y. Bengio, “Graph attention networks,” in Proceedings of the International Conference on Learning Representations , 2018
2018
Cited alongside, same era.
A. v. d. Oord, Y. Li, and O. Vinyals, “Representation learning with contrastive predictive coding,” arXiv preprint arXiv1807.03748 , 2018
2018
Cited alongside, same era.
M. I. Belghazi, A. Baratin, S. Rajeshwar, S. Ozair, Y. Bengio, A. Courville, and D. Hjelm, “Mutual information neural estimation,” in Proceedings of the International Conference on Machine Learning , 2018
2018
Cited alongside, same era.
J. Li, Z. Tu, B. Yang, M. R. Lyu, and T. Zhang, “Multi-head attention with disagreement regularization,” in Proceedings of the Conference on Empirical Methods in Natural Language Processing , 2018
2018
Cited alongside, same era.
Y. You, T. Chen, Y. Sui, T. Chen, Z. Wang, and Y. Shen, “Graph contrastive learning with augmentations,” vol. 33, 2020, pp. 5812–5823
2020
Later among the works it cites.
M. Jin, Y. Zheng, Y.-F. Li, C. Gong, C. Zhou, and S. Pan, “Multi-scale contrastive siamese networks for self-supervised graph representation learning,” in Proceedings of the International Joint Conference on Artificial Intelligence , 2020
2020
Later among the works it cites.
X. Wang, M. Zhu, D. Bo, P. Cui, C. Shi, and J. Pei, “AM-GCN adaptive multi-channel graph convolutional networks,” in Proceedings of the ACM SIGKDD International Conference on Knowledge Discovery and Data Mining , 2020
2020
Later among the works it cites.
K. He, H. Fan, Y. Wu, S. Xie, and R. Girshick, “Momentum contrast for unsupervised visual representation learning,” in Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition , 2020
2020
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
A. Bojchevski and S. Günnemann, “Deep Gaussian embedding of graphs: Unsupervised inductive learning via ranking,” in Proceedings of the International Conference on Learning Representations , 2018
2018
Cited alongside, same era.
O. Shchur, M. Mumme, A. Bojchevski, and S. Günnemann, “Pitfalls of graph neural network evaluation,” Relational Representation Learning Workshop, NeurIPS 2018 , 2018
2018
Cited alongside, same era.
P. Velivckovi’c, W. Fedus, W. L. Hamilton, P. Li’o, Y. Bengio, and R. D. Hjelm, “Deep graph infomax,” in Proceddings of the International Conference on Learning Representations , 2019
2019
Cited alongside, same era.
R. D. Hjelm, A. Fedorov, S. Lavoie-Marchildon, K. Grewal, P. Bachman, A. Trischler, and Y. Bengio, “Learning deep representations by mutual information estimation and maximization,” in Proceedings of the International Conference on Learning Representations , 2019
2019
Cited alongside, same era.
J. Klicpera, A. Bojchevski, and S. Gunnemann, “Predict then propagate: Graph neural networks meet personalized pagerank,” in Proceedings of the International Conference on Learning Representations , 2019
2019
Cited alongside, same era.
S. Abu-El-Haija, B. Perozzi, A. Kapoor, N. Alipourfard, K. Lerman, H. Harutyunyan, G. V. Steeg, and A. Galstyan, “MixHop: higher-order graph convolutional architectures via sparsified neighborhood mixing,” in Proceedings of the International Conference on Machine learning , 2019
2019
Cited alongside, same era.
X. Zhou, F. Shen, L. Liu, W. Liu, L. Nie, Y. Yang, and H. T. Shen, “Graph convolutional network hashing,” IEEE Transactions on Cybernetics , vol. 50, no. 4, pp. 1460–1472, 2020
2020
Cited alongside, same era.
X. Liu, F. Zhang, Z. Hou, Z. Wang, L. Mian, J. Zhang, and J. Tang, “Self-supervised learning generative or contrastive,” arXiv preprint arXiv2006.08218 , 2020
2020
Cited alongside, same era.
T. Chen, S. Kornblith, M. Norouzi, and G. Hinton, “A simple framework for contrastive learning of visual representations,” in Proceedings of the International Conference on Machine Learning , 2020
2020
Later among the works it cites.
Y. Liu, S. Yang, Y. Zhang, C. Miao, Z. Nie, and J. Zhang, “Learning hierarchical review graph representations for recommendation,” IEEE Transactions on Knowledge and Data Engineering , 2021
2021
Closest in time.
Y. Zheng, M. Jin, Y. Liu, L. Chi, K. T. Phan, and Y.-P. P. Chen, “Generative and contrastive self-supervised learning for graph anomaly detection,” IEEE Transactions on Knowledge and Data Engineering , pp. 1–1, 2021
2021
Closest in time.
Z. Chen, J. Xu, T. Peng, and C. Yang, “Graph convolutional network-based method for fault diagnosis using a hybrid of measurement and prior knowledge,” IEEE Transactions on Cybernetics , pp. 1–13, 2021
2021
Closest in time.
X. Fan, M. Gong, Y. Wu, A. K. Qin, and Y. Xie, “Propagation enhanced neural message passing for graph representation learning,” IEEE Transactions on Knowledge and Data Engineering , pp. 1–1, 2021
2021
Closest in time.
J. Zeng and P. Xie, “Contrastive self-supervised learning for graph classification,” in Proceedings of the AAAI conference on Artificial Intelligence , 2021
2021
Closest in time.
X. Fan, M. Gong, Z. Tang, and Y. Wu, “Deep neural message passing with hierarchical layer aggregation and neighbor normalization,” IEEE Transactions on Neural Networks and Learning Systems , pp. 1–13, 2021
2021
Closest in time.
B. Jing, C. Park, and H. Tong, “HDMI: High-order deep multiplex infomax,” in Proceedings of the Web Conference , 2021, pp. 2414–2424
2021
Closest in time.
Y. Zhu, Y. Xu, F. Yu, Q. Liu, S. Wu, and L. Wang, “Graph contrastive learning with adaptive augmentation,” in Proceedings of the Web Conference , 2021, pp. 2069–2080
2080
Closest in time.