%0 Journal Article %1 sun2011pathsim %A Sun, Yizhou %A Han, Jiawei %A Yan, Xifeng %A Yu, Philip S. %A Wu, Tianyi %D 2011 %J VLDB %K graph heterogeneous hin information meta network pagerank path similarity sota %N 11 %P 992--1003 %T PathSim: Meta Path-Based Top-K Similarity Search in Heterogeneous Information Networks %U http://www.vldb.org/pvldb/vol4/p992-sun.pdf %V 4 %X Similarity search is a primitive operation in database and Web search engines. With the advent of large-scale heterogeneous information networks that consist of multi-typed, interconnected objects, such as the bibliographic networks and social media networks, it is important to study similarity search in such networks. Intuitively, two objects are similar if they are linked by many paths in the network. However, most existing similarity measures are defined for homogeneous networks. Different semantic meanings behind paths are not taken into consideration. Thus they cannot be directly applied to heterogeneous networks. In this paper, we study similarity search that is defined among the same type of objects in heterogeneous networks. Moreover, by considering different linkage paths in a network, one could derive various similarity semantics. Therefore, we introduce the concept of meta path-based similarity, where a meta path is a path consisting of a sequence of relations defined between different object types (i.e., structural paths at the meta level). No matter whether a user would like to explicitly specify a path combination given sufficient domain knowledge, or choose the best path by experimental trials, or simply provide training examples to learn it, meta path forms a common base for a network-based similarity search engine. In particular, under the meta path framework we define a novel similarity measure called PathSim that is able to find peer objects in the network (e.g., find authors in the similar field and with similar reputation), which turns out to be more meaningful in many scenarios compared with random-walk based similarity measures. In order to support fast online query processing for PathSim queries, we develop an efficient solution that partially materializes short meta paths and then concatenates them online to compute top-k results. Experiments on real data sets demonstrate the effectiveness and efficiency of our proposed paradigm.

@article{sun2011pathsim, abstract = {Similarity search is a primitive operation in database and Web search engines. With the advent of large-scale heterogeneous information networks that consist of multi-typed, interconnected objects, such as the bibliographic networks and social media networks, it is important to study similarity search in such networks. Intuitively, two objects are similar if they are linked by many paths in the network. However, most existing similarity measures are defined for homogeneous networks. Different semantic meanings behind paths are not taken into consideration. Thus they cannot be directly applied to heterogeneous networks. In this paper, we study similarity search that is defined among the same type of objects in heterogeneous networks. Moreover, by considering different linkage paths in a network, one could derive various similarity semantics. Therefore, we introduce the concept of meta path-based similarity, where a meta path is a path consisting of a sequence of relations defined between different object types (i.e., structural paths at the meta level). No matter whether a user would like to explicitly specify a path combination given sufficient domain knowledge, or choose the best path by experimental trials, or simply provide training examples to learn it, meta path forms a common base for a network-based similarity search engine. In particular, under the meta path framework we define a novel similarity measure called PathSim that is able to find peer objects in the network (e.g., find authors in the similar field and with similar reputation), which turns out to be more meaningful in many scenarios compared with random-walk based similarity measures. In order to support fast online query processing for PathSim queries, we develop an efficient solution that partially materializes short meta paths and then concatenates them online to compute top-k results. Experiments on real data sets demonstrate the effectiveness and efficiency of our proposed paradigm.}, added-at = {2014-05-15T11:56:59.000+0200}, author = {Sun, Yizhou and Han, Jiawei and Yan, Xifeng and Yu, Philip S. and Wu, Tianyi}, biburl = {https://www.bibsonomy.org/bibtex/29f758700a98c3502a8fdfed509e121d1/jaeschke}, interhash = {ebd8d4de7b9617b4b85af4c9a4c9aad0}, intrahash = {9f758700a98c3502a8fdfed509e121d1}, journal = {VLDB}, keywords = {graph heterogeneous hin information meta network pagerank path similarity sota}, number = 11, pages = {992--1003}, timestamp = {2014-07-28T15:57:31.000+0200}, title = {PathSim: Meta Path-Based Top-K Similarity Search in Heterogeneous Information Networks }, url = {http://www.vldb.org/pvldb/vol4/p992-sun.pdf}, volume = 4, year = 2011 }