Computer Science ›› 2019, Vol. 46 ›› Issue (6A): 488-492.

• Big Data & Data Mining • Previous Articles     Next Articles

Matrix Factorization Recommendation Algorithm Based on Adaptive Weighted Samples

SHI Xiao-ling, CHEN Zhi, YANG Li-gong, SHEN Wei   

  1. Taizhou Polytechnic College,Taizhou,Jiangsu 225300,China
  • Online:2019-06-14 Published:2019-07-02

Abstract: Missing value estimation of sparse matrix is a necessary basic research,which is also particularly important and significant in some practical applications,such as the recommendation system.There are many methods to solve this problem,one of the most effective method to tackle this issue is Matrix Factorization (MF).However,the traditional MF algorithm has some limitations,which can only directly simulate the elements of the sparse matrix by using regression method.But it did not take into account the sample itself,which has different difficulty in regression and should be treated respectively.According to this limitation,this paper proposed a matrix factorization recommendation algorithm based on adaptive weighted samples (AWS-MF).Based on the traditional MF algorithm,the proposed method exploits the differences among the training samples and treats each sample in a bias weights.In order to improve the performance and robustness of our model,the intermediate results are combined together in the final process to obtain the objective predictions.To verify the superiority of the proposed method,the comprehensive experiments were conducted on the real-world data sets.The experiment results demonstrate that the proposed AWS-MF algorithm is able to adaptively re-weight samples according to the differences among them.Moreover,treating the samples respectively can lead to a promising performance in the real-world applications compared to the baseline methods.

Key words: Bias, Matrix Factorization(MF), Missing value estimation, Recommendation system, Sample differences

CLC Number: 

  • TP182
[1]BREESE J S,Heckerman D,Kadie C.Empirical analysis of predictive algorithms for collaborative filtering[C]∥Proceedings of the Fourteenth Conference on Uncertainty in Artificial Intelligence.Morgan Kaufmann Publishers Inc.,1998:43-52.
[2]HERLOCKER J L,KONSTAN J A,BORCHERS A,et al.An algorithmic framework for performing collaborative filtering[C]∥Proceedings of the 22nd Annual International ACM SIGIR Conference on Research and Development in Information Retrieval.ACM,1999:230-237.
[3]LINDEN G,SMITH B,YORK J.Amazon.com recommendations:Item-to-item collaborative filtering.IEEE Internet Computing,2003,7(1):76-80.
[4]SARWAR B,KARYPIS G,KONSTAN J,et al.Item-based collaborative filtering recommendation algorithms[C]∥Procee-dings of the 10th international conference on World Wide Web.ACM,2001:285-295.
[5]KOREN Y,BELL R,VOLINSKY C.Matrix factorization tech-niques for recommender systems.Computer,2009,42(8):30-37.
[6]LEE D D,SEUNG H S.Algorithms for non-negative matrix fac-torization[C]∥Advances in Neural Information Processing Systems.2001:556-562.
[7]PAATERO P,TAPPER U.Positive matrix factorization:A non-negative factor model with optimal utilization of error estimates of data values.Environmetrics,1994,5(2):111-126.
[8]ZHANG S,WANG W,FORD J,et al.Learning from incomplete ratings using non-negative matrix factorization∥Procee-dings of the 2006 SIAM International Conference on Data Mi-ning.Society for Industrial and Applied Mathematics,2006:549-553.
[9]李乐,章毓晋.非负矩阵分解算法综述.电子学报,2008,36(4):737-743.
[10]李改,李磊.基于矩阵分解的协同过滤算法.计算机工程与应用,2011,47(30):4-7.
[11]LUO X,ZHOU M,XIA Y,et al.An efficient non-negative matrix-factorization-based approach to collaborative filtering for recommender systems.IEEE Transactions on Industrial Informatics,2014,10(2):1273-1284.
[12]于玲,吴铁军.集成学习:Boosting 算法综述.模式识别与人工智能,2004,17(1):52-59.
[13]董乐红,耿国华,高原.Boosting 算法综述.计算机应用与软件,2006,23(8):27-29.
[14]SCHAPIRE R E,SINGER Y.Improved boosting algorithms using confidence-rated predictions.Machine Learning,1999,37(3):297-336.
[15]曹莹,苗启广,刘家辰,等.AdaBoost 算法研究进展与展望.自动化学报,2013,39(6):745-758.
[16]HASITE T,ROSSET S,ZHU J,et al.Multi-class adaboost.Statistics and its Interface,2009,2(3):349-360.
[17]RUDER S.An overview of gradient descent optimization algorithms.arXiv preprint arXiv:1609.04747,2016.
[18]HARPER F M,Konstan J A.The movielens datasets:History and context.ACM Transactions on Interactive Intelligent Systems (TiiS),2016,5(4):19.
[1] QIN Qi-qi, ZHANG Yue-qin, WANG Run-ze, ZHANG Ze-hua. Hierarchical Granulation Recommendation Method Based on Knowledge Graph [J]. Computer Science, 2022, 49(8): 64-69.
[2] FANG Yi-qiu, ZHANG Zhen-kun, GE Jun-wei. Cross-domain Recommendation Algorithm Based on Self-attention Mechanism and Transfer Learning [J]. Computer Science, 2022, 49(8): 70-77.
[3] SHUAI Jian-bo, WANG Jin-ce, HUANG Fei-hu, PENG Jian. Click-Through Rate Prediction Model Based on Neural Architecture Search [J]. Computer Science, 2022, 49(7): 10-17.
[4] QI Xiu-xiu, WANG Jia-hao, LI Wen-xiong, ZHOU Fan. Fusion Algorithm for Matrix Completion Prediction Based on Probabilistic Meta-learning [J]. Computer Science, 2022, 49(7): 18-24.
[5] CAI Xiao-juan, TAN Wen-an. Improved Collaborative Filtering Algorithm Combining Similarity and Trust [J]. Computer Science, 2022, 49(6A): 238-241.
[6] HE Yi-chen, MAO Yi-jun, XIE Xian-fen, GU Wan-rong. Matrix Transformation and Factorization Based on Graph Partitioning by Vertex Separator for Recommendation [J]. Computer Science, 2022, 49(6A): 272-279.
[7] XU Guo-ning, CHEN Yi-peng, CHEN Yi-ming, CHEN Jin-yin, WEN Hao. Data Debiasing Method Based on Constrained Optimized Generative Adversarial Networks [J]. Computer Science, 2022, 49(6A): 184-190.
[8] XIONG Zhong-min, SHU Gui-wen, GUO Huai-yu. Graph Neural Network Recommendation Model Integrating User Preferences [J]. Computer Science, 2022, 49(6): 165-171.
[9] HONG Zhi-li, LAI Jun, CAO Lei, CHEN Xi-liang, XU Zhi-xiong. Study on Intelligent Recommendation Method of Dueling Network Reinforcement Learning Based on Regret Exploration [J]. Computer Science, 2022, 49(6): 149-157.
[10] YU Ai-xin, FENG Xiu-fang, SUN Jing-yu. Social Trust Recommendation Algorithm Combining Item Similarity [J]. Computer Science, 2022, 49(5): 144-151.
[11] ZHANG Yu-jiao, HUANG Rui, ZHANG Fu-quan, SUI Dong, ZHANG Hu. Study on Affinity Propagation Clustering Algorithm Based on Bacterial Flora Optimization [J]. Computer Science, 2022, 49(5): 165-169.
[12] CHEN Jin-peng, HU Ha-lei, ZHANG Fan, CAO Yuan, SUN Peng-fei. Convolutional Sequential Recommendation with Temporal Feature and User Preference [J]. Computer Science, 2022, 49(1): 115-120.
[13] QIAN Meng-wei , GUO Yi. Biased Deep Distance Factorization Algorithm for Top-N Recommendation [J]. Computer Science, 2021, 48(9): 103-109.
[14] ZHAN Wan-jiang, HONG Zhi-lin, FANG Lu-ping, WU Zhe-fu, LYU Yue-hua. Collaborative Filtering Recommendation Algorithm Based on Adversarial Learning [J]. Computer Science, 2021, 48(7): 172-177.
[15] YU Sheng, LI Bin, SUN Xiao-bing, BO Li-li, ZHOU Cheng. Approach for Knowledge-driven Similar Bug Report Recommendation [J]. Computer Science, 2021, 48(5): 91-98.
Viewed
Full text


Abstract

Cited

  Shared   
  Discussed   
No Suggested Reading articles found!