Fetching the paper…
Reading the bibliography…
Unsupervised heterogeneous graph representation learning (UHGRL) has gained increasing attention due to its significance in handling practical graphs without labels.
G. R. Terrell and D. W. Scott, “Variable kernel density estimation,” The Annals of Statistics , pp. 1236–1265, 1992
1992
Earlier work this paper cites.
B. Perozzi, R. Al-Rfou, and S. Skiena, “Deepwalk: Online learning of social representations,” in Proceedings of the 20th ACM SIGKDD international conference on Knowledge discovery and data mining , 2014, pp. 701–710
2014
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, pp. 1026–1034
2015
Earlier work this paper cites.
Y. Dong, N. V. Chawla, and A. Swami, “metapath2vec: Scalable representation learning for heterogeneous networks,” in Proceedings of the 23rd ACM SIGKDD international conference on knowledge discovery and data mining , 2017, pp. 135–144
2017
Earlier work this paper cites.
P. Veličković, W. Fedus, W. L. Hamilton, P. Liò, Y. Bengio, and R. D. Hjelm, “Deep graph infomax,” in International Conference on Learning Representations , 2018
2018
Earlier work this paper cites.
P. Veličković, G. Cucurull, A. Casanova, A. Romero, P. Liò, and Y. Bengio, “Graph attention networks,” in International Conference on Learning Representations , 2018
2018
Earlier work this paper cites.
H. Chen, H. Yin, W. Wang, H. Wang, Q. V. H. Nguyen, and X. Li, “Pme: projected metric embedding on heterogeneous networks for link prediction,” in Proceedings of the 24th ACM SIGKDD international conference on knowledge discovery & data mining , 2018, pp. 1177–1186
2018
Earlier work this paper cites.
H. Pei, B. Wei, K. C.-C. Chang, Y. Lei, and B. Yang, “Geom-gcn: Geometric graph convolutional networks,” in International Conference on Learning Representations , 2019
2019
Earlier work this paper cites.
C. Park, D. Kim, J. Han, and H. Yu, “Unsupervised attributed multiplex network embedding,” in Proceedings of the AAAI Conference on Artificial Intelligence , vol. 34, no. 04, 2020, pp. 5371–5378
2020
Earlier work this paper cites.
Y. You, T. Chen, Y. Sui, T. Chen, Z. Wang, and Y. Shen, “Graph contrastive learning with augmentations,” Advances in neural information processing systems , vol. 33, pp. 5812–5823, 2020
2020
Earlier work this paper cites.
J. Zhu, Y. Yan, L. Zhao, M. Heimann, L. Akoglu, and D. Koutra, “Beyond homophily in graph neural networks: Current limitations and effective designs,” Advances in neural information processing systems , vol. 33, pp. 7793–7804, 2020
2020
Earlier work this paper cites.
K. He, H. Fan, Y. Wu, S. Xie, and R. Girshick, “Momentum contrast for unsupervised visual representation learning,” in Proceedings of the IEEE/CVF conference on computer vision and pattern recognition , 2020, pp. 9729–9738
2020
Earlier work this paper cites.
J. Zhao, X. Wang, C. Shi, Z. Liu, and Y. Ye, “Network schema preserving heterogeneous information network embedding,” in International joint conference on artificial intelligence (IJCAI) , 2020
2020
Earlier work this paper cites.
X. Fu, J. Zhang, Z. Meng, and I. King, “Magnn: Metapath aggregated graph neural network for heterogeneous graph embedding,” in Proceedings of The Web Conference 2020 , 2020, pp. 2331–2341
2020
Earlier work this paper cites.
C. Shi, Y. Lu, L. Hu, Z. Liu, and H. Ma, “Rhine: Relation structure-aware heterogeneous information network embedding,” IEEE Transactions on Knowledge and Data Engineering , vol. 34, no. 1, pp. 433–447, 2020
2020
Earlier work this paper cites.
K. Wang, Z. Shen, C. Huang, C.-H. Wu, Y. Dong, and A. Kanakia, “Microsoft academic graph: When experts are not enough,” Quantitative Science Studies , vol. 1, no. 1, pp. 396–413, 2020
2020
Earlier work this paper cites.
W. Zhang, Y. Fang, Z. Liu, M. Wu, and X. Zhang, “mg2vec: Learning relationship-preserving heterogeneous graph representations via metagraph embedding,” IEEE Transactions on Knowledge and Data Engineering , vol. 34, no. 3, pp. 1317–1329, 2020
2020
Earlier work this paper cites.
P. H. Le-Khac, G. Healy, and A. F. Smeaton, “Contrastive representation learning: A framework and review,” IEEE Access , vol. 8, pp. 193 907–193 934, 2020
2020
Cited alongside, same era.
C. Li, H. Peng, J. Li, L. Sun, L. Lyu, L. Wang, S. Y. Philip, and L. He, “Joint stance and rumor detection in hierarchical heterogeneous graph,” IEEE Transactions on Neural Networks and Learning Systems , vol. 33, no. 6, pp. 2530–2542, 2021
2021
Cited alongside, same era.
E. Pan and Z. Kang, “Multi-view contrastive graph clustering,” Advances in neural information processing systems , vol. 34, pp. 2148–2159, 2021
2021
Cited alongside, same era.
Y. Xie, B. Yu, S. Lv, C. Zhang, G. Wang, and M. Gong, “A survey on heterogeneous network representation learning,” Pattern recognition , vol. 116, p. 107936, 2021
2021
Cited alongside, same era.
Y. Tian, K. Dong, C. Zhang, C. Zhang, and N. V. Chawla, “Heterogeneous graph masked autoencoders,” in Proceedings of the AAAI Conference on Artificial Intelligence , vol. 37, no. 8, 2023, pp. 9997–10 005
2023
Later among the works it cites.
J. Chen and G. Kou, “Attribute and structure preserving graph contrastive learning,” in Proceedings of the AAAI Conference on Artificial Intelligence , vol. 37, no. 6, 2023, pp. 7024–7032
2023
Later among the works it cites.
E. Pan and Z. Kang, “Beyond homophily: Reconstructing structure for graph-agnostic clustering,” in Proceedings of the 40th International Conference on Machine Learning . PMLR, 2023, pp. 26 868–26 877
2023
Later among the works it cites.
J. Chen, R. Lei, and Z. Wei, “Polygcl: Graph contrastive learning via learnable spectral polynomial filters,” in The Twelfth International Conference on Learning Representations , 2023
2023
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
X. Wang, N. Liu, H. Han, and C. Shi, “Self-supervised heterogeneous graph neural network with co-contrastive learning,” in Proceedings of the 27th ACM SIGKDD conference on knowledge discovery & data mining , 2021, pp. 1726–1736
2021
Cited alongside, same era.
Y. Ma, X. Liu, N. Shah, and J. Tang, “Is homophily a necessity for graph neural networks?” in International Conference on Learning Representations , 2021
2021
Cited alongside, same era.
N. Hoang, T. Maehara, and T. Murata, “Revisiting graph neural networks: Graph filtering perspective,” in 2020 25th International Conference on Pattern Recognition (ICPR) . IEEE, 2021, pp. 8376–8383
2021
Cited alongside, same era.
D. Bo, X. Wang, C. Shi, and H. Shen, “Beyond low-frequency information in graph convolutional networks,” in Proceedings of the AAAI Conference on Artificial Intelligence , vol. 35, no. 5, 2021, pp. 3950–3957
2021
Cited alongside, same era.
C. Mavromatis and G. Karypis, “Graph infoclust: Maximizing coarse-grain mutual information in graphs,” in Pacific-Asia Conference on Knowledge Discovery and Data Mining . Springer, 2021, pp. 541–553
2021
Cited alongside, same era.
Y. Liu, M. Jin, S. Pan, C. Zhou, Y. Zheng, F. Xia, and S. Y. Philip, “Graph self-supervised learning: A survey,” IEEE Transactions on Knowledge and Data Engineering , vol. 35, no. 6, pp. 5879–5900, 2022
2022
Cited alongside, same era.
S. Luan, M. Zhao, C. Hua, X.-W. Chang, and D. Precup, “Complete the missing half: Augmenting aggregation filtering with diversification for graph convolutional networks,” in NeurIPS 2022 Workshop: New Frontiers in Graph Learning , 2022
2022
Cited alongside, same era.
S. Luan, C. Hua, Q. Lu, J. Zhu, M. Zhao, S. Zhang, X.-W. Chang, and D. Precup, “Revisiting heterophily for graph neural networks,” Advances in neural information processing systems , vol. 35, pp. 1362–1375, 2022
2022
Cited alongside, same era.
Y. Liu, Y. Zheng, D. Zhang, V. C. Lee, and S. Pan, “Beyond smoothing: Unsupervised graph representation learning with edge heterophily discriminating,” in Proceedings of the AAAI conference on artificial intelligence , vol. 37, no. 4, 2023, pp. 4516–4524
2023
Later among the works it cites.
Y. Ling, J. Chen, Y. Ren, X. Pu, J. Xu, X. Zhu, and L. He, “Dual label-guided graph refinement for multi-view graph clustering,” in Proceedings of the AAAI Conference on Artificial Intelligence , vol. 37, no. 7, 2023, pp. 8791–8798
2023
Later among the works it cites.
Z. Wang, Q. Li, D. Yu, X. Han, X.-Z. Gao, and S. Shen, “Heterogeneous graph contrastive multi-view learning,” in Proceedings of the 2023 SIAM International Conference on Data Mining (SDM) . SIAM, 2023, pp. 136–144
2023
Later among the works it cites.
M. Yuan, M. Chen, and X. Li, “Muse: Multi-view contrastive learning for heterophilic graphs via information reconstruction,” in Proceedings of the 32nd ACM International Conference on Information and Knowledge Management , 2023, pp. 3094–3103
2023
Later among the works it cites.
J. Guo, L. Du, W. Bi, Q. Fu, X. Ma, X. Chen, S. Han, D. Zhang, and Y. Zhang, “Homophily-oriented heterogeneous graph rewiring,” in Proceedings of the ACM Web Conference 2023 , 2023, pp. 511–522
2023
Later among the works it cites.
2023
Later among the works it cites.
Z. Shen, H. He, and Z. Kang, “Balanced multi-relational graph clustering,” in ACM Multimedia , 2024
2024
Closest in time.
X. Qian, B. Li, and Z. Kang, “Upper bounding barlow twins: A novel filter for multi-relational clustering,” in Proceedings of the AAAI Conference on Artificial Intelligence , vol. 38, no. 13, 2024, pp. 14 660–14 668
2024
Closest in time.
2024
Closest in time.
2024
Closest in time.
X. Wang, H. Ji, C. Shi, B. Wang, Y. Ye, P. Cui, and P. S. Yu, “Heterogeneous graph attention network,” in The world wide web conference , 2019, pp. 2022–2032
2032
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 , 2021, pp. 2069–2080
2080
Closest in time.