Fusing Diversity in Recommendations in Heterogeneous Information Networks

In the past, hybrid recommender systems have shown the power of exploiting relationships amongst objects which directly or indirectly effect the recommendation task. However, the effect of all relations is not equal, and choosing their right balance for a recommendation problem at hand is non-trivial. We model these interactions using a Heterogeneous Information Network, and propose a systematic framework for learning their influence weights for a given recommendation task. Further, we address the issue of redundant results, which is very much prevalent in recommender systems. To alleviate redundancy in recommendations we use Vertex Reinforced Random Walk (a non-Markovian random walk) over a heterogeneous graph. It works by boosting the transitions to the influential nodes, while simultaneously shrinking the weights of others. This helps in discouraging recommendation of multiple influential nodes which lie in close proximity of each other, thus ensuring diversity. Finally, we demonstrate the effectiveness of our approach by experimenting on real world datasets. We find that, with the weights of relations learned using the proposed non-Markovian random walk based framework, the results consistently improve over the baselines.

[1]  John D. Lafferty,et al.  Beyond independent relevance: methods and evaluation metrics for subtopic retrieval , 2003, SIGIR.

[2]  Dragomir R. Radev,et al.  DivRank: the interplay of prestige and diversity in information networks , 2010, KDD.

[3]  Mi Zhang,et al.  Avoiding monotony: improving the diversity of recommendation lists , 2008, RecSys '08.

[4]  Gao Cong,et al.  A general graph-based model for recommendation in event-based social networks , 2015, 2015 IEEE 31st International Conference on Data Engineering.

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

[6]  Gerard Salton,et al.  Research and Development in Information Retrieval , 1982, Lecture Notes in Computer Science.

[7]  Jon M Kleinberg,et al.  Hubs, authorities, and communities , 1999, CSUR.

[8]  Yihong Gong,et al.  Combining content and link for classification using matrix factorization , 2007, SIGIR.

[9]  M. Narasimha Murty,et al.  Structural Neighborhood Based Classification of Nodes in a Network , 2016, KDD.

[10]  Xiaojin Zhu,et al.  Improving Diversity in Ranking using Absorbing Random Walks , 2007, NAACL.

[11]  Yizhou Sun,et al.  Mining Heterogeneous Information Networks: Principles and Methodologies , 2012, Mining Heterogeneous Information Networks: Principles and Methodologies.

[12]  Filip Radlinski,et al.  Redundancy, diversity and interdependent document relevance , 2009, SIGF.

[13]  M. Narasimha Murty,et al.  Overlap-Robust Decision Boundary Learning for Within-Network Classification , 2018, AAAI.

[14]  Stanislav Volkov,et al.  Phase Transition in Vertex-Reinforced Random Walks on $${\mathbb{Z}}$$ with Non-linear Reinforcement , 2006 .

[15]  Charu C. Aggarwal,et al.  Co-author Relationship Prediction in Heterogeneous Bibliographic Networks , 2011, 2011 International Conference on Advances in Social Networks Analysis and Mining.

[16]  Jade Goldstein-Stewart,et al.  The use of MMR, diversity-based reranking for reordering documents and producing summaries , 1998, SIGIR '98.

[17]  Jeffrey Xu Yu,et al.  Scalable Diversified Ranking on Large Graphs , 2011, IEEE Transactions on Knowledge and Data Engineering.

[18]  R. Pemantle Vertex-reinforced random walk , 1992, math/0404041.

[19]  Yizhou Sun,et al.  Personalized entity recommendation: a heterogeneous information network approach , 2014, WSDM.

[20]  Jeffrey Xu Yu,et al.  Scalable Diversified Ranking on Large Graphs , 2013, IEEE Trans. Knowl. Data Eng..

[21]  Tak Kuen Siu,et al.  Markov Chains: Models, Algorithms and Applications , 2006 .

[22]  Evaggelia Pitoura,et al.  Search result diversification , 2010, SGMD.

[23]  Wei-Ying Ma,et al.  Object-level ranking: bringing order to Web objects , 2005, WWW '05.

[24]  S. Volkov Vertex-reinforced random walk on arbitrary graphs , 1999, math/9907196.

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

[26]  Chiranjib Bhattacharyya,et al.  Diversity in ranking via resistive graph centers , 2011, KDD.

[27]  Anne-Marie Kermarrec,et al.  Heterogeneous Recommendations: What You Might Like To Read After Watching Interstellar , 2017, Proc. VLDB Endow..

[28]  Jingrui He,et al.  Diversified ranking on large graphs: an optimization viewpoint , 2011, KDD.

[29]  Stanislav Volkov,et al.  Phase transition in vertex-reinforced random walks on Z with non-linear reinforcement , 2006 .

[30]  Daniel S. Himmelstein,et al.  Heterogeneous Network Edge Prediction: A Data Integration Approach to Prioritize Disease-Associated Genes , 2014, bioRxiv.

[31]  Jade Goldstein-Stewart,et al.  The Use of MMR, Diversity-Based Reranking for Reordering Documents and Producing Summaries , 1998, SIGIR Forum.

[32]  Taher H. Haveliwala Topic-sensitive PageRank , 2002, IEEE Trans. Knowl. Data Eng..

[33]  Rajeev Motwani,et al.  The PageRank Citation Ranking : Bringing Order to the Web , 1999, WWW 1999.