Combination of individual and group patterns for time-sensitive purchase recommendation

被引:0
|
作者
Lysenko, Anton [1 ]
Shikov, Egor [1 ]
Bochenina, Klavdiya [1 ]
机构
[1] ITMO Univ, 49 Kronverkskiy Prospect, St Petersburg, Russia
基金
俄罗斯科学基金会;
关键词
Point processes; Transactional data; Mixture models; Recommendation; Machine learning;
D O I
10.1007/s41060-020-00233-1
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Due to the availability of large amounts of data, recommender systems have quickly gained popularity in the banking sphere. However, time-sensitive recommender systems, which take into account the temporal behavior and the recurrent activities of users to predict the expected time and category of next purchase, are still an active field of research. Many researchers tend to use population-level features or their low-rank approximations because the client's purchase history is very sparse with few observations for some time intervals and product categories. But such approaches inevitably lead to a loss of accuracy. In this paper, we present a generative model of client spending based on the temporal point processes framework. The model is built in the way, to bring more individuality for the clients' purchase behavior which takes into account individual purchase histories of clients. We also tackle the problem of poor statistics for people with a low transactional activity using effective intensity function parameterizations, and several other techniques such as smoothing daily intensity levels and taking into account population-level purchase rates for clients with a small number of transactions. The model is highly interpretable, and its training time scales linearly to millions of transactions and cubically to hundreds of thousands of users. Different temporal-process models were tested, and our model with all the incorporated modifications has shown the best results in terms of both error of time prediction and the accuracy of category prediction.
引用
收藏
页码:163 / 172
页数:10
相关论文
共 50 条
  • [31] Weighted Scheduling of Time-Sensitive Coflows
    Brun, Olivier
    El-Azouzi, Rachid
    Luu, Quang-Trung
    De Pellegrini, Francesco
    Prabhu, Balakrishna J.
    Richier, Cedric
    IEEE TRANSACTIONS ON CLOUD COMPUTING, 2024, 12 (02) : 644 - 658
  • [32] Satisficing in Time-Sensitive Bandit Learning
    Russo, Daniel
    Van Roy, Benjamin
    MATHEMATICS OF OPERATIONS RESEARCH, 2022, 47 (04) : 2815 - 2839
  • [33] Modeling Time-Sensitive Swarm Dynamics
    Sasaki, Hideyasu
    2017 IEEE SYMPOSIUM SERIES ON COMPUTATIONAL INTELLIGENCE (SSCI), 2017,
  • [34] Time-sensitive sampling for spam filtering
    Fu, CL
    Silver, D
    ADVANCES IN ARTIFICIAL INTELLIGENCE, 2004, 3060 : 551 - 553
  • [35] Guest Editorial: Time-Sensitive Networking
    Parsons, Glenn
    Seufert, Michael
    Hantel, Mark
    IEEE Communications Standards Magazine, 2022, 6 (04):
  • [36] Scheduling time-sensitive IP traffic
    Sousa, P
    Carvalho, P
    Freitas, V
    MANAGEMENT OF MULTIMEDIA NETWORKS AND SERVICES, PROCEEDINGS, 2003, 2839 : 368 - 380
  • [37] Medical Marriages: Time-Sensitive Bliss
    Warner, Mary E.
    Warner, Nafisseh S.
    Warner, Lindsay L.
    MAYO CLINIC PROCEEDINGS, 2013, 88 (03) : 213 - 215
  • [38] Disseminate time-sensitive research faster
    Stanbrook, Matthew B.
    Hebert, Paul C.
    CANADIAN MEDICAL ASSOCIATION JOURNAL, 2010, 182 (01) : 9 - 9
  • [39] Time-Sensitive Opinion Mining for Prediction
    Tu, Wenting
    Cheung, David
    Mamoulis, Nikos
    PROCEEDINGS OF THE TWENTY-NINTH AAAI CONFERENCE ON ARTIFICIAL INTELLIGENCE, 2015, : 4214 - 4215
  • [40] Time-sensitive neophobic responses to risk
    Ferrari, Maud C. O.
    Brown, Grant E.
    Chivers, Douglas P.
    BEHAVIOUR, 2015, 152 (12-13) : 1623 - 1635