TSS: Temporal similarity search measure for heterogeneous information networks

Abstract Many real-world phenomena can be modeled as networked systems. Some of these systems consist of heterogeneous nodes and edges. Similarity search is a fundamental operation in network systems, which is a basis for various applications such as link prediction and recommendation. This manuscript introduces a temporal similarity measure for heterogeneous networks. The proposed metric is based on metapath strategy and considers time of the interaction. We provide detailed properties of the proposed temporal similarity measures. Our experimental results on a number of real heterogeneous social networks show that incorporating time in the computation of the similarity significantly improves the performance as compared to the state-of-the-art similarity computation methods.

[1]  Matteo Magnani,et al.  Shortest Paths in Multiplex Networks , 2017, Scientific Reports.

[2]  Bin Wu,et al.  Relevance Measure in Large-Scale Heterogeneous Networks , 2014, APWeb.

[3]  Ee-Peng Lim,et al.  On ranking controversies in wikipedia: models and evaluation , 2008, WSDM '08.

[4]  Jonathan Tedesco AsymSim: meta path-based similarity with asymmetric relations , 2013 .

[5]  Mahdi Jalili,et al.  Accurate and Novel Recommendations , 2014 .

[6]  Philip S. Yu,et al.  Top-k Similarity Join in Heterogeneous Information Networks , 2015, IEEE Transactions on Knowledge and Data Engineering.

[7]  James Bailey,et al.  Exploiting Transitive Similarity and Temporal Dynamics for Similarity Search in Heterogeneous Information Networks , 2014, DASFAA.

[8]  Sunil Arya,et al.  An optimal algorithm for approximate nearest neighbor searching fixed dimensions , 1998, JACM.

[9]  Wei Wang,et al.  Top-k similarity search in heterogeneous information networks with x-star network schema , 2015, Expert Syst. Appl..

[10]  Jennifer Widom,et al.  SimRank: a measure of structural-context similarity , 2002, KDD.

[11]  Matteo Magnani,et al.  Diffusion of innovations over multiplex social networks , 2014, 2015 The International Symposium on Artificial Intelligence and Signal Processing (AISP).

[12]  Christoph Hermann,et al.  Time-Based Recommendations for Lecture Materials , 2010 .

[13]  Min Zhao,et al.  Online evolutionary collaborative filtering , 2010, RecSys '10.

[14]  Jaana Kekäläinen,et al.  Cumulated gain-based evaluation of IR techniques , 2002, TOIS.

[15]  Mahdi Jalili,et al.  Link prediction in multiplex online social networks , 2017, Royal Society Open Science.

[16]  Jennifer Widom,et al.  Scaling personalized web search , 2003, WWW '03.

[17]  John R. Gilbert,et al.  On the representation and multiplication of hypersparse matrices , 2008, 2008 IEEE International Symposium on Parallel and Distributed Processing.

[18]  Tsvi Kuflik,et al.  Workshop on information heterogeneity and fusion in recommender systems (HetRec 2010) , 2010, RecSys '10.

[19]  Mahdi Jalili,et al.  Information Spread and Topic Diffusion in Heterogeneous Information Networks , 2018, Scientific Reports.

[20]  Yizhou Sun,et al.  Mining heterogeneous information networks: a structural analysis approach , 2013, SKDD.

[21]  Philip S. Yu,et al.  HeteSim: A General Framework for Relevance Measure in Heterogeneous Networks , 2013, IEEE Transactions on Knowledge and Data Engineering.

[22]  H. Stanley,et al.  Effect of the interconnected network structure on the epidemic threshold. , 2013, Physical review. E, Statistical, nonlinear, and soft matter physics.

[23]  Philip S. Yu,et al.  PathSim , 2011, Proc. VLDB Endow..

[24]  U LeongHou,et al.  PathSimExt: Revisiting PathSim in Heterogeneous Information Networks , 2014, WAIM.

[25]  Matteo Magnani,et al.  Spreading Processes in Multilayer Networks , 2014, IEEE Transactions on Network Science and Engineering.