Transfer learning from rating prediction to Top-k recommendation

被引:0
|
作者
Ye, Fan [1 ]
Lu, Xiaobo [1 ]
Li, Hongwei [1 ]
Chen, Zhenyu [1 ]
机构
[1] Anhui Univ, Acad Comp Sci & Technol, Hefei, Peoples R China
来源
PLOS ONE | 2024年 / 19卷 / 03期
关键词
D O I
10.1371/journal.pone.0300240
中图分类号
O [数理科学和化学]; P [天文学、地球科学]; Q [生物科学]; N [自然科学总论];
学科分类号
07 ; 0710 ; 09 ;
摘要
Recommender system has made great strides in two major research fields, rating prediction and Top-k recommendation. In essence, rating prediction is a regression task, which aims to predict users scores on other items, while Top-k is a classification task selecting the items that users have the most potential to interact with. Both characterize users and items, but the optimization of parameters varies widely for their respective tasks. Inspired by the idea of transfer learning, we consider extracting the information learned from rating prediction models for serving for Top-k tasks. To this end, we propose a universal transfer model for recommender systems. The transfer model consists of two sub-components: quadruple-based Bayesian Converter (BC) and Prediction-based Multi-Layer Perceptron (PMLP). As the main part, BC is responsible for transforming the feature vectors extracted from the rating prediction model. Meanwhile, PMLP extracts the prediction ratings, constructs the prediction rating matrix, and uses multi-layer perceptron to enhance the final performance. On four benchmark datasets, we use the information extracted from the singular value decomposition plus plus (SVD++) model to demonstrate the effectiveness of BC-PMLP, comparing to classical and state-of-the-art baselines. We also conduct extra experiments to verify the utility of BC, and performance within different parameter values.
引用
收藏
页数:23
相关论文
共 50 条
  • [31] Trust-based top-k item recommendation in social networks
    Xing, Xing
    Zhang, Weishi
    Jia, Zhichun
    Zhang, Xiuguo
    Xu, Nan
    Journal of Information and Computational Science, 2013, 10 (12): : 3685 - 3696
  • [32] Link Prediction Using Top-k Shortest Distances
    Lebedev, Andrei
    Lee, JooYoung
    Rivera, Victor
    Mazzara, Manuel
    DATA ANALYTICS, 2017, 10365 : 101 - 105
  • [33] A Top-k Learning to Rank Approach to Cross-Project Software Defect Prediction
    Wang, Feng
    Huang, Jinxiao
    Ma, Yutao
    2018 25TH ASIA-PACIFIC SOFTWARE ENGINEERING CONFERENCE (APSEC 2018), 2018, : 335 - 344
  • [34] Active Learning for Top-K Rank Aggregation from Noisy Comparisons
    Mohajer, Soheil
    Suh, Changho
    Elmandy, Adel
    INTERNATIONAL CONFERENCE ON MACHINE LEARNING, VOL 70, 2017, 70
  • [35] Neural variational collaborative filtering with side information for top-K recommendation
    Deng, Xiaoyi
    Zhuang, Fuzhen
    Zhu, Zhiguo
    INTERNATIONAL JOURNAL OF MACHINE LEARNING AND CYBERNETICS, 2019, 10 (11) : 3273 - 3284
  • [36] Differentiable Ranking Metric Using Relaxed Sorting for Top-K Recommendation
    Lee, Hyunsung
    Cho, Sangwoo
    Jang, Yeongjae
    Kim, Jaekwang
    Woo, Honguk
    IEEE Access, 2021, 9 : 114649 - 114658
  • [37] Neural variational collaborative filtering with side information for top-K recommendation
    Xiaoyi Deng
    Fuzhen Zhuang
    Zhiguo Zhu
    International Journal of Machine Learning and Cybernetics, 2019, 10 : 3273 - 3284
  • [38] NEAR: Normalized Network Embedding with Autoencoder for Top-K Item Recommendation
    Li, Dedong
    Zhou, Aimin
    Shi, Chuan
    ADVANCES IN KNOWLEDGE DISCOVERY AND DATA MINING, PAKDD 2019, PT III, 2019, 11441 : 15 - 26
  • [39] Bandit algorithms: A comprehensive review and their dynamic selection from a portfolio for multicriteria top-k recommendation
    Letard, Alexandre
    Gutowski, Nicolas
    Camp, Olivier
    Amghar, Tassadit
    EXPERT SYSTEMS WITH APPLICATIONS, 2024, 246
  • [40] On learning discriminative embeddings for optimized top-k matching
    Ghosh, Soumyadeep
    Vatsa, Mayank
    Singh, Richa
    Ratha, Nalini
    PATTERN RECOGNITION, 2025, 162