An Intention-Aware Markov Chain Based Method for Top-K Recommendation

被引:2
|
作者
Ni, Shiying [1 ]
Hu, Shiyan [2 ]
Li, Lefei [1 ]
机构
[1] Tsinghua Univ, Dept Ind Engn, Beijing 100084, Peoples R China
[2] Univ Southampton, Sch Elect & Comp Sci, Southampton SO17 1BJ, England
关键词
Behavioral sciences; Markov processes; Computational modeling; Training; Recommender systems; Electronic commerce; Sparse matrices; Recommendation systems; intention; Markov chain; mixture transition distribution; matrix factorization;
D O I
10.1109/TASE.2022.3230783
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Recommender systems play significant roles in business, especially in e-commerce. Nevertheless, users' behaviors are usually mixing and drifting, which is hard to tackle. Current sequential methods of item-wise interest extracting suffer from the intricacy and sparsity of data. Inspired by that category-wise interests may be intrinsic drivers of user behaviors and heterogeneous actions may reveal certain behavior patterns, we introduce intention as a tuple of category and action to address the data issues. In this paper, an intention-aware Markov chain based sequential recommendation model (IMRec) is proposed. We model the overall preferences of users as the integration of long-term preferences and short-term intents. In particular, the matrix factorization method is adopted to extract the long-term user-item preference. For the modeling of the short-term intents transition, we adopt high-order Markov chain based methods. A factorized mixture transition distribution model for high-order Markov chain approximation is leveraged in this paper to reduce the algorithm complexity. An auxiliary loss on intention representation is utilized, which brings considerable performance improvements. Experiments on real-world datasets demonstrate that our model outperforms state-of-the-art baseline models in terms of three common metrics, and shows superior stability, scalability, and training efficiency. Note to Practitioners-In e-commerce, sequential recommenders are essential to facilitate decision-making and promote business. A big challenge is to capture the sequential patterns from the mixing and drifting user-item interaction sequences. Customer behaviors are often driven by their inherent intentions, which may present more stable and reliable patterns. Motivated by that, we propose a novel intention-aware next-item recommendation algorithm with high performance. Our method models the user-item preferences as the integration of long-term preferences and short-term intents. More specifically, long-term preferences show the general tastes of users, which are modeled by latent factors of users and items. Additionally, the intention is defined as a tuple of category and action. We model the short-term intents as the intention transition from the past intentions by a high-order Markov chain. We further leverage a factorization-based mixture transition distribution model for high-order Markov chain approximation and reduce the algorithm complexity. The proposed model is validated in 4 real-world datasets and shows good recommendation performance, performance stability, model scalability, and training efficiency. Our model provides an effective recommendation method at low computational costs for e-commerce companies.
引用
收藏
页码:581 / 592
页数:12
相关论文
共 50 条
  • [1] Intention-Aware Sequential Recommendation With Structured Intent Transition
    Li, Haoyang
    Wang, Xin
    Zhang, Ziwei
    Ma, Jianxin
    Cui, Peng
    Zhu, Wenwu
    [J]. IEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING, 2022, 34 (11) : 5403 - 5414
  • [2] Location-aware online learning for top-k recommendation
    Palovics, Robert
    Szalai, Peter
    Pap, Julia
    Frigo, Erzsebet
    Kocsis, Levente
    Benczur, Andras A.
    [J]. PERVASIVE AND MOBILE COMPUTING, 2017, 38 : 490 - 504
  • [3] A Behavior-Item Based Hybrid Intention-Aware Frame for Sequence Recommendation
    Chen, Yan
    Zeng, Jiangwei
    Zhu, Haiping
    Tian, Feng
    Liu, Yu
    Liu, Qidong
    Zheng, Qinghua
    [J]. ADVANCES IN E-BUSINESS ENGINEERING FOR UBIQUITOUS COMPUTING, 2020, 41 : 606 - 620
  • [4] Intention-aware denoising graph neural network for session-based recommendation
    Shanshan Hua
    Mingxin Gan
    [J]. Applied Intelligence, 2023, 53 : 23097 - 23112
  • [5] Intention-aware denoising graph neural network for session-based recommendation
    Hua, Shanshan
    Gan, Mingxin
    [J]. APPLIED INTELLIGENCE, 2023, 53 (20) : 23097 - 23112
  • [6] IKGN: Intention-aware Knowledge Graph Network for POI Recommendation
    Zhu, Xiaoyu
    Bu, Chenyang
    Dong, Bingbing
    Ji, Shengwei
    He, Yi
    Wu, Xindong
    [J]. 23RD IEEE INTERNATIONAL CONFERENCE ON DATA MINING, ICDM 2023, 2023, : 908 - 917
  • [7] Group Formation Based on Crowdsourced Top-k Recommendation
    Gao, Yunpeng
    Cai, Wei
    Liang, Kuiyang
    [J]. WEB AND BIG DATA, 2017, 10612 : 204 - 213
  • [8] Diarec: Dynamic Intention-Aware Recommendation with Attention-Based Context-Aware Item Attributes Modeling
    Vaghari, Hadise
    Aghdam, Mehdi Hosseinzadeh
    Emami, Hojjat
    [J]. JOURNAL OF ARTIFICIAL INTELLIGENCE AND SOFT COMPUTING RESEARCH, 2024, 14 (02) : 171 - 189
  • [9] On Sampling Top-K Recommendation Evaluation
    Li, Dong
    Jin, Ruoming
    Gao, Jing
    Liu, Zhi
    [J]. KDD '20: PROCEEDINGS OF THE 26TH ACM SIGKDD INTERNATIONAL CONFERENCE ON KNOWLEDGE DISCOVERY & DATA MINING, 2020, : 2114 - 2124
  • [10] Top-k Taxi Recommendation in Realtime Social-Aware Ridesharing Services
    Fu, Xiaoyi
    Huang, Jinbin
    Lu, Hua
    Xu, Jianliang
    Li, Yafei
    [J]. ADVANCES IN SPATIAL AND TEMPORAL DATABASES, SSTD 2017, 2017, 10411 : 221 - 241