Multi-view Self-supervised Heterogeneous Graph Embedding

• Published in: Machine Learning and Knowledge Discovery in Databases. Research Track Vol. 12976; pp. 319 - 334
• Main Authors: Zhao, Jianan, Wen, Qianlong, Sun, Shiyu, Ye, Yanfang, Zhang, Chuxu
• Format: Book Chapter
• Language: English
• Published: Switzerland Springer International Publishing AG 2021; Springer International Publishing
• Series: Lecture Notes in Computer Science
• Subjects: Graph neural network; Heterogeneous graph embedding; Self-supervised learning
• ISBN: 3030865193; 9783030865191
• ISSN: 0302-9743; 1611-3349
• DOI: 10.1007/978-3-030-86520-7_20

Graph mining tasks often suffer from the lack of supervision from labeled information due to the intrinsic sparseness of graphs and the high cost of manual annotation. To alleviate this issue, inspired by recent advances of self-supervised learning (SSL) on computer vision and natural language processing, graph self-supervised learning methods have been proposed and achieved remarkable performance by utilizing unlabeled information. However, most existing graph SSL methods focus on homogeneous graphs, ignoring the ubiquitous heterogeneity of real-world graphs where nodes and edges are of multiple types. Therefore, directly applying existing graph SSL methods to heterogeneous graphs can not fully capture the rich semantics and their correlations in heterogeneous graphs. In light of this, we investigate self-supervised learning on heterogeneous graphs and propose a novel model named Multi-View Self-supervised heterogeneous graph Embedding (MVSE). By encoding information from different views defined by meta-paths and optimizing both intra-view and inter-view contrastive learning tasks, MVSE comprehensively utilizes unlabeled information and learns node embeddings. Extensive experiments are conducted on various tasks to show the effectiveness of the proposed framework.