Lightweight GCN Recommendation Combining Adaptive Period and Interest Factor
Author:
Affiliation:

Clc Number:

TP311

  • Article
  • | |
  • Metrics
  • |
  • Reference [38]
  • |
  • Related [20]
  • | | |
  • Comments
    Abstract:

    Driven by mature data mining technologies, the recommendation system has been able to efficiently utilize explicit and implicit information such as score data and behavior traces and then combine the information with complex and advanced deep learning technologies to achieve sound results. Meanwhile, its application requirements also drive the in-depth mining and utilization of basic data and the load reduction of technical requirements to become research hotspots. On this basis, a lightweight recommendation model, namely LG_APIF is proposed, which uses the graph convolutional network (GCN) method to deeply integrate information. According to behavior memory, the model employs Ebbinghaus forgetting curve to simulate the users’ interest change process and adopts linear regression and other relatively lightweight traditional methods to mine adaptive periods and other depth information of items. In addition, it analyzes users’ current interest distribution and calculates the interest value of the item to obtain users’ potential interest type. It further constructs the graph structure of the user-type-item triplet and uses GCN technology after load reduction to generate the final item recommendation list. The experiments have verified the effectiveness of the proposed method. Through the comparison with eight classical models on the datasets of Last.fm, Douban, Yelp, and MovieLens, it is found that the Precision, Recall, and NDCG of the proposed method are improved, with an average improvement of 2.11% on Precision, 1.01% on Recall, and 1.48% on NDCG, respectively.

    Reference
    [1] Al-Shamri MYH. Power coefficient as a similarity measure for memory based collaborative recommender systems. Expert Systems with Applications, 2014, 41(13): 5680–5688. [doi: 10.1016/j.eswa.2014.03.025]
    [2] 冯永, 张备, 强保华, 张逸扬, 尚家兴. MN-HDRM: 长短兴趣多神经网络混合动态推荐模型. 计算机学报, 2019, 42(1): 16–28. [doi: 10.11897/SP.J.1016.2019.00016]
    Feng Y, Zhang B, Qiang BH, Zhang YY, Shang JX. MN-HDRM: A novel hybrid dynamic recommendation model based on long-short-term interests multiple neural networks. Chinese Journal of Computers, 2019, 42(1): 16–28 (in Chinese with English abstract). [doi: 10.11897/SP.J.1016.2019.00016]
    [3] Wang X, He XN, Wang M, Feng F, Chua TS. Neural graph collaborative filtering. In: Proc. of the 42nd Int’l ACM SIGIR Conf. on Research and Development in Information Retrieval. Paris: ACM, 2019. 165–174.
    [4] He XN, Deng K, Wang X, Li Y, Zhang YD, Wang M. LightGCN: Simplifying and powering graph convolution network for recommendation. In: Proc. of the 43rd Int’l ACM SIGIR Conf. on Research and Development in Information Retrieval. ACM, 2020. 639–648.
    [5] Li QM, Han ZC, Wu XM. Deeper insights into graph convolutional networks for semi-supervised learning. In: Proc. of the 32nd AAAI Conf. on Artificial Intelligence and the 30th Innovative Applications of Artificial Intelligence Conf. and the 8th AAAI Symp. on Educational Advances in Artificial Intelligence. New Orleans: AAAI, 2018. 3538–3545.
    [6] Garg D, Gupta P, Malhotra P, Vig L, Shroff G. Sequence and time aware neighborhood for session-based recommendations: Stan. In: Proc. of the 42nd Int’l ACM SIGIR Conf. on Research and Development in Information Retrieval. Paris: ACM, 2019. 1069–1072.
    [7] 徐晓, 丁世飞, 丁玲. 密度峰值聚类算法研究进展. 软件学报, 2022, 33(5): 1800–1816. http://www.jos.org.cn/1000-9825/6122.htm
    Xu X, Ding SF, Ding L. Survey on density peaks clustering algorithm. Ruan Jian Xue Bao/Journal of Software, 2022, 33(5): 1800–1816 (in Chinese with English abstract). http://www.jos.org.cn/1000-9825/6122.htm
    [8] Ferdaous H, Bouchra F, Brahim O, Imad-Eddine M, Asmaa B. Recommendation using a clustering algorithm based on a hybrid features selection method. Journal of Intelligent Information Systems, 2018, 51(1): 183–205. [doi: 10.1007/s10844-017-0493-0]
    [9] Tey FJ, Wu TY, Lin CL, Chen JL. Accuracy improvements for cold-start recommendation problem using indirect relations in social networks. Journal of Big Data, 2021, 8(1): 98. [doi: 10.1186/s40537-021-00484-0]
    [10] 王俊, 李石君, 杨莎, 金红, 余伟. 一种新的用于跨领域推荐的迁移学习模型. 计算机学报, 2017, 40(10): 2367–2380. [doi: 10.11897/SP.J.1016.2017.02367]
    Wang J, Li SJ, Yang S, Jin H, Yu W. A new transfer learning model for cross-domain recommendation. Chinese Journal of Computers, 2017, 40(10): 2367–2380 (in Chinese with English abstract). [doi: 10.11897/SP.J.1016.2017.02367]
    [11] Xu CH, Ding AS, Zhao KD. A novel POI recommendation method based on trust relationship and spatial-temporal factors. Electronic Commerce Research and Applications, 2021, 48: 101060. [doi: 10.1016/j.elerap.2021.101060]
    [12] He XN, Zhang HW, Kan MY, Chua TS. Fast matrix factorization for online recommendation with implicit feedback. In: Proc. of the 39th Int’l ACM SIGIR Conf. on Research and Development in Information Retrieval. Pisa: ACM, 2016. 549–558.
    [13] 刘兴波, 聂秀山, 尹义龙. 基于双向线性回归的监督离散跨模态散列方法. 计算机研究与发展, 2020, 57(8): 1707–1714. [doi: 10.7544/issn1000-1239.2020.20200122]
    Liu XB, Nie XS, Yin YL. Mutual linear regression based supervised discrete cross-modal hashing. Journal of Computer Research and Development, 2020, 57(8): 1707–1714 (in Chinese with English abstract). [doi: 10.7544/issn1000-1239.2020.20200122]
    [14] Zhao N, Long Z, Wang J, Zhao ZD. AGRE: A knowledge graph recommendation algorithm based on multiple paths embeddings RNN encoder. Knowledge-Based Systems, 2023, 259: 110078. [doi: 10.1016/j.knosys.2022.110078]
    [15] 郑烨, 施晓牧, 刘嘉祥. 基于多路径回溯的神经网络验证方法. 软件学报, 2022, 33(7): 2464–2481. http://www.jos.org.cn/1000-9825/6585.htm
    Zheng Y, Shi XM, Liu JX. Multi-path back-propagation method for neural network verification. Ruan Jian Xue Bao/Journal of Software, 2022, 33(7): 2464–2481 (in Chinese with English abstract). http://www.jos.org.cn/1000-9825/6585.htm
    [16] Yu F, Liu Q, Wu S, Wang L, Tan TN. A dynamic recurrent model for next basket recommendation. In: Proc. of the 39th Int’l ACM SIGIR Conf. on Research and Development in Information Retrieval. Pisa: ACM, 2016. 729–732.
    [17] Perozzi B, Al-Rfou R, Skiena S. DeepWalk: Online learning of social representations. In: Proc. of the 20th ACM SIGKDD Int’l Conf. on Knowledge Discovery and Data Mining. New York: ACM, 2014. 701–710.
    [18] Wu L, Li JW, Sun PJ, Hong RC, Ge Y, Wang M. DiffNet++: A neural influence and interest diffusion network for social recommendation. IEEE Transactions on Knowledge and Data Engineering, 2022, 34(10): 4753–4766. [doi: 10.1109/TKDE.2020.3048414]
    [19] Wu F, Zhang TY, de Souza Jr AH, Fifty C, Yu T, Weinberger KQ. Simplifying graph convolutional networks. In: Proc. of the 36th Int’l Conf. on Machine Learning. Long Beach: PMLR, 2019. 6861–6871.
    [20] Yu JL, Yin HZ, Li JD, Wang QY, Hung NQV, Zhang XL. Self-supervised multi-channel hypergraph convolutional network for social recommendation. In: Proc. of the 2021 Web Conf. Ljubljana: ACM, 2021. 413–424.
    [21] Yu JL, Yin HZ, Gao M, Xia X, Zhang XL, Hung NQV. Socially-aware self-supervised tri-training for recommendation. In: Proc. of the 27th ACM SIGKDD Conf. on Knowledge Discovery & Data Mining. Singapore: ACM, 2021. 2084–2092.
    [22] 梁艺伟. 基于遗忘曲线的英语绘本阅读推荐系统的设计与实现 [硕士学位论文]. 北京: 北京交通大学, 2019.
    Liang YW. Design and implementation of English picture book reading recommendation system based on forgetting curve [MS. Thesis]. Beijing: Beijing Jiaotong University, 2019 (in Chinese with English abstract).
    [23] 石乐昊, 寇月, 申德荣, 聂铁铮, 李冬. 面向HIN基于多视角嵌入融合的推荐方法. 软件学报, 2022, 33(10): 3619–3634. http://www.jos.org.cn/1000-9825/6632.htm
    Shi LH, Kou Y, Shen DR, Nie TZ, Li D. Recommendation method based on multi-view embedding fusion for HINs. Ruan Jian Xue Bao/Journal of Software, 2022, 33(10): 3619–3634 (in Chinese with English abstract). http://www.jos.org.cn/1000-9825/6632.htm
    [24] 刘琳岚, 谭镇阳, 舒坚. 基于图神经网络的机会网络节点重要度评估方法. 计算机研究与发展, 2022, 59(4): 834–851. [doi: 10.7544/issn1000-1239.20200673]
    Liu LL, Tan ZY, Shu J. Node importance estimation method for opportunistic network based on graph neural networks. Journal of Computer Research and Development, 2022, 59(4): 834–851 (in Chinese with English abstract). [doi: 10.7544/issn1000-1239.20200673]
    [25] Peng L, Hu RY, Kong F, Gan JZ, Mo YJ, Shi XS, Zhu XF. Reverse graph learning for graph neural network. IEEE Trans. on Neural Networks and Learning Systems, 2022.
    [26] Wu L, Sun PJ, Fu YJ, Hong RC, Wang XT, Wang M. A neural influence diffusion model for social recommendation. In: Proc. of the 42nd Int’l ACM SIGIR Conf. on Research and Development in Information Retrieval. Pairs: ACM, 2019. 235–244.
    [27] Rendle S, Freudenthaler C, Gantner Z, Schmidt-Thieme L. BPR: Bayesian personalized ranking from implicit feedback. In: Proc. of the 25th Int’l Conf. on Uncertainty in Artificial Intelligence. Montreal: AUAI Press, 2009. 452–461.
    [28] Ji SY, Feng YF, Ji RR, Zhao XB, Tang WW, Gao Y. Dual channel hypergraph collaborative filtering. In: Proc. of the 26th ACM SIGKDD Int’l Conf. on Knowledge Discovery & Data Mining. San Diego: ACM, 2020. 2020–2029.
    [29] Guo HF, Tang RM, Ye YM, Li ZG, He XQ. DeepFM: A factorization-machine based neural network for CTR prediction. arXiv:1703.04247, 2017.
    [30] Chen JW, Wang C, Zhou S, Shi QH, Chen JB, Feng Y, Chen C. Fast adaptively weighted matrix factorization for recommendation with implicit feedback. Proceedings of the AAAI Conference on Artificial Intelligence, 2020, 34(4): 3470–3477.
    Cited by
    Comments
    Comments
    分享到微博
    Submit
Get Citation

钱忠胜,叶祖铼,姚昌森,张丁,黄恒,秦朗悦.融合自适应周期与兴趣量因子的轻量级GCN推荐.软件学报,2024,35(6):2974-2998

Copy
Share
Article Metrics
  • Abstract:502
  • PDF: 1678
  • HTML: 795
  • Cited by: 0
History
  • Received:June 18,2022
  • Revised:October 27,2022
  • Online: August 09,2023
  • Published: June 06,2024
You are the first2044815Visitors
Copyright: Institute of Software, Chinese Academy of Sciences Beijing ICP No. 05046678-4
Address:4# South Fourth Street, Zhong Guan Cun, Beijing 100190,Postal Code:100190
Phone:010-62562563 Fax:010-62562533 Email:jos@iscas.ac.cn
Technical Support:Beijing Qinyun Technology Development Co., Ltd.

Beijing Public Network Security No. 11040202500063