GSim: A Graph Neural Network Based Relevance Measure for Heterogeneous Graphs

• Main Authors: Cao, X. (Author), Fang, Y. (Author), Lu, M. (Author), Luo, L. (Author), Zhang, W. (Author), Zhang, X. (Author)
• Format: Article
• Language: English
• Published: IEEE Computer Society 2023
• Subjects: Aggregates; Context path; graph neural network; Graph neural networks; heterogeneous graphs; relevance measure; Representation learning; Semantics; Task analysis; Time measurement; Web search
• Online Access: View Fulltext in Publisher; View in Scopus

 Heterogeneous graphs, which contain nodes and edges of multiple types, are prevalent in various domains, including bibliographic networks, social media, and knowledge graphs. As a fundamental task in analyzing heterogeneous graphs, relevance measure aims to calculate the relevance between two objects of different types, which has been used in many applications such as web search, recommendation, and community detection. Most of existing relevance measures focus on homogeneous networks where objects are of the same type, and a few measures are developed for heterogeneous graphs, but they often need the pre-defined meta-path. Defining meaningful meta-paths requires much domain knowledge, which largely limits their applications, especially on schema-rich heterogeneous graphs like knowledge graphs. Recently, the Graph Neural Network (GNN) has been widely applied in many graph mining tasks, but it has not been applied for measuring relevance yet. To address the aforementioned problems, we propose a novel GNN-based relevance measure, namely GSim. Specifically, we first theoretically analyze and show that GNN is effective for measuring the relevance of nodes in the graph. We then propose a context path-based graph neural network (CP-GNN) to automatically leverage the semantics in heterogeneous graphs. Moreover, we exploit CP-GNN to support relevance measures between two objects of any type. Extensive experiments demonstrate that GSim outperforms existing measures. IEEE