ABSTRACT
Feature-based matrix factorization techniques such as Factorization Machines (FM) have been proven to achieve impressive accuracy for the rating prediction task. However, most common recommendation scenarios are formulated as a top-N item ranking problem with implicit feedback (e.g., clicks, purchases)rather than explicit ratings. To address this problem, with both implicit feedback and feature information, we propose a feature-based collaborative boosting recommender called BoostFM, which integrates boosting into factorization models during the process of item ranking. Specifically, BoostFM is an adaptive boosting framework that linearly combines multiple homogeneous component recommenders, which are repeatedly constructed on the basis of the individual FM model by a re-weighting scheme. Two ways are proposed to efficiently train the component recommenders from the perspectives of both pairwise and listwise Learning-to-Rank (L2R). The properties of our proposed method are empirically studied on three real-world datasets. The experimental results show that BoostFM outperforms a number of state-of-the-art approaches for top-N recommendation.
- Linas Baltrunas and Francesco Ricci. 2009. Context-based splitting of item ratings in collaborative filtering. In RecSys. 245--248. Google ScholarDigital Library
- Alberto Bertoni, Paola Campadelli, and M Parodi. 1997. A boosting algorithm for regression. In ICANN. 343--348. Google ScholarDigital Library
- Chris Burges, Tal Shaked, Erin Renshaw, Ari Lazier, Matt Deeds, Nicole Hamilton, and Greg Hullender. 2005. Learning to rank using gradient descent. In ICML. 89--96. Google ScholarDigital Library
- Chen Cheng, Fen Xia, Tong Zhang, Irwin King, and Michael R Lyu. 2014. Gradient boosting factorization machines. In RecSys. 265--272. Google ScholarDigital Library
- Nipa Chowdhury, Xiongcai Cai, and Cheng Luo. 2015. BoostMF: Boosted Matrix Factorisation for Collaborative Ranking. In ECML-PKDD. 3--18.Google Scholar
- Konstantina Christakopoulou and Arindam Banerjee. 2015. Collaborative Ranking with a Push at the Top. In WWW. 205--215. Google ScholarDigital Library
- Yoav Freund and Robert Schapire. 1999. A short introduction to boosting. Journal-Japanese Society For Artificial Intelligence (1999), 1612.Google Scholar
- Yoav Freund and Robert E Schapire. 1995. A desicion-theoretic generalization of on-line learning and an application to boosting. In EuroCOLT. Springer, 23--37. Google ScholarDigital Library
- Jerome Friedman, Trevor Hastie, Robert Tibshirani, and others. 2000. Additive logistic regression: a statistical view of boosting (with discussion and a rejoinder by the authors). The annals of statistics (2000), 337--407.Google Scholar
- Liangjie Hong, Aziz S Doumith, and Brian D Davison. 2013. Co-factorization machines: modeling user interests and predicting individual decisions in twitter. In WSDM. 557--566. Google ScholarDigital Library
- Xiaotian Jiang, Zhendong Niu, Jiamin Guo, Ghulam Mustafa, Zi-Han Lin, Baomi Chen, and Qian Zhou. 2013. Novel Boosting Frameworks to Improve the Performance of Collaborative Filtering. (2013).Google Scholar
- Alexandros Karatzoglou, Xavier Amatriain, Linas Baltrunas, and Nuria Oliver. 2010. Multiverse recommendation: n-dimensional tensor factorization for context-aware collaborative filtering. In RecSys. Google ScholarDigital Library
- Yehuda Koren. 2010. Collaborative filtering with temporal dynamics. Commun. ACM (2010), 89--97. Google ScholarDigital Library
- Xutao Li, Gao Cong, Xiao-Li Li, Tuan-Anh Nguyen Pham, and Shonali Krishnaswamy. 2015. Rank-GeoFM: a ranking based geographical factorization method for point of interest recommendation. In SIGIR. 433--442. Google ScholarDigital Library
- Xuchun Li, Lei Wang, and Eric Sung. 2008. AdaBoost with SVM-based component classifiers. EAAI (2008), 785--795. Google ScholarDigital Library
- Yong Liu, Peilin Zhao, Aixin Sun, and Chunyan Miao. 2015. A boosting algorithm for item recommendation with implicit feedback. In IJCAI. Google ScholarDigital Library
- W. Pan and L. Chen. 2013. GBPR: Group preference based bayesian personalized ranking for one-class collaborative filtering. In IJCAI. 2691--2697. Google ScholarDigital Library
- Runwei Qiang, Feng Liang, and Jianwu Yang. 2013. Exploiting ranking factorization machines for microblog retrieval. In CIKM. 1783--1788. Google ScholarDigital Library
- C Quoc and Viet Le. 2007. Learning to rank with nonsmooth cost functions. (2007), 193--200. Google ScholarDigital Library
- Steffen Rendle. 2010. Factorization machines. In ICDM. 995--1000. Google ScholarDigital Library
- Steffen Rendle. 2012. Factorization Machines with libFM. TIST (2012), 57. Google ScholarDigital Library
- Steffen Rendle and Christoph Freudenthaler. 2014. Improving pairwise learning for item recommendation from implicit feedback. In WSDM. 273--282. Google ScholarDigital Library
- Steffen Rendle, Christoph Freudenthaler, Zeno Gantner, and Lars Schmidt-Thieme. BPR: Bayesian Personalized Ranking from Implicit Feedback. In UAI. 452--461. Google ScholarDigital Library
- Steffen Rendle and Lars Schmidt-Thieme. 2010. Pairwise Interaction Tensor Factorization for Personalized Tag Recommendation. In WSDM. 81--90. Google ScholarDigital Library
- Robert E Schapire. 2013. Explaining adaboost. In Empirical inference. 37--52.Google Scholar
- Yue Shi, Alexandros Karatzoglou, Linas Baltrunas, Martha Larson, and Alan Hanjalic. 2014. Cars2: Learning context-aware representations for context-aware recommendations. In CIKM. 291--300. Google ScholarDigital Library
- Yue Shi, Alexandros Karatzoglou, Linas Baltrunas, Martha Larson, Alan Hanjalic, and Nuria Oliver. 2012. TFMAP: Optimizing MAP for top-n context-aware recommendation. In SIGIR. 155--164. Google ScholarDigital Library
- Yanghao Wang, Hailong Sun, and Richong Zhang. 2014. Adamf: Adaptive boosting matrix factorization for recommender system. In WAIM. 43--54.Google Scholar
- Liang Xiong, Xi Chen, Tzu-Kuo Huang, Jeff G Schneider, and Jaime G Carbonell. Temporal Collaborative Filtering with Bayesian Probabilistic Tensor Factorization. SIAM.Google Scholar
- Jun Xu and Hang Li. 2007. Adarank: a boosting algorithm for information retrieval. In SIGIR. 391--398. Google ScholarDigital Library
- Fajie Yuan, Guibing Guo, Joemon M Jose, Long Chen, Haitao Yu, and Weinan Zhang. 2016a. Lambdafm: learning optimal ranking with factorization machines using lambda surrogates. In CIKM. 227--236. Google ScholarDigital Library
- Fajie Yuan, Guibing Guo, Joemon M Jose, Long Chen, Haitao Yu, and Weinan Zhang. 2016b. Optimizing factorization machines for top-n context-aware recommendations. In WISE. 278--293.Google Scholar
- Fajie Yuan, Joemon M Jose, Guibing Guo, Long Chen, Haitao Yu, and Rami S Alkhawaldeh. 2016c. Joint Geo-Spatial Preference and Pairwise Ranking for Point-of-Interest Recommendation. In ICTAI.Google Scholar
- Weinan Zhang, Tianqi Chen, Jun Wang, and Yong Yu. 2013. Optimizing top-n collaborative filtering via dynamic negative item sampling. In SIGIR. 785--788. Google ScholarDigital Library
Index Terms
- BoostFM: Boosted Factorization Machines for Top-N Feature-based Recommendation
Recommendations
LambdaFM: Learning Optimal Ranking with Factorization Machines Using Lambda Surrogates
CIKM '16: Proceedings of the 25th ACM International on Conference on Information and Knowledge ManagementState-of-the-art item recommendation algorithms, which apply Factorization Machines (FM) as a scoring function and pairwise ranking loss as a trainer (PRFM for short), have been recently investigated for the implicit feedback based context-aware ...
Gradient boosting factorization machines
RecSys '14: Proceedings of the 8th ACM Conference on Recommender systemsRecommendation techniques have been well developed in the past decades. Most of them build models only based on user item rating matrix. However, in real world, there is plenty of auxiliary information available in recommendation systems. We can utilize ...
A Deep Autoencoder-Based Hybrid Recommender System
Recommender systems build their suggestions on rating data, given explicitly or implicitly by users on items. These ratings create a huge sparse user-item rating matrix which opens two challenges for researchers on the field. The first challenge is ...
Comments