Research article

DyCARS: A dynamic context-aware recommendation system


  • Received: 01 October 2023 Revised: 17 January 2024 Accepted: 29 January 2024 Published: 05 February 2024
  • Dynamic recommendation systems aim to achieve real-time updates and dynamic migration of user interests, primarily utilizing user-item interaction sequences with timestamps to capture the dynamic changes in user interests and item attributes. Recent research has mainly centered on two aspects. First, it involves modeling the dynamic interaction relationships between users and items using dynamic graphs. Second, it focuses on mining their long-term and short-term interaction patterns. This is achieved through the joint learning of static and dynamic embeddings for both users and items. Although most existing methods have achieved some success in modeling the historical interaction sequences between users and items, there is still room for improvement, particularly in terms of modeling the long-term dependency structures of dynamic interaction histories and extracting the most relevant delayed interaction patterns. To address this issue, we proposed a Dynamic Context-Aware Recommendation System for dynamic recommendation. Specifically, our model is built on a dynamic graph and utilizes the static embeddings of recent user-item interactions as dynamic context. Additionally, we constructed a Gated Multi-Layer Perceptron encoder to capture the long-term dependency structure in the dynamic interaction history and extract high-level features. Then, we introduced an Attention Pooling network to learn similarity scores between high-level features in the user-item dynamic interaction history. By calculating bidirectional attention weights, we extracted the most relevant delayed interaction patterns from the historical sequence to predict the dynamic embeddings of users and items. Additionally, we proposed a loss function called the Pairwise Cosine Similarity loss for dynamic recommendation to jointly optimize the static and dynamic embeddings of two types of nodes. Finally, extensive experiments on two real-world datasets, LastFM, and the Global Terrorism Database showed that our model achieves consistent improvements over state-of-the-art baselines.

    Citation: Zhiwen Hou, Fanliang Bu, Yuchen Zhou, Lingbin Bu, Qiming Ma, Yifan Wang, Hanming Zhai, Zhuxuan Han. DyCARS: A dynamic context-aware recommendation system[J]. Mathematical Biosciences and Engineering, 2024, 21(3): 3563-3593. doi: 10.3934/mbe.2024157

    Related Papers:

  • Dynamic recommendation systems aim to achieve real-time updates and dynamic migration of user interests, primarily utilizing user-item interaction sequences with timestamps to capture the dynamic changes in user interests and item attributes. Recent research has mainly centered on two aspects. First, it involves modeling the dynamic interaction relationships between users and items using dynamic graphs. Second, it focuses on mining their long-term and short-term interaction patterns. This is achieved through the joint learning of static and dynamic embeddings for both users and items. Although most existing methods have achieved some success in modeling the historical interaction sequences between users and items, there is still room for improvement, particularly in terms of modeling the long-term dependency structures of dynamic interaction histories and extracting the most relevant delayed interaction patterns. To address this issue, we proposed a Dynamic Context-Aware Recommendation System for dynamic recommendation. Specifically, our model is built on a dynamic graph and utilizes the static embeddings of recent user-item interactions as dynamic context. Additionally, we constructed a Gated Multi-Layer Perceptron encoder to capture the long-term dependency structure in the dynamic interaction history and extract high-level features. Then, we introduced an Attention Pooling network to learn similarity scores between high-level features in the user-item dynamic interaction history. By calculating bidirectional attention weights, we extracted the most relevant delayed interaction patterns from the historical sequence to predict the dynamic embeddings of users and items. Additionally, we proposed a loss function called the Pairwise Cosine Similarity loss for dynamic recommendation to jointly optimize the static and dynamic embeddings of two types of nodes. Finally, extensive experiments on two real-world datasets, LastFM, and the Global Terrorism Database showed that our model achieves consistent improvements over state-of-the-art baselines.



    加载中


    [1] Z. Lin, An empirical investigation of user and system recommendations in e-commerce, Decis. Support Syst., 68 (2014), 111–124. https://doi.org/10.1016/j.dss.2014.10.003 doi: 10.1016/j.dss.2014.10.003
    [2] T. Iba, K. Nemoto, B. Peters, P. A. Gloor, Analyzing the creative editing behavior of wikipedia editors: Through dynamic social network analysis, Proc.-Soc. Behav. Sci., 2 (2010), 6441–6456. https://doi.org/10.1016/j.sbspro.2010.04.054 doi: 10.1016/j.sbspro.2010.04.054
    [3] T. R. Liyanagunawardena, A. A. Adams, S. A. Williams, MOOCs: A systematic study of the published literature 2008–2012, Int. Rev. Res. Open Distrib. Learn., 14 (2013), 202–227. https://doi.org/10.19173/irrodl.v14i3.1455 doi: 10.19173/irrodl.v14i3.1455
    [4] Q. Liu, S. Wu, L. Wang, T. Tan, Predicting the next location: A recurrent model with spatial and temporal contexts, in Thirtieth AAAI Conference on Artificial Intelligence, 30 (2016). https://doi.org/10.1609/aaai.v30i1.9971
    [5] S. Wu, Q. Liu, P. Bai, L. Wang, T. Tan, SAPE: A system for situation-aware public security evaluation, in Thirtieth AAAI Conference on Artificial Intelligence, 30 (2016). https://doi.org/10.1609/aaai.v30i1.9828
    [6] Z. Hou, X. Lv, Y. Zhou, L. Bu, Q. Ma, Y. Wang, A dynamic graph Hawkes process based on linear complexity self-attention for dynamic recommender systems, PeerJ. Comput. Sci., 9 (2023), 1368. https://doi.org/10.7717/peerj-cs.1368 doi: 10.7717/peerj-cs.1368
    [7] Y. Zheng, X. Yi, M. Li, R. Li, Z. Shan, E. Chang, et al., Forecasting fine-grained air quality based on big data, in 21th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, (2015), 2267–2276. https://doi.org/10.1145/2783258.2788573
    [8] X. Wang, X. He, M. Wang, F. Feng, T. Chua, Neural graph collaborative filtering, in 42nd International ACM SIGIR Conference on Research and Development in Information Retrieval, (2019), 165–174. https://doi.org/10.1145/3331184.3331267
    [9] X. He, K. Deng, X. Wang, Yan Li, Y. Zhang, M. Wang, LightGCN: Simplifying and powering graph convolution network for recommendation, in 43rd International ACM SIGIR Conference on Research and Development in Information Retrieval, (2020), 639–648. https://doi.org/10.1145/3397271.3401063
    [10] Y. Koren, R. Bell, C. Volinsky, Matrix factorization techniques for recommender systems, Computer, 42 (2009), 30–37. https://doi.org/10.1109/MC.2009.263 doi: 10.1109/MC.2009.263
    [11] D. Lee, H. S. Seung, Algorithms for non-negative matrix factorization, in 13th International Conference on Neural Information Processing Systems, (2000), 535–541.
    [12] R. Salakhutdinov, A. Mnih, Probabilistic matrix factorization, in 20th International Conference on Neural Information Processing Systems, (2007), 1257–1264.
    [13] S. Raza, C. Ding, Progress in context-aware recommender systems-An overview, Comput. Sci. Rev., 31 (2019), 84–97. https://doi.org/10.1016/j.cosrev.2019.01.001 doi: 10.1016/j.cosrev.2019.01.001
    [14] G. Adomavicius, K. Bauman, A. Tuzhilin, M. Unger, Context-aware recommender systems: From foundations to recent developments, in Recommender Systems Handbook, (2022), 211–250. https://doi.org/10.1007/978-1-0716-2197-4_6
    [15] C. Wu, A. Ahmed, A. Beutel, A. J. Smola, H. Jing, Recurrent recommender networks, in Tenth ACM International Conference on Web Search and Data Mining, (2017), 495–503. https://doi.org/10.1145/3018661.3018689
    [16] S. Kumar, X. Zhang, J. Leskovec, Predicting dynamic embedding trajectory in temporal interaction networks, in 25th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining, (2019), 1269–1278. https://doi.org/10.1145/3292500.3330895
    [17] X. Li, M. Zhang, S. Wu, Z. Liu, L. Wang, P. S. Yu, Dynamic graph collaborative filtering, in 2020 IEEE International Conference on Data Mining, (2020), 322–331. https://doi.org/10.1109/ICDM50108.2020.00041
    [18] Z. Kefato, S. Girdzijauskas, N. Sheikh, A. Montresor, Dynamic embeddings for interaction prediction, in Web Conference 2021, (2021), 1609–1618. https://doi.org/10.1145/3442381.3450020
    [19] S. Wu, F. Sun, W. Zhang, X. Xie, B. Cui, Graph neural networks in recommender systems: A survey, ACM Comput. Surv., 55 (2022), 1–37. https://doi.org/10.1145/3535101 doi: 10.1145/3535101
    [20] P. Covington, J. Adams, E. Sargin, Deep neural networks for YouTube recommendations, in 10th ACM Conference on Recommender Systems, (2016), 191–198. https://doi.org/10.1145/2959100.2959190
    [21] H. Dai, Y. Wang, R. Trivedi, L. Song, Recurrent coevolutionary latent feature processes for continuous-time recommendation, in 1st Workshop on Deep Learning for Recommender Systems, (2016), 29–34. https://doi.org/10.1145/2988450.2988451
    [22] Y. K. Tan, X. Xu, Y. Liu, Improved recurrent neural networks for session-based recommendations, in 1st Workshop on Deep Learning for Recommender Systems, (2016), 17–22. https://doi.org/10.1145/2988450.2988452
    [23] Z. Wang, W. Wei, G. Cong, X. Li, X. Mao, M. Qiu, Global context enhanced graph neural networks for session-based recommendation, in 43rd International ACM SIGIR Conference on Research and Development in Information Retrieval, (2020), 169–178. https://doi.org/10.1145/3397271.3401142
    [24] S. Wu, Y. Tang, Y. Zhu, L. Wang, X. Xie, T. Tan, Session-based recommendation with graph neural networks, in AAAI Technical Track: AI and the Web, 33 (2019), 346–353. https://doi.org/10.1609/aaai.v33i01.3301346
    [25] C. Xu, P. Zhao, Y. Liu, V. S. Sheng, J. Xu, F. Zhuang, Graph contextualized self-attention network for session-based recommendation, in Twenty-Eighth International Joint Conference on Artificial Intelligence, (2019), 3940–3946. https://doi.org/10.24963/ijcai.2019/547
    [26] B. Hidasi, A. Karatzoglou, L. Baltrunas, D. Tikk, Session-based recommendations with recurrent neural networks, preprint, arXiv: 1511.06939.
    [27] J. Li, P. Ren, Z. Chen, Z. Ren, T. Lian, J. Ma, Neural attentive session-based recommendation, in 2017 ACM on Conference on Information and Knowledge Management, (2017), 1419–1428. https://doi.org/10.1145/3132847.3132926
    [28] Q. Liu, S. Wu, D. Wang, Z. Li, L. Wang, Context-aware sequential recommendation, in 2016 IEEE 16th International Conference on Data Mining (ICDM), (2016), 1053–1058. https://doi.org/10.1109/ICDM.2016.0135
    [29] J. You, Y. Wang, A. Pal, P. Eksombatchai, C. Rosenburg, Hierarchical temporal convolutional networks for dynamic recommender systems, in The World Wide Web Conference, (2019), 2236–2246. https://doi.org/10.1145/3308558.3313747
    [30] Y. Wang, N. Du, R. Trivedi, L. Song, Coevolutionary latent feature processes for continuous-time user-item interactions, in 30th Conference on Neural Information Processing Systems, (2016), 1–9.
    [31] Q. Wu, Y. Gao, X. Gao, P. Weng, G. Chen, Dual sequential prediction models linking sequential recommendation and information dissemination, in 25th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining, (2019), 447–457. https://doi.org/10.1145/3292500.3330959
    [32] R. Trivedi, M. Farajtabar, P. Biswal, H. Zha, DyRep: Learning representations over dynamic graphs, in International Conference on Learning Representations 2019 Conference, (2019).
    [33] A. Beutel, P. Covington, S. Jain, C. Xu, J. Li, V. Gatto, et al., Latent cross: Making use of context in recurrent recommender systems, in Eleventh ACM International Conference on Web Search and Data Mining, (2018), 46–54. https://doi.org/10.1145/3159652.3159727
    [34] Y. Zhu, H. Li, Y. Liao, B. Wang, Z. Guan, H. Liu, et al., What to do next: Modeling user behaviors by time-LSTM, in 26th International Joint Conference on Artificial Intelligence, (2017), 3602–3608.
    [35] Y. Zhang, X. Yang, J. Ivy, M. Chi, ATTAIN: Attention-based time-aware LSTM networks for disease progression modeling, in Twenty-Eighth International Joint Conference on Artificial Intelligence, (2019), 4369–4375. https://doi.org/10.24963/ijcai.2019/607
    [36] W. Kang, J. McAuley, Self-attentive sequential recommendation, in 2018 IEEE International Conference on Data Mining, (2018), 197–206. https://doi.org/10.1109/ICDM.2018.00035
    [37] D. Hendrycks, K. Gimpel, Gaussian error linear units (GeLUs), preprint, arXiv: 1606.08415.
    [38] M. Sandler, A. Howard, M. Zhu, A. Zhmoginov, L. Chen, MobileNetV2: Inverted residuals and linear bottlenecks, in 2018 IEEE/CVF Conference on Computer Vision and Pattern Recognition, (2018), 4510–4520. https://doi.org/10.1109/CVPR.2018.00474
    [39] Y. N. Dauphin, A. Fan, M. Auli, D. Grangier, Language modeling with gated convolutional networks, in 34th International Conference on Machine Learning, 70 (2017), 933–941.
    [40] R. K. Srivastava, K. Greff, J. Schmidhuber, Highway networks, preprint, arXiv: 1505.00387.
    [41] S. Hochreiter, J. Schmidhuber, Long Short-Term Memory, Neural Comput., 9 (1997), 1735–1780. https://doi.org/10.1162/neco.1997.9.8.1735 doi: 10.1162/neco.1997.9.8.1735
    [42] J. Hu, L. Shen, G. Sun, Squeeze-and-excitation networks, in 2018 IEEE/CVF Conference on Computer Vision and Pattern Recognition, (2018), 7132–7141. https://doi.org/10.1109/CVPR.2018.00745
    [43] C. Santos, M. Tan, B. Xiang, B. Zhou, Attentive pooling networks, preprint, arXiv: 1602.03609.
    [44] R. Hadsell, S. Chopra, Y. LeCun, Dimensionality reduction by learning an invariant mapping, in 2006 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'06), (2006), 1735–1742. https://doi.org/10.1109/CVPR.2006.100
    [45] S. Yang, W. Yu, Y. Zheng, H. Yao, T. Mei, Adaptive semantic-visual tree for hierarchical embeddings, in 27th ACM International Conference on Multimedia, (2019), 2097–2105. https://doi.org/10.1145/3343031.3350995
    [46] X. He, K. Deng, X. Wang, Y. Li, Y. Zhang, M. Wang, Lightgcn: Simplifying and powering graph convolution network for recommendation, in 43rd International ACM SIGIR Conference on Research and Development in Information Retrieval, (2020), 639–648. https://doi.org/10.1145/3397271.3401063
    [47] C. Hsieh, L. Yang, Y. Cui, T. Lin, S. Belongie, D. Estrin, Collaborative metric learning, in 26th International Conference on World Wide Web, (2017), 193–201. https://doi.org/10.1145/3038912.3052639
    [48] B. Fu, W. Zhang, G. Hu, X. Dai, S. Huang, J. Chen, Dual side deep context-aware modulation for social recommendation, in Web Conference 2021, (2021), 2524–2534. https://doi.org/10.1145/3442381.3449940
    [49] T. Mikolov, I. Sutskever, K. Chen, G. Corrado, J. Dean, Distributed representations of words and phrases and their compositionality, in 26th International Conference on Neural Information Processing Systems, 2 (2013), 3111–3119.
    [50] R. Girshick, J. Donahue, T. Darrell, J. Malik, Rich feature hierarchies for accurate object detection and semantic segmentation, in 2014 IEEE Conference on Computer Vision and Pattern Recognition, (2014), 580–587. https://doi.org/10.1109/CVPR.2014.81
    [51] N. Srivastava, G. Hinton, A. Krizhevsky, I. Sutskever, R. Salakhutdinov, Dropout: A simple way to prevent neural networks from overfitting, J. Mach. Learn. Res., 15 (2014), 1929–1958.
    [52] B. Hidasi, D. Tikk, Fast ALS-based tensor factorization for context-aware recommendation from implicit feedback, in 2012th European Conference on Machine Learning and Knowledge Discovery in Databases, (2012), 67–82.
    [53] X. Glorot, Y. Bengio, Understanding the difficulty of training deep feedforward neural networks, in 13th International Conference on Artificial Intelligence and Statistics (AISTATS) 2010, (2010), 249–256.
    [54] J. Chung, C. Gulcehre, K. Cho, Y. Bengio, Empirical evaluation of gated recurrent neural networks on sequence modeling, preprint, arXiv: 1412.3555.
    [55] A. Vaswani, N. Shazeer, N. Parmar, J. Uszkoreit, L. Jones, A. N. Gomez, et al., Attention is all you need, in 31st International Conference on Neural Information Processing Systems, (2017), 6000–6010.
    [56] T. Silveira, M. Zhang, X. Lin, Y. Liu, S. Ma, How good your recommender system is? A survey on evaluations in recommendation, Int. J. Mach. Learn. Cybern., 10 (2019), 813–831. https://doi.org/10.1007/s13042-017-0762-9 doi: 10.1007/s13042-017-0762-9
  • Reader Comments
  • © 2024 the Author(s), licensee AIMS Press. This is an open access article distributed under the terms of the Creative Commons Attribution License (http://creativecommons.org/licenses/by/4.0)
通讯作者: 陈斌, bchen63@163.com
  • 1. 

    沈阳化工大学材料科学与工程学院 沈阳 110142

  1. 本站搜索
  2. 百度学术搜索
  3. 万方数据库搜索
  4. CNKI搜索

Metrics

Article views(1118) PDF downloads(76) Cited by(1)

Article outline

Figures and Tables

Figures(7)  /  Tables(10)

/

DownLoad:  Full-Size Img  PowerPoint
Return
Return

Catalog