NCDREC: A Decomposability Inspired Framework for Top-N Recommendation

Building on the intuition behind Nearly Decomposable systems, we propose NCDREC, a top-N recommendation framework designed to exploit the innately hierarchical structure of the item space to alleviate Sparsity, and the limitations it imposes to the quality of recommendations. We decompose the item space to define blocks of closely related elements and we introduce corresponding indirect proximity components that try to fill in the gap left by the inherent sparsity of the data. We study the theoretical properties of the decomposition and we derive sufficient conditions that guarantee full item space coverage even in cold-start recommendation scenarios. A comprehensive set of experiments on the Movie Lens and the Yahoo!R2Music datasets, using several widely applied performance metrics, support our model's theoretically predicted properties and verify that NCDREC outperforms several state-of-the-art algorithms, in terms of recommendation accuracy, diversity and sparseness insensitivity.

[1]  Hui Xiong,et al.  Enhancing Collaborative Filtering by User Interest Expansion via Personalized Ranking , 2012, IEEE Transactions on Systems, Man, and Cybernetics, Part B (Cybernetics).

[2]  François Fouss,et al.  An experimental investigation of kernels on graphs for collaborative recommendation and semisupervised classification , 2012, Neural Networks.

[3]  Gene H. Golub,et al.  Exploiting the Block Structure of the Web for Computing , 2003 .

[4]  John D. Garofalakis,et al.  A Novel Hierarchical Approach to Ranking-Based Collaborative Filtering , 2013, EANN.

[5]  Marco Gori,et al.  ItemRank: A Random-Walk Based Scoring Algorithm for Recommender Engines , 2007, IJCAI.

[6]  J. Bobadilla,et al.  Recommender systems survey , 2013, Knowl. Based Syst..

[7]  Richard S. Zemel,et al.  Collaborative prediction and ranking with non-random missing data , 2009, RecSys '09.

[8]  Marco Gori,et al.  Scalable pseudo-likelihood estimation in hybrid random fields , 2009, KDD.

[9]  George Karypis,et al.  A Comprehensive Survey of Neighborhood-based Recommendation Methods , 2011, Recommender Systems Handbook.

[10]  Herbert A. Simon,et al.  Aggregation of Variables in Dynamic Systems , 1961 .

[11]  Qing Zhang,et al.  Continuous-Time Markov Chains and Applications: A Two-Time-Scale Approach , 2012 .

[12]  Roberto Turrin,et al.  Performance of recommender algorithms on top-n recommendation tasks , 2010, RecSys '10.

[13]  Priscilla S. Markwood,et al.  The Long Tail: Why the Future of Business is Selling Less of More , 2006 .

[14]  Guy Shani,et al.  Evaluating Recommendation Systems , 2011, Recommender Systems Handbook.

[15]  Ali Esmaili,et al.  Probability and Random Processes , 2005, Technometrics.

[16]  Junjie Yao,et al.  Challenging the Long Tail Recommendation , 2012, Proc. VLDB Endow..

[17]  Shaina Race,et al.  Determining the Number of Clusters via Iterative Consensus Clustering , 2014, SDM.

[18]  H. Simon,et al.  The sciences of the artificial (3rd ed.) , 1996 .

[19]  Yehuda Koren,et al.  Advances in Collaborative Filtering , 2011, Recommender Systems Handbook.

[20]  Mukkai S. Krishnamoorthy,et al.  A random walk method for alleviating the sparsity problem in collaborative filtering , 2008, RecSys '08.

[21]  P.-J. Courtois,et al.  Decomposability: Queueing and Computer System Applications , 2014 .

[22]  Carl Dean Meyer,et al.  Stochastic Data Clustering , 2010, SIAM J. Matrix Anal. Appl..

[23]  Pavel Yu. Chebotarev,et al.  The Matrix-Forest Theorem and Measuring Relations in Small Social Groups , 2006, ArXiv.

[24]  John D. Garofalakis,et al.  NCDawareRank: a novel ranking method that exploits the decomposable structure of the web , 2013, WSDM.

[25]  Kai Zhang,et al.  A topical PageRank based algorithm for recommender systems , 2008, SIGIR '08.

[26]  François Fouss,et al.  Random-Walk Computation of Similarities between Nodes of a Graph with Application to Collaborative Recommendation , 2007, IEEE Transactions on Knowledge and Data Engineering.

[27]  Herbert A. Simon,et al.  The Sciences of the Artificial , 1970 .

[28]  Lothar Reichel,et al.  Augmented Implicitly Restarted Lanczos Bidiagonalization Methods , 2005, SIAM J. Sci. Comput..

[29]  Berkant Barla Cambazoglu,et al.  Site-Based Partitioning and Repartitioning Techniques for Parallel PageRank Computation , 2011, IEEE Transactions on Parallel and Distributed Systems.

[30]  Suhrid Balakrishnan,et al.  Collaborative ranking , 2012, WSDM '12.

[31]  Leo Katz,et al.  A new status index derived from sociometric analysis , 1953 .