skip to main content
research-article

Learning Shared Representations for Recommendation with Dynamic Heterogeneous Graph Convolutional Networks

Published:24 February 2023Publication History
Skip Abstract Section

Abstract

Graph Convolutional Networks (GCNs) have been widely used for collaborative filtering, due to their effectiveness in exploiting high-order collaborative signals. However, two issues have not been well addressed by existing studies. First, usually only one kind of information is utilized, i.e., user preference in user-item graphs or item dependency in item-item graphs. Second, they usually adopt static graphs, which cannot retain the temporal evolution of the information. These can limit the recommendation quality. To address these limitations, we propose to mine three kinds of information (user preference, item dependency, and user behavior similarity) and their temporal evolution by constructing multiple discrete dynamic heterogeneous graphs (i.e., a user-item dynamic graph, an item-item dynamic graph, and a user-subseq dynamic graph) from interaction data. A novel network (PDGCN) is proposed to learn the representations of users and items in these dynamic graphs. Moreover, we designed a structural neighbor aggregation module with novel pooling and convolution operations to aggregate the features of structural neighbors. We also design a temporal neighbor aggregation module based on self-attention mechanism to aggregate the features of temporal neighbors. We conduct extensive experiments on four real-world datasets. The results indicate that our approach outperforms several competing methods in terms of Hit Ratio (HR) and Normalized Discounted Cumulative Gain (NDCG). Dynamic graphs are also shown to be effective in improving recommendation performance.

REFERENCES

  1. [1] Alexandridis Georgios, Siolas Georgios, and Stafylopatis Andreas. 2017. Enhancing social collaborative filtering through the application of non-negative matrix factorization and exponential random graph models. Data Mining and Knowledge Discovery 31, 4 (2017), 10311059.Google ScholarGoogle ScholarDigital LibraryDigital Library
  2. [2] Atwood James and Towsley Don. 2016. Diffusion-convolutional neural networks. In Proceedings of theAdvances in Neural Information Processing Systems. 19932001.Google ScholarGoogle Scholar
  3. [3] Bruna Joan, Zaremba Wojciech, Szlam Arthur, and LeCun Yann. 2014. Spectral networks and locally connected networks on graphs. In ICLR(Poster).Google ScholarGoogle Scholar
  4. [4] Chen Lei, Wu Le, Hong Richang, Zhang Kun, and Wang Meng. 2020. Revisiting graph based collaborative filtering: A linear residual graph convolutional network approach. In Proceedings of the AAAI Conference on Artificial Intelligence. AAAI Press, 2734.Google ScholarGoogle ScholarCross RefCross Ref
  5. [5] Deshpande Mukund and Karypis George. 2004. Item-based top-n recommendation algorithms. ACM Transactions on Information Systems 22, 1 (2004), 143177.Google ScholarGoogle ScholarDigital LibraryDigital Library
  6. [6] Dziugaite Gintare Karolina and Roy Daniel M.. 2015. Neural network matrix factorization. arXiv:1511.06443. Retrieved from https://arxiv.org/abs/1511.06443.Google ScholarGoogle Scholar
  7. [7] Gehring Jonas, Auli Michael, Grangier David, Yarats Denis, and Dauphin Yann N.. 2017. Convolutional sequence to sequence learning. In Proceedings of the International Conference on Machine Learning. JMLR.org, 12431252.Google ScholarGoogle Scholar
  8. [8] Georgiev Kostadin and Nakov Preslav. 2013. A non-iid framework for collaborative filtering with restricted boltzmann machines. In Proceedings of the International Conference on Machine Learning. PMLR, 11481156.Google ScholarGoogle Scholar
  9. [9] Gori Marco and Pucci Augusto. 2007. ItemRank: A random-walk based scoring algorithm for recommender engines. In Proceedings of the International Joint Conference on Artificial Intelligence. 27662771.Google ScholarGoogle Scholar
  10. [10] Goyal Palash, Chhetri Sujit Rokka, and Canedo Arquimedes. 2020. dyngraph2vec: Capturing network dynamics using dynamic graph representation learning. Knowledge-Based Systems 187 (2020), 104816.Google ScholarGoogle ScholarCross RefCross Ref
  11. [11] Goyal Palash, Kamra Nitin, He Xinran, and Liu Yan. 2018. DynGEM: Deep embedding method for dynamic graphs. arXiv:1805.11273. Retrieved from https://arxiv.org/abs/1805.11273.Google ScholarGoogle Scholar
  12. [12] Hajiramezanali Ehsan, Hasanzadeh Arman, Narayanan Krishna R., Duffield Nick, Zhou Mingyuan, and Qian Xiaoning. 2019. Variational graph recurrent neural networks. In Proceedings of the Advances in Neural Information Processing Systems. 1070010710.Google ScholarGoogle Scholar
  13. [13] Han Zhen, Chen Peng, Ma Yunpu, and Tresp Volker. 2021. Explainable subgraph reasoning for forecasting on temporal knowledge graphs. In Proceedings of the International Conference on Learning Representations. OpenReview.net.Google ScholarGoogle Scholar
  14. [14] He Xiangnan, Deng Kuan, Wang Xiang, Li Yan, Zhang Yongdong, and Wang Meng. 2020. Lightgcn: Simplifying and powering graph convolution network for recommendation. In Proceedings of the 43rd International ACM SIGIR Conference on Research and Development in Information Retrieval. 639648.Google ScholarGoogle ScholarDigital LibraryDigital Library
  15. [15] He Xiangnan, He Zhankui, Song Jingkuan, Liu Zhenguang, Jiang Yu-Gang, and Chua Tat-Seng. 2018. NAIS: Neural attentive item similarity model for recommendation. IEEE Transactions on Knowledge and Data Engineering 30, 12 (2018), 23542366.Google ScholarGoogle ScholarDigital LibraryDigital Library
  16. [16] He Xiangnan, Liao Lizi, Zhang Hanwang, Nie Liqiang, Hu Xia, and Chua Tat-Seng. 2017. Neural collaborative filtering. In Proceedings of the 26th International Conference on World Wide Web. 173182.Google ScholarGoogle ScholarDigital LibraryDigital Library
  17. [17] Yotam Hechtlinger, Purvasha Chakravarti, and Jining Qin. 2017. A generalization of convolutional neural networks to graph-structured data. arXiv:1704.08165. Retrieved from https://arxiv.org/abs/1704.08165.Google ScholarGoogle Scholar
  18. [18] Henaff Mikael, Bruna Joan, and LeCun Yann. 2015. Deep convolutional networks on graph-structured data. arXiv:1506.05163. Retrieved from https://arxiv.org/abs/1506.05163.Google ScholarGoogle Scholar
  19. [19] Hu Yifan, Koren Yehuda, and Volinsky Chris. 2008. Collaborative filtering for implicit feedback datasets. In Proceedings of the 2008 8th IEEE International Conference on Data Mining. 263272.Google ScholarGoogle ScholarDigital LibraryDigital Library
  20. [20] Kabbur Santosh, Ning Xia, and Karypis George. 2013. Fism: Factored item similarity models for top-n recommender systems. In Proceedings of the 19th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining. ACM, 659667.Google ScholarGoogle ScholarDigital LibraryDigital Library
  21. [21] Diederik P. Kingma and Jimmy Ba. 2015. Adam: A method for stochastic optimization. In ICLR(Poster).Google ScholarGoogle Scholar
  22. [22] Koren Yehuda. 2008. Factorization meets the neighborhood: A multifaceted collaborative filtering model. In Proceedings of the 14th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining. ACM, 426434.Google ScholarGoogle ScholarDigital LibraryDigital Library
  23. [23] Koren Yehuda and Bell Robert. 2015. Advances in collaborative filtering. Recommender Systems Handbook (2015), 77118.Google ScholarGoogle ScholarCross RefCross Ref
  24. [24] Koren Yehuda, Bell Robert, and Volinsky Chris. 2009. Matrix factorization techniques for recommender systems. Computer 42, 8 (2009), 30–37.Google ScholarGoogle ScholarDigital LibraryDigital Library
  25. [25] Li Yangyang, Wang Dong, He Haiyang, Jiao Licheng, and Xue Yu. 2017. Mining intrinsic information by matrix factorization-based approaches for collaborative filtering in recommender systems. Neurocomputing 249 (2017), 4863.Google ScholarGoogle ScholarDigital LibraryDigital Library
  26. [26] Liu Fan, Cheng Zhiyong, Zhu Lei, Gao Zan, and Nie Liqiang. 2021. Interest-aware message-passing GCN for recommendation. In Proceedings of the Web Conference. 12961305.Google ScholarGoogle ScholarDigital LibraryDigital Library
  27. [27] Monti Federico, Bronstein Michael, and Bresson Xavier. 2017. Geometric matrix completion with recurrent multi-graph neural networks. In Proceedings of the Advances in Neural Information Processing Systems. 36973707.Google ScholarGoogle Scholar
  28. [28] Nguyen Thien Huu and Grishman Ralph. 2018. Graph convolutional networks with argument-aware pooling for event detection. In Proceedings of the AAAI Conference on Artificial Intelligence. AAAI Press, 59005907.Google ScholarGoogle ScholarCross RefCross Ref
  29. [29] Qiu Ruihong, Li Jingjing, Huang Zi, and YIn Hongzhi. 2019. Rethinking the item order in session-based recommendation with graph neural networks. In Proceedings of the 28th ACM International Conference on Information and Knowledge Management. 579588.Google ScholarGoogle ScholarDigital LibraryDigital Library
  30. [30] Rendle Steffen, Freudenthaler Christoph, Gantner Zeno, and Schmidt-Thieme Lars. 2009. BPR: Bayesian personalized ranking from implicit feedback. In Proceedings of the 25th Conference on Uncertainty in Artificial Intelligence. 452461.Google ScholarGoogle ScholarDigital LibraryDigital Library
  31. [31] Sankar Aravind, Wu Yanhong, Gou Liang, Zhang Wei, and Yang Hao. 2020. DySAT: Deep neural representation learning on dynamic graphs via self-attention networks. In Proceedings of the 13th International Conference on Web Search and Data Mining. 519527.Google ScholarGoogle ScholarDigital LibraryDigital Library
  32. [32] Sarkar Purnamrita and Moore Andrew W.. 2005. Dynamic social network analysis using latent space models. ACM SIGKDD Explorations Newsletter 7, 2 (Dec.2005), 3140.Google ScholarGoogle ScholarDigital LibraryDigital Library
  33. [33] Simonovsky Martin and Komodakis Nikos. 2017. Dynamic edge-conditioned filters in convolutional neural networks on graphs. In Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition.Google ScholarGoogle ScholarCross RefCross Ref
  34. [34] Joakim Skarding, Bogdan Gabrys, and Katarzyna Musial. 2021. Foundations and modeling of dynamic networks using dynamic graph neural networks: A survey. IEEE Access 9 (2021), 79143–79168.Google ScholarGoogle Scholar
  35. [35] Su Xiaoyuan and Khoshgoftaar Taghi M.. 2009. A survey of collaborative filtering techniques. Advances in Artificial Intelligence 2009 (2009), 421425:1–421425:19.Google ScholarGoogle ScholarDigital LibraryDigital Library
  36. [36] Tay Yi, Tuan Luu Anh, and Hui Siu Cheung. 2018. Latent relational metric learning via memory-based attention for collaborative ranking. In Proceedings of the 2018 World Wide Web Conference. 729739.Google ScholarGoogle ScholarDigital LibraryDigital Library
  37. [37] Vaswani Ashish, Shazeer Noam, Parmar Niki, Uszkoreit Jakob, Jones Llion, Gomez Aidan N., Kaiser undefinedukasz, and Polosukhin Illia. 2017. Attention is all you need. In Proceedings of the Advances in Neural Information Processing Systems. 60006010.Google ScholarGoogle Scholar
  38. [38] Velickovic Petar, Cucurull Guillem, Casanova Arantxa, Romero Adriana, Liò Pietro, and Bengio Yoshua. 2018. Graph attention networks. In Proceedings of the International Conference on Learning Representations.Google ScholarGoogle Scholar
  39. [39] Wang Hao, Wang Naiyan, and Yeung Dit-Yan. 2015. Collaborative Deep Learning for Recommender Systems. 12351244.Google ScholarGoogle Scholar
  40. [40] Wang Xiang, He Xiangnan, Wang Meng, Feng Fuli, and Chua Tat-Seng. 2019. Neural graph collaborative filtering. In Proceedings of the 42nd International ACM SIGIR Conference on Research and Development in Information Retrieval. 165174.Google ScholarGoogle ScholarDigital LibraryDigital Library
  41. [41] Wang Xiang, Jin Hongye, Zhang An, He Xiangnan, Xu Tong, and Chua Tat-Seng. 2020. Disentangled graph collaborative filtering. In Proceedings of the 43rd International ACM SIGIR Conference on Research and Development in Information Retrieval. ACM, 10011010.Google ScholarGoogle ScholarDigital LibraryDigital Library
  42. [42] Wang Xinxi and Wang Ye. 2014. Improving content-based and hybrid music recommendation using deep learning. In Proceedings of the 22nd ACM International Conference on Multimedia. ACM, 627636.Google ScholarGoogle ScholarDigital LibraryDigital Library
  43. [43] Shiwen Wu, Fei Sun, Wentao Zhang, Xu Xie, and Bin Cui. 2022. Graph neural networks in recommender systems: A survey. ACM Comput. Surv. Just Accepted (May 2022).Google ScholarGoogle Scholar
  44. [44] Xu Yanan, Zhu Yanmin, Shen Yanyan, and Yu Jiadi. 2019. Learning shared vertex representation in heterogeneous graphs with convolutional networks for recommendation. In Proceedings of the International Joint Conference on Artificial Intelligence. 46204626.Google ScholarGoogle ScholarCross RefCross Ref
  45. [45] Ying Rex, He Ruining, Chen Kaifeng, Eksombatchai Pong, Hamilton William L., and Leskovec Jure. 2018. Graph convolutional neural networks for web-scale recommender systems. In Proceedings of the 24th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining. 974983.Google ScholarGoogle ScholarDigital LibraryDigital Library
  46. [46] Zhang Jiani, Shi Xingjian, Zhao Shenglin, and King Irwin. 2019. STAR-GCN: Stacked and reconstructed graph convolutional networks for recommender systems. In Proceedings of the International Joint Conference on Artificial Intelligence. ijcai.org, 42644270.Google ScholarGoogle ScholarCross RefCross Ref
  47. [47] Zhang Shuai, Yao Lina, Sun Aixin, and Tay Yi. 2019. Deep learning based recommender system: A survey and new perspectives. CSUR 52, 1 (2019), 138.Google ScholarGoogle ScholarDigital LibraryDigital Library
  48. [48] Zhang Yongfeng, Zhang Min, Zhang Yi, Lai Guokun, Liu Yiqun, Zhang Honghui, and Ma Shaoping. 2015. Daily-aware personalized recommendation based on feature-level time series analysis. In Proceedings of the 24th International Conference on World Wide Web. 13731383.Google ScholarGoogle ScholarDigital LibraryDigital Library
  49. [49] Zhou Huachi, Tan Qiaoyu, Huang Xiao, Zhou Kaixiong, and Wang Xiaoling. 2021. Temporal augmented graph neural networks for session-based recommendations. In Proceedings of the 44th International ACM SIGIR Conference on Research and Development in Information Retrieval. 17981802.Google ScholarGoogle ScholarDigital LibraryDigital Library
  50. [50] Jie Zhou, Ganqu Cui, Shengding Hu, Zhengyan Zhang, Cheng Yang, Zhiyuan Liu, Lifeng Wang, Changcheng Li, and Maosong Sun. 2020. Graph neural networks: A review of methods and applications. AI Open 1 (2020), 57–81.Google ScholarGoogle Scholar
  51. [51] Zhou Le-kui, Yang Yang, Ren Xiang, Wu Fei, and Zhuang Yueting. 2018. Dynamic network embedding by modeling triadic closure process. In Proceedings of the AAAI Conference on Artificial Intelligence. 571578.Google ScholarGoogle ScholarCross RefCross Ref
  52. [52] Zhu Linhong, Guo Dong, Yin Junming, Steeg Greg Ver, and Galstyan Aram. 2016. Scalable temporal latent space inference for link prediction in dynamic social networks. IEEE Transactions on Knowledge and Data Engineering 28, 10 (2016), 27652777.Google ScholarGoogle ScholarDigital LibraryDigital Library
  53. [53] Zhu Yanmin, Jiang Ruobing, Yu Jiadi, Li Zhi, and Li Minglu. 2014. Geographic routing based on predictive locations in vehicular ad hoc networks. EURASIP Journal on Wireless Communications and Networking 2014, 1 (2014), 137. DOI:Google ScholarGoogle ScholarCross RefCross Ref

Index Terms

  1. Learning Shared Representations for Recommendation with Dynamic Heterogeneous Graph Convolutional Networks

    Recommendations

    Comments

    Login options

    Check if you have access through your login credentials or your institution to get full access on this article.

    Sign in

    Full Access

    • Published in

      cover image ACM Transactions on Knowledge Discovery from Data
      ACM Transactions on Knowledge Discovery from Data  Volume 17, Issue 4
      May 2023
      364 pages
      ISSN:1556-4681
      EISSN:1556-472X
      DOI:10.1145/3583065
      Issue’s Table of Contents

      Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected].

      Publisher

      Association for Computing Machinery

      New York, NY, United States

      Publication History

      • Published: 24 February 2023
      • Online AM: 10 October 2022
      • Accepted: 16 September 2022
      • Revised: 27 May 2022
      • Received: 2 September 2021
      Published in tkdd Volume 17, Issue 4

      Permissions

      Request permissions about this article.

      Request Permissions

      Check for updates

      Qualifiers

      • research-article
    • Article Metrics

      • Downloads (Last 12 months)434
      • Downloads (Last 6 weeks)45

      Other Metrics

    PDF Format

    View or Download as a PDF file.

    PDF

    eReader

    View online with eReader.

    eReader

    Full Text

    View this article in Full Text.

    View Full Text

    HTML Format

    View this article in HTML Format .

    View HTML Format