Multi-task Learning Model based on Multiple Characteristics and Multiple Interests for CTR prediction

被引:0
作者
Xie, Yufeng [1 ]
Li, Mingchu [1 ]
Lu, Kun [1 ]
Shah, Syed Bilal Hussain [2 ]
Zheng, Xiao [3 ]
机构
[1] Dalian Univ Technol, Dalian, Peoples R China
[2] Manchester Metropolitan Univ, Manchester, Lancs, England
[3] Shandong Univ Technol, Sch Comp Sci & Technol, Zibo, Peoples R China
来源
2022 5TH IEEE CONFERENCE ON DEPENDABLE AND SECURE COMPUTING (IEEE DSC 2022) | 2022年
基金
美国国家科学基金会;
关键词
Recommendation algorithm; CTR prediction; multi-interest; multi-task learning;
D O I
10.1109/DSC54232.2022.9888898
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
In the era of big data, the acquisition and utilization of information becomes difficult with the skyrocketing amount of data. It is often difficult for ordinary users to find the information or items they need, and personalized recommendation systems can solve this problem well. Currently, recommendation systems increasingly adopt models based on deep learning. The most critical issue in using deep learning for recommendation systems is how to use neural networks to accurately learn user representation vectors and item representation vectors. Many deep learning models used a single vector to represent users, but users' interests were often diverse. Therefore, some researchers consider using multiple vectors to represent user interests, and each interest vector corresponds to a category of items. This method sounds more scientific. However, these models still have problems. Their interpretation of user interests stays at the item level, and does not go deep into the item feature level. In order to solve this problem, we consider user interests from the perspective of item characteristics, and propose 3M (Multi-task, Multi-interest, Multi-feature) model. The 3M model trains multiple interest vectors for each user and extracts multiple characteristic vectors for each item at the same time, then uses a multi-task learning model to connect the characteristic vectors with the interest vectors and train them to obtain multiple interest scores. According to the multiple interest scores, the user click probability can be obtained. Experiments show that our model performs significantly better than the classic CTR(Click-Through Rate) prediction model on the experimental dataset.
引用
收藏
页数:7
相关论文
共 15 条
  • [1] Cen Y, 2020, arXiv
  • [2] Cheng H. T., 2016, PROC 1 WORKSHOP DEEP, P7
  • [3] Eigen D, 2014, Arxiv, DOI [arXiv:1312.4314, 10.48550/arxiv.1312.4314]
  • [4] An introduction to ROC analysis
    Fawcett, Tom
    [J]. PATTERN RECOGNITION LETTERS, 2006, 27 (08) : 861 - 874
  • [5] Guo HF, 2017, Arxiv, DOI arXiv:1703.04247
  • [6] Neural Collaborative Filtering
    He, Xiangnan
    Liao, Lizi
    Zhang, Hanwang
    Nie, Liqiang
    Hu, Xia
    Chua, Tat-Seng
    [J]. PROCEEDINGS OF THE 26TH INTERNATIONAL CONFERENCE ON WORLD WIDE WEB (WWW'17), 2017, : 173 - 182
  • [7] Koren Y., 2008, P 14 ACM SIGKDD INT, P426, DOI DOI 10.1145/1401890.1401944
  • [8] Multi-Interest Network with Dynamic Routing for Recommendation at Tmall
    Li, Chao
    Liu, Zhiyuan
    Wu, Mengmeng
    Xu, Yuchi
    Zhao, Huan
    Huang, Pipei
    Kang, Guoliang
    Chen, Qiwei
    Li, Wei
    Lee, Dik Lun
    [J]. PROCEEDINGS OF THE 28TH ACM INTERNATIONAL CONFERENCE ON INFORMATION & KNOWLEDGE MANAGEMENT (CIKM '19), 2019, : 2615 - 2623
  • [9] Modeling Task Relationships in Multi-task Learning with Multi-gate Mixture-of-Experts
    Ma, Jiaqi
    Zhao, Zhe
    Yi, Xinyang
    Chen, Jilin
    Hong, Lichan
    Chi, Ed H.
    [J]. KDD'18: PROCEEDINGS OF THE 24TH ACM SIGKDD INTERNATIONAL CONFERENCE ON KNOWLEDGE DISCOVERY & DATA MINING, 2018, : 1930 - 1939
  • [10] Entire Space Multi-Task Model: An Effective Approach for Estimating Post-Click Conversion Rate
    Ma, Xiao
    Zhao, Liqin
    Huang, Guan
    Wang, Zhi
    Hu, Zelin
    Zhu, Xiaoqiang
    Gai, Kun
    [J]. ACM/SIGIR PROCEEDINGS 2018, 2018, : 1137 - 1140