Computer Science ›› 2018, Vol. 45 ›› Issue (11A): 439-444.

• Big Data & Data Mining • Previous Articles     Next Articles

Local Model Weighted Ensemble for Top-N Movie Recommendation

TANG Ying1, SUN Kang-gao1, QIN Xu-jia1, ZHOU Jian-mei2   

  1. School of Computer Science and Technology,Zhejiang University of Technology,Hangzhou 310023,China1
    School of Computer Science and Technology,Nantong University,Nantong,Jiangsu 226019,China2
  • Online:2019-02-26 Published:2019-02-26

Abstract: In order to solve the problem that the traditional recommendation algorithms can not accurately capture the user preference with a single model,this paper proposed a Top-N personalized recommendation algorithm based on local model weighted ensemble.This recommendation algorithm adopts user clustering to compute the local models and takes the sparse linear model as the basic recommendation model.Meanwhile,the semantic-level feature vector representation of each user was proposed based on LDA topic model and movie text content information,so as to implement user clustering.The experiments of the film data crawled from Douban show that our local model weighted ensemble recommendation algorithm enhances the recommendation quality of the original base model and outperforms some traditional classical recommendation algorithms,which demonstrates the effectiveness of the proposed algorithm.

Key words: Model ensemble, Recommendation system, Sparse linear model, Topic model

CLC Number: 

  • TP301
[1]DESHPANDE M,KARYPIS G.Item-based top-n recommendation algorithms[J].ACM Transactions on Information Systems (TOIS),2004,22(1):143-177.
[2]NING X,KARYPIS G.Slim:Sparse linear methods for top-n recommender systems[C]∥2011 IEEE 11th International Conference on Data Mining (ICDM).IEEE,2011:497-506.
[3]FUNK S.Netflix Update:Try This at Home[OL].http://si-fter.org/~simon/journal/20061211.html.
[4]KOREN Y,BELL R,VOLINSKY C.Matrix factorization techniques for recommender systems[J].Computer,2009,42(8):30-37.
[5]KOREN Y.Factorization meets the neighborhood:a multiface-ted collaborative filtering model[C]∥Proceedings of the 14th ACM SIGKDD international conference on Knowledge Discoveryand Data Mining.ACM,2008:426-434.
[6]KOREN Y.Collaborative filtering with temporal dynamics[J].Communications of the ACM,2010,53(4):89-97.
[7]HU Y,KOREN Y,VOLINSKY C.Collaborative filtering for implicit feedback datasets[C]∥Eighth IEEE International Conference on Data Mining,2008(ICDM’08).IEEE,2008:263-272.
[8]KABBUR S,NING X,KARYPIS G.Fism:factored item simila-rity models for top-n recommender systems[C]∥Proceedings of the 19th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining.ACM,2013:659-667.
[9]CREMONESI P,KOREN Y,TURRIN R.Performance of re-commender algorithms on top-n recommendation tasks[C]∥Proceedings of the Fourth ACM Conference on Recommender Systems.ACM,2010:39-46.
[10]KANG Z,PENG C,CHENG Q.Top-N Recommender System via Matrix Completion[C]∥AAAI.2016:179-185.
[11]RENDLE S,FREUDENTHALER C,GANTNER Z,et al.BPR:Bayesian personalized ranking from implicit feedback[C]∥Proceedings of the Twenty-fifth Conference on Uncertainty in Artificial Intelligence.AUAI Press,2009:452-461.
[12]O’CONNOR M,HERLOCKER J.Clustering items for collaborative filtering[C]∥Proceedings of the ACM SIGIR Workshop on Recommender Systems.UC Berkeley,1999:128.
[13]XU B,BU J,CHEN C,et al.An exploration of improving colla-borative recommender systems via user-item subgroups[C]∥Proceedings of the 21st International Conference on World Wide Web.ACM,2012:21-30.
[14]LEE J,KIM S,LEBANON G,et al.Local low-rank matrix approximation[C]∥International Conference on Machine Lear-ning.2013:82-90.
[15]LEE J,BENGIO S,KIM S,et al.Local collaborative ranking[C]∥Proceedings of the 23rd International Conference on World Wide Web.ACM,2014:85-96.
[16]CHRISTAKOPOULOU E,KARYPIS G.Local item-item mo-dels for top-n recommendation [C]∥Proceedings of the 10th ACM Conference on Recommender Systems.ACM,2016:67-74.
[17]BLEI D M,NG A Y,JORDAN M I.Latent dirichlet allocation[J].Journal of Machine Learning Research,2003,3(1):993-1022.
[18]HOFFMAN M,BACH F R,BLEI D M.Online learning for latent dirichlet allocation[C]∥Advances in Neural Information Processing Systems.2010:856-864.
[19]SEDHAIN S,MENON A K,SANNER S,et al.Autorec:Autoencoders meet collaborative filtering[C]∥Proceedings of the 24th International Conference on World Wide Web.ACM,2015:111-112.
[20]CHENG H T,KOC L,HARMSEN J,et al.Wide & deep lear-ning for recommender systems[C]∥Proceedings of the 1st Workshop on Deep Learning for Recommender Systems.ACM,2016:7-10.
[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] YANG Bing-xin, GUO Yan-rong, HAO Shi-jie, Hong Ri-chang. Application of Graph Neural Network Based on Data Augmentation and Model Ensemble in Depression Recognition [J]. Computer Science, 2022, 49(7): 57-63.
[6] CAI Xiao-juan, TAN Wen-an. Improved Collaborative Filtering Algorithm Combining Similarity and Trust [J]. Computer Science, 2022, 49(6A): 238-241.
[7] 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.
[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] 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.
[12] 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.
[13] LIU Yun-han, SHA Chao-feng, NIU Jun-yu. Analysis of Topics on Database Systems in Stack Overflow [J]. Computer Science, 2021, 48(6): 48-56.
[14] 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.
[15] XIAO Shi-tao, SHAO Ying-xia, SONG Wei-ping, CUI Bin. Hybrid Score Function for Collaborative Filtering Recommendation [J]. Computer Science, 2021, 48(3): 113-118.
Viewed
Full text


Abstract

Cited

  Shared   
  Discussed   
No Suggested Reading articles found!