Skip to Main content Skip to Navigation
Conference papers

Discovering Meta-Paths in Large Heterogeneous Information Networks

Abstract : The Heterogeneous Information Network (HIN) is a graph data model in which nodes and edges are annotated with class and relationship labels. Large and complex datasets, such as Yago or DBLP, can be modeled as HINs. Recent work has studied how to make use of these rich information sources. In particular, meta-paths, which represent sequences of node classes and edge types between two nodes in a HIN, have been proposed for such tasks as information retrieval, decision making, and product recommendation. Current methods assume meta-paths are found by domain experts. However, in a large and complex HIN, retrieving meta-paths manually can be tedious and difficult. We thus study how to discover meta-paths automatically. Specifically, users are asked to provide example pairs of nodes that exhibit high proximity. We then investigate how to generate meta-paths that can best explain the relationship between these node pairs. Since this problem is computationally intractable, we propose a greedy algorithm to select the most relevant meta-paths. We also present a data structure to enable efficient execution of this algorithm. We further incorporate hierarchical relationships among node classes in our solutions. Extensive experiments on real-world HIN show that our approach captures important meta-paths in an efficient and scalable manner.
Document type :
Conference papers
Complete list of metadata
Contributor : Admin Télécom Paristech Connect in order to contact the contributor
Submitted on : Monday, July 20, 2015 - 3:29:47 AM
Last modification on : Tuesday, September 21, 2021 - 2:16:03 PM


  • HAL Id : hal-01178401, version 1



Changping Meng, Reynold Cheng, Silviu Maniu, Pierre Senellart, Wangda Zhang. Discovering Meta-Paths in Large Heterogeneous Information Networks. WWW, May 2015, Florence, Italy. ⟨hal-01178401⟩



Record views