Building user profiles based on sequences for content and collaborative filtering

Abstract Modeling user profiles is a necessary step for most information filtering systems – such as recommender systems – to provide personalized recommendations. However, most of them work with users or items as vectors, by applying different types of mathematical operations between them and neglecting sequential or content-based information. Hence, in this paper we study how to propose an adaptive mechanism to obtain user sequences using different sources of information, allowing the generation of hybrid recommendations as a seamless, transparent technique from the system viewpoint. As a proof of concept, we develop the Longest Common Subsequence (LCS) algorithm as a similarity metric to compare the user sequences, where, in the process of adapting this algorithm to recommendation, we include different parameters to control the efficiency by reducing the information used in the algorithm (preference filter), to decide when a neighbor is considered useful enough to be included in the process (confidence filter), to identify whether two interactions are equivalent (δ-matching threshold), and to normalize the length of the LCS in a bounded interval (normalization functions). These parameters can be extended to work with any type of sequential algorithm. We evaluate our approach with several state-of-the-art recommendation algorithms using different evaluation metrics measuring the accuracy, diversity, and novelty of the recommendations, and analyze the impact of the proposed parameters. We have found that our approach offers a competitive performance, outperforming content, collaborative, and hybrid baselines, and producing positive results when either content- or rating-based information is exploited.

[1]  Svetha Venkatesh,et al.  Collaborative filtering via sparse Markov random fields , 2016, Inf. Sci..

[2]  Saul Vargas,et al.  Rank and relevance in novelty and diversity metrics for recommender systems , 2011, RecSys '11.

[3]  P. Snchez,et al.  Collaborative filtering based on subsequence matching , 2017 .

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

[5]  Lars Schmidt-Thieme,et al.  Factorizing personalized Markov chains for next-basket recommendation , 2010, WWW '10.

[6]  L. Bergroth,et al.  A survey of longest common subsequence algorithms , 2000, Proceedings Seventh International Symposium on String Processing and Information Retrieval. SPIRE 2000.

[7]  Richard S. Zemel,et al.  Collaborative Filtering and the Missing at Random Assumption , 2007, UAI.

[8]  Jesús Bobadilla,et al.  A new collaborative filtering metric that improves the behavior of recommender systems , 2010, Knowl. Based Syst..

[9]  Yi-Cheng Zhang,et al.  Solving the apparent diversity-accuracy dilemma of recommender systems , 2008, Proceedings of the National Academy of Sciences.

[10]  G. Mahadevan,et al.  An online recommendation system based on web usage mining and Semantic Web using LCS Algorithm , 2011, 2011 3rd International Conference on Electronics Computer Technology.

[11]  Michael I. Jordan,et al.  Latent Dirichlet Allocation , 2001, J. Mach. Learn. Res..

[12]  Alberto Apostolico,et al.  String Editing and Longest Common Subsequences , 1997, Handbook of Formal Languages.

[13]  María Teresa Gómez López,et al.  Analysis and Visualization of the DX Community with Information Extracted from the Web , 2005, DEXA.

[14]  Iván Cantador,et al.  Time-aware recommender systems: a comprehensive survey and analysis of existing evaluation protocols , 2013, User Modeling and User-Adapted Interaction.

[15]  Lior Rokach,et al.  Recommender Systems: Introduction and Challenges , 2015, Recommender Systems Handbook.

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

[17]  Gao Cong,et al.  An Experimental Evaluation of Point-of-interest Recommendation in Location-based Social Networks , 2017, Proc. VLDB Endow..

[18]  Robin D. Burke,et al.  Hybrid Web Recommender Systems , 2007, The Adaptive Web.

[19]  Jun Wang,et al.  Structured collaborative filtering , 2011, CIKM '11.

[20]  Saul Vargas,et al.  Novelty and Diversity in Recommender Systems , 2015, Recommender Systems Handbook.

[21]  Thomas Hofmann,et al.  Latent semantic models for collaborative filtering , 2004, TOIS.

[22]  Mária Bieliková,et al.  Personalized hybrid recommendation for group of users: Top-N multimedia recommender , 2016, Inf. Process. Manag..

[23]  Yoav Shoham,et al.  Fab: content-based, collaborative recommendation , 1997, CACM.

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

[25]  Hao Wang,et al.  Location recommendation in location-based social networks using user check-in data , 2013, SIGSPATIAL/GIS.

[26]  Chonghuan Xu,et al.  A novel recommendation method based on social network using matrix factorization technique , 2018, Inf. Process. Manag..

[27]  Mehrdad Jalali,et al.  A Web Usage Mining Approach Based on LCS Algorithm in Online Predicting Recommendation Systems , 2008, 2008 12th International Conference Information Visualisation.

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

[29]  Alejandro Bellogín,et al.  Collaborative filtering based on subsequence matching: A new approach , 2017, Inf. Sci..

[30]  Hui Tian,et al.  A new user similarity model to improve the accuracy of collaborative filtering , 2014, Knowl. Based Syst..

[31]  Martha Larson,et al.  Collaborative Filtering beyond the User-Item Matrix , 2014, ACM Comput. Surv..

[32]  Hanghang Tong,et al.  RaPare: A Generic Strategy for Cold-Start Rating Prediction Problem , 2017, IEEE Transactions on Knowledge and Data Engineering.

[33]  John Riedl,et al.  An Empirical Analysis of Design Choices in Neighborhood-Based Collaborative Filtering Algorithms , 2002, Information Retrieval.

[34]  Pasquale Lops,et al.  An investigation on the serendipity problem in recommender systems , 2015, Inf. Process. Manag..

[35]  Shui Yu,et al.  FUIR: Fusing user and item information to deal with data sparsity by using side information in recommendation systems , 2016, J. Netw. Comput. Appl..

[36]  Harald Steck,et al.  Training and testing of recommender systems on data missing not at random , 2010, KDD.

[37]  Pasquale Lops,et al.  Semantics-aware Content-based Recommender Systems , 2014, CBRecSys@RecSys.

[38]  Alan Said,et al.  Comparative recommender system evaluation: benchmarking recommendation frameworks , 2014, RecSys '14.

[39]  Ahmed K. Elmagarmid,et al.  Duplicate Record Detection: A Survey , 2007, IEEE Transactions on Knowledge and Data Engineering.

[40]  Michael J. Pazzani,et al.  A Framework for Collaborative, Content-Based and Demographic Filtering , 1999, Artificial Intelligence Review.