Personalized Recommender Systems with Multi-source Data

Pervasive applications of personalized recommendation models aim to seek a targeted advertising strategy for business development and to provide customers with personalized suggestions for products or services based on their personal experience. Conventional approaches to recommender systems, such as Collaborative Filtering (CF), use direct user ratings without considering latent features. To overcome such a limitation, we develop a recommendation strategy based on the so-called heterogeneous information networks. This method can combine two or multiple sources datasets and thus can reveal more latent associations/features between items. Compared with the well-known ‘k Nearest Neighborhood’ model and ‘Singular Value Decomposition’ approach, the new method produces a substantial higher accuracy under the commonly used measurement which is mean absolute deviation.

[1]  Jacob Benesty,et al.  Pearson Correlation Coefficient , 2009 .

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

[3]  D. A. Adeniyi,et al.  Automated web usage data mining and recommendation system using K-Nearest Neighbor (KNN) classification method , 2016 .

[4]  Jian Lu,et al.  A Hybrid Recommender System Combing Singular Value Decomposition and Linear Mixed Model , 2020, SAI.

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

[6]  Ohad Shamir,et al.  Fast Stochastic Algorithms for SVD and PCA: Convergence Properties and Convexity , 2015, ICML.

[7]  Yehuda Koren,et al.  Scalable Collaborative Filtering with Jointly Derived Neighborhood Interpolation Weights , 2007, Seventh IEEE International Conference on Data Mining (ICDM 2007).

[8]  Yehuda Koren,et al.  Factorization meets the neighborhood: a multifaceted collaborative filtering model , 2008, KDD.

[9]  Philip S. Yu,et al.  Meta path-based collective classification in heterogeneous information networks , 2012, CIKM.

[10]  MengChu Zhou,et al.  An Efficient Non-Negative Matrix-Factorization-Based Approach to Collaborative Filtering for Recommender Systems , 2014, IEEE Transactions on Industrial Informatics.

[11]  F. Serradilla,et al.  Choice of metrics used in collaborative filtering and their impact on recommender systems , 2008, 2008 2nd IEEE International Conference on Digital Ecosystems and Technologies.

[12]  John Riedl,et al.  Application of Dimensionality Reduction in Recommender System - A Case Study , 2000 .

[13]  Feiping Nie,et al.  Regularized Singular Value Decomposition and Application to Recommender System , 2018, ArXiv.

[14]  Yehuda Koren,et al.  Factor in the neighbors: Scalable and accurate collaborative filtering , 2010, TKDD.

[15]  Yiming Wang,et al.  Learning with Linear Mixed Model for Group Recommendation Systems , 2019, ICMLC '19.

[16]  Zhiyi Chen,et al.  Profile Inference from Heterogeneous Data - Fundamentals and New Trends , 2019, BIS.

[17]  Ronald Rousseau,et al.  Requirements for a cocitation similarity measure, with special reference to Pearson's correlation coefficient , 2003, J. Assoc. Inf. Sci. Technol..

[18]  Robert A. Legenstein,et al.  Combining predictions for accurate recommender systems , 2010, KDD.

[19]  Sang-goo Lee,et al.  Reversed CF: A fast collaborative filtering algorithm using a k-nearest neighbor graph , 2015, Expert Syst. Appl..

[20]  John Riedl,et al.  Item-based collaborative filtering recommendation algorithms , 2001, WWW '01.

[21]  Yehuda Koren,et al.  Matrix Factorization Techniques for Recommender Systems , 2009, Computer.

[22]  G. James Blaine,et al.  Continuous Monitoring of Physiologic Variables with a Dedicated Minicomputer , 1975, Computer.

[23]  Raymond J. Mooney,et al.  Content-boosted collaborative filtering for improved recommendations , 2002, AAAI/IAAI.

[24]  Xin Lu,et al.  Censorious Young: Knowledge Discovery from High-throughput Movie Rating Data with LME4 , 2019, 2019 IEEE 4th International Conference on Big Data Analytics (ICBDA).

[25]  Shengxin Zhu,et al.  Essential formulae for restricted maximum likelihood and its derivatives associated with the linear mixed models , 2018, 1805.05188.

[26]  Bradley N. Miller,et al.  MovieLens unplugged: experiences with an occasionally connected recommender system , 2003, IUI '03.

[27]  Zhiyi Chen,et al.  Knowledge Discovery and Recommendation With Linear Mixed Model , 2020, IEEE Access.

[28]  Tongxiang Gu,et al.  AIMS: Average information matrix splitting , 2020, Math. Found. Comput..

[29]  Xiaowen Xu,et al.  Information Splitting for Big Data Analytics , 2016, 2016 International Conference on Cyber-Enabled Distributed Computing and Knowledge Discovery (CyberC).

[30]  Pattie Maes,et al.  Social information filtering: algorithms for automating “word of mouth” , 1995, CHI '95.

[31]  F. Maxwell Harper,et al.  The MovieLens Datasets: History and Context , 2016, TIIS.

[32]  Shengxin Zhu,et al.  Fast calculation of restricted maximum likelihood methods for unstructured high-throughput data , 2017, 2017 IEEE 2nd International Conference on Big Data Analysis (ICBDA)(.

[33]  Rachana Mehta,et al.  A review on matrix factorization techniques in recommender systems , 2017, 2017 2nd International Conference on Communication Systems, Computing and IT Applications (CSCITA).