OmniRank: learning to recommend based on omni-traversal of heterogeneous graphs

Social Network Analysis and Mining - Tập 9 - Trang 1-13 - 2019
Panagiotis Symeonidis1, Stergios Chairistanidis1
1Free University of Bolzano, Bolzano, Italy

Tóm tắt

In this paper, we propose a new node similarity measure, OmniRank, for multi-dimensional and heterogeneous social networks. In particular, we recursively propagate the structural similarity computation beyond the neighborhood of the nodes to the entire heterogeneous (e.g., user, item, tag) graph, which incorporates several unipartite and bipartite graphs. We have evaluated experimentally OmniRank and compared it against other state-of-the-art algorithms (wRWR, SimRank and P-Rank) on two real-life data sets (HetRec 2011 and GeoSocialRec). Our experiments have shown that OmniRank outperforms its comparison partners in terms of effectiveness and recommendation accuracy, because it exploits information on both multi-step and omni-directional neighborhoods (unipartite and bipartite).

Tài liệu tham khảo

Antonellis I, Garcia-Molina H, Chang CC (2008) Simrank++: Query rewriting through link analysis of the click graph. In: Proceedings of VLDB, pp 408–421 Bogers T (2010) Movie recommendation using random walks over the contextual graph. In: Proceedings of the 2nd international workshop on context-aware recommender systems Jamali M, Ester M (2009) Trustwalker: a random walk model for combining trust-based and item-based recommendation. In: Proceedings 15th ACM SIGKDD international conference on knowledge discovery & data mining (KDD), pp 397–406 Jeh G, Widom J (2002) Simrank: a measure of structural-context similarity. In: Proceedings of the ACM SIGKDD international conference on knowledge discovery and data mining, pp 271–279 Jiang M, Cui P, Wang F, Yang Q, Zhu W, Yang S (2012) Social recommendation across multiple relational domains. In: Proceedings 21st ACM international conference on information and knowledge management (CIKM), pp 1422–1431 Jin Z, Shi D, Wu Q, Yan H, Fan H (2012) Lbsnrank: personalized pagerank on location-based social networks. In: Proceedings ACM conference on ubiquitous computing (UbiComp), pp 980–987 Kessler MM (1963) Bibliographic coupling extended in time: ten case histories. Inf Storage Retr 1(4):169–187 Kusumoto M, Maehara T, Kawarabayashi K (2014) Scalable similarity search for simrank. In: Proceedings of the 2014 ACM SIGMOD international conference on management of data, pp 325–336. ACM Lee S, Park S, Kahng M, Lee SG (2013) Pathrank: ranking nodes on a heterogeneous graph for flexible hybrid recommender systems. Expert Syst Appl 40(2):684–697 Lian D, Xie X, Zheng VW, Yuan NJ, Zhang F, Chen E (2015) Cepr: a collaborative exploration and periodically returning model for location prediction. ACM Trans Intell Syst Technol 6(1):8:1–8:27 Li C, Han J, He G, Jin X, Sun Y, Yu Y, Wu T (2010) Fast computation of simrank for static and dynamic information networks. In: Proceedings of the international conference on extending database technology (EDBT 2010), pp 465–476 Lin Z, Lyu MR, King I (2009) Matchsim: a novel neighbor-based similarity measure with maximum neighborhood matching. In: Proceedings of the 18th ACM conference on information and knowledge management, pp 1613–1616. ACM Lizorkin D, Velikhov P, Grinev M, Turdakov D (2008) Accuracy estimate and optimization techniques for simrank computation. Proc VLDB Endow 1(1):422–433 Noulas A, Scellato S, Lathia N, Mascolo C (2012) A random walk around the city: new venue recommendation in location-based social networks. In: Proceedings international conference on privacy, security, risk trust (PASSAT), and international conference on social computing (SocialCom), pp 144–153 Pan J, Yang H, Faloutsos C, Duygulu P (2004) Automatic multimedia cross-modal correlation discovery. In: Proceedings of the 10th ACM SIGKDD international conference on knowledge discovery and data mining (KDD), pp 653–658 Sarwar B, Karypis G, Konstan J, Riedl J (2001) Item-based collaborative filtering recommendation algorithms. In: Proceedings of the 10th international conference on World Wide Web, pp 285–295 Sattari M, Toroslu IH, Karagoz P, Symeonidis P, Manolopoulos Y (2015) Extended feature combination model for recommendations in location-based mobile services. Knowl Inf Syst 44(3):629–661 Shi C, Kong X, Huang Y, Philip SY, Wu B (2014) Hetesim: a general framework for relevance measure in heterogeneous networks. IEEE Trans Knowl Data Eng 26(10):2479–2492 Shi C, Zhang Z, Luo P, Yu PS, Yue Y, Wu B (2015) Semantic path based personalized recommendation on weighted heterogeneous information networks. In: Proceedings of the 24th ACM international on conference on information and knowledge management, pp 453–462. ACM Small H (1973) Co-citation in the scientific literature: a new measure of the relationship between two documents. J Am Soc Inf Sci 24(4):265–269 Sun Y, Han J, Yan X, Yu PS, Wu T (2011) Pathsim: meta path-based top-k similarity search in heterogeneous information networks. Proc VLDB Endow 4(11):992–1003 Tao W, Yu M, Li G (2014) Efficient top-k simrank-based similarity join. Proc VLDB Endow 8(3):317–328 Tong H, Faloutsos C, Pan J (2006) Fast random walk with restart and its applications. In: Proceedings of the 6th international conference on data mining (ICDM), pp 613–622 Usman B, Oseledets I (2015) Tensor simrank for heterogeneous information networks. arXiv preprint arXiv:1502.06818 Wang H, Terrovitis M, Mamoulis N (2013) Location recommendation in location-based social networks using user check-in data. In: Proceedings ACM conference on international conference on advances in geographic information systems (SIGSPATIAL), pp 364–373 Ying J, Lu H, Tseng V (2012) Followee recommendation in asymmetrical location-based social networks. In: Proceedings ACM conference on ubiquitous computing (UbiComp), pp 988–995 Yin Z, Gupta M, Weninger T, J, H (2010) A unified framework for link recommendation using random walks. In: Proceedings international conference on advances in social network analysis & mining (ASONAM), pp 152–159 Yu W, McCann J (2015) Efficient partial-pairs simrank search on large networks. Proc VLDB Endow 8(5):569–580 Yu W, Lin X, Zhang W (2013) Towards efficient simrank computation on large networks. In: 2013 IEEE 29th international conference on data engineering (ICDE), pp 601–612. IEEE Zhao P, Han J, Sun Y (2009) P-rank: a comprehensive structural similarity measure over information networks. In Proceeding of the 18th ACM conference on information and knowledge management, pp 553 – 562