Heterogeneous graph is a kind of data structure widely existing in real life. Nowadays, the research of graph neural network on heterogeneous graph has become more and more popular. The existing heterogeneous graph neural network algorithms mainly have two ideas, one is based on meta-path and the other is not. The idea based on meta-path often requires a lot of manual preprocessing, at the same time it is difficult to extend to large scale graphs. In this paper, we proposed the general heterogeneous message passing paradigm and designed R-GSN that does not need meta-path, which is much improved compared to the baseline R-GCN. Experiments have shown that our R-GSN algorithm achieves the state-of-the-art performance on the ogbn-mag large scale heterogeneous graph dataset.
Scalable Heterogeneous Graph Learning via Heterogeneous-aware Orthogonal Prototype Experts
National Engineering Research Center for Big Data Technology;System Lab, Cluster;Grid Computing Lab, School of Computer Science;Technology, Huazhong University of Science;DIRO, Université de Montréal \& Mila \& Canada CIFAR AI Chair, Canada
Tensor SimRank for Heterogeneous Information Networks
Skolkovo Institute of Science and Technology(斯科尔科沃科学技术研究所);Moscow Institute of Physics and Technology(莫斯科物理技术学院);Institute of Numerical Mathematics, Russian Academy of Sciences(俄罗斯科学院数值数学研究所)
Institute of Information Engineering, Chinese Academy of Sciences(中国科学院信息工程研究所);School of Cyber Security, University of Chinese Academy of Sciences(中国科学院大学网络空间安全学院);University of Electronic Science and Technology of China(电子科技大学);Institute of Automation, Chinese Academy of Sciences(中国科学院自动化研究所)
Streaming Social Event Detection and Evolution Discovery in Heterogeneous Information Networks
Beihang University(北京航空航天大学);Hong Kong University of Science and Technology(香港科技大学);University of Leeds(利兹大学);Newcastle University(纽卡斯尔大学);University of Illinois at Chicago(伊利诺伊大学芝加哥分校);Lehigh University(理海大学)