Disjunctive Boolean Kernels for Collaborative Filtering in Top-N Recommendation

In many personalized recommendation problems available data consists only of positive interactions (implicit feedback) between users and items. This problem is also known as One-Class Collaborative Filtering (OC-CF). Linear models usually achieves state-of-the-art performances on OC-CF problems and many efforts have been devoted to build more expressive and complex representations able to improve the recommendations but with no much success. Recent analysis shows that collaborative filtering (CF) datasets have peculiar characteristics such as high sparsity and a long tailed distribution of the ratings. In this paper we propose a boolean kernel, called Disjunctive Kernel, which is less expressive than the linear one but it is able to alleviate the sparsity issue in CF contexts. The embedding of this kernel is composed by all the combinations of a certain degree $d$ of the input variables, and these combined features are semantically interpreted as disjunctions of the input variables. Experiments on several CF datasets show the effectiveness and the efficiency of the proposed kernel.

[1]  Pierre Baldi,et al.  Graph kernels for chemical informatics , 2005, Neural Networks.

[2]  Yang Zhang,et al.  DRC-BK: Mining Classification Rules by Using Boolean Kernels , 2005, ICCSA.

[3]  Fabio Aiolli Convex AUC optimization for top-N recommendation with implicit feedback , 2014, RecSys '14.

[4]  Tiejian Luo,et al.  A novel approach to solve the sparsity problem in collaborative filtering , 2010, 2010 International Conference on Networking, Sensing and Control (ICNSC).

[5]  Mirko Polato,et al.  Kernel based collaborative filtering for very large scale top-N item recommendation , 2016, ESANN.

[6]  Fabio Aiolli,et al.  Efficient top-n recommendation for very large scale binary rated datasets , 2013, RecSys.

[7]  George Karypis,et al.  SLIM: Sparse Linear Methods for Top-N Recommender Systems , 2011, 2011 IEEE 11th International Conference on Data Mining.

[8]  Rocco A. Servedio,et al.  Efficiency versus Convergence of Boolean Kernels for On-Line Learning Algorithms , 2001, NIPS.

[9]  Ken Sadohara,et al.  Learning of Boolean Functions Using Support Vector Machines , 2001, ALT.

[10]  Fabio Aiolli,et al.  Learning deep kernels in the space of dot product polynomials , 2017, Machine Learning.

[11]  Alessandro Sperduti,et al.  A Kernel Method for the Optimization of the Margin Distribution , 2008, ICANN.

[12]  Neil Yorke-Smith,et al.  A Novel Bayesian Similarity Measure for Recommender Systems , 2013, IJCAI.

[13]  Daniel Thalmann,et al.  ETAF: An extended trust antecedents framework for trust prediction , 2014, 2014 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining (ASONAM 2014).

[14]  Kenneth Y. Goldberg,et al.  Eigentaste: A Constant Time Collaborative Filtering Algorithm , 2001, Information Retrieval.

[15]  Alexander J. Smola,et al.  Kernel Machines and Boolean Functions , 2001, NIPS.

[16]  Dunja Mladenic,et al.  Data Sparsity Issues in the Collaborative Filtering Framework , 2005, WEBKDD.

[17]  Mirko Polato,et al.  Exploiting sparsity to build efficient kernel based collaborative filtering for top-N item recommendation , 2016, Neurocomputing.

[18]  Mirko Polato,et al.  A preliminary study on a recommender system for the job recommendation challenge , 2016, RecSys Challenge '16.

[19]  Rocco A. Servedio,et al.  Maximum Margin Algorithms with Boolean Kernels , 2005, J. Mach. Learn. Res..

[20]  Ken Sadohara On a capacity control using Boolean kernels for the learning of Boolean functions , 2002, 2002 IEEE International Conference on Data Mining, 2002. Proceedings..

[21]  Fabio Aiolli A preference model for structured supervised learning tasks , 2005, Fifth IEEE International Conference on Data Mining (ICDM'05).

[22]  Nello Cristianini,et al.  Kernel Methods for Pattern Analysis , 2004 .

[23]  Evangelia Christakopoulou,et al.  Local Item-Item Models For Top-N Recommendation , 2016, RecSys.

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

[25]  Devavrat Shah,et al.  A Latent Source Model for Online Collaborative Filtering , 2014, NIPS.

[26]  Yifan Hu,et al.  Collaborative Filtering for Implicit Feedback Datasets , 2008, 2008 Eighth IEEE International Conference on Data Mining.

[27]  Scott Sanner,et al.  On the Effectiveness of Linear Models for One-Class Collaborative Filtering , 2016, AAAI.