Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
169 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
45 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

MGDCF: Distance Learning via Markov Graph Diffusion for Neural Collaborative Filtering (2204.02338v2)

Published 5 Apr 2022 in cs.SI and cs.LG

Abstract: Graph Neural Networks (GNNs) have recently been utilized to build Collaborative Filtering (CF) models to predict user preferences based on historical user-item interactions. However, there is relatively little understanding of how GNN-based CF models relate to some traditional Network Representation Learning (NRL) approaches. In this paper, we show the equivalence between some state-of-the-art GNN-based CF models and a traditional 1-layer NRL model based on context encoding. Based on a Markov process that trades off two types of distances, we present Markov Graph Diffusion Collaborative Filtering (MGDCF) to generalize some state-of-the-art GNN-based CF models. Instead of considering the GNN as a trainable black box that propagates learnable user/item vertex embeddings, we treat GNNs as an untrainable Markov process that can construct constant context features of vertices for a traditional NRL model that encodes context features with a fully-connected layer. Such simplification can help us to better understand how GNNs benefit CF models. Especially, it helps us realize that ranking losses play crucial roles in GNN-based CF tasks. With our proposed simple yet powerful ranking loss InfoBPR, the NRL model can still perform well without the context features constructed by GNNs. We conduct experiments to perform detailed analysis on MGDCF.

Definition Search Book Streamline Icon: https://streamlinehq.com
References (41)
  1. R. Ying, R. He, K. Chen, P. Eksombatchai, W. L. Hamilton, and J. Leskovec, “Graph convolutional neural networks for web-scale recommender systems,” in ACM SIGKDD.   ACM, 2018, pp. 974–983.
  2. Z. Yang, M. Ding, X. Zou, J. Tang, B. Xu, C. Zhou, and H. Yang, “Region or global a principle for negative sampling in graph-based recommendation,” IEEE Transactions on Knowledge and Data Engineering, pp. 1–1, 2022.
  3. A. Li, B. Yang, H. Huo, H. Chen, G. Xu, and Z. Wang, “Hyperbolic neural collaborative recommender,” IEEE Transactions on Knowledge and Data Engineering, pp. 1–12, 2022.
  4. J. Chen, X. Xin, X. Liang, X. He, and J. Liu, “Gdsrec: Graph-based decentralized collaborative filtering for social recommendation,” IEEE Transactions on Knowledge and Data Engineering, pp. 1–1, 2022.
  5. N. Li, C. Gao, D. Jin, and Q. Liao, “Disentangled modeling of social homophily and influence for social recommendation,” IEEE Transactions on Knowledge and Data Engineering, pp. 1–14, 2022.
  6. R. A. Pugoy and H.-Y. Kao, “Near: Non-supervised explainability architecture for accurate review-based collaborative filtering,” IEEE Transactions on Knowledge and Data Engineering, pp. 1–16, 2022.
  7. H. Ji, J. Zhu, C. Shi, X. Wang, B. Wang, C. Zhang, Z. Zhu, F. Zhang, and Y. Li, “Large-scale comb-k recommendation,” in WWW.   ACM / IW3C2, 2021, pp. 2512–2523.
  8. Y. Wei, X. Wang, L. Nie, X. He, R. Hong, and T. Chua, “MMGCN: multi-modal graph convolution network for personalized recommendation of micro-video,” in ACM MM.   ACM, 2019, pp. 1437–1445.
  9. Y. Wei, X. Wang, L. Nie, X. He, and T. Chua, “Graph-refined convolutional network for multimedia recommendation with implicit feedback,” in ACM MM.   ACM, 2020, pp. 3541–3549.
  10. B. Perozzi, R. Al-Rfou, and S. Skiena, “Deepwalk: online learning of social representations,” in The 20th ACM SIGKDD.   ACM, 2014, pp. 701–710.
  11. Y. Koren, R. M. Bell, and C. Volinsky, “Matrix factorization techniques for recommender systems,” Computer, vol. 42, no. 8, pp. 30–37, 2009.
  12. K. Xu, C. Li, Y. Tian, T. Sonobe, K. Kawarabayashi, and S. Jegelka, “Representation learning on graphs with jumping knowledge networks,” in ICML 2018, ser. PMLR, vol. 80.   PMLR, 2018, pp. 5449–5458.
  13. Y. Rong, W. Huang, T. Xu, and J. Huang, “Dropedge: Towards deep graph convolutional networks on node classification,” in ICLR.   OpenReview.net, 2020.
  14. J. Klicpera, A. Bojchevski, and S. Günnemann, “Predict then propagate: Graph neural networks meet personalized pagerank,” in ICLR.   OpenReview.net, 2019.
  15. H. Zhu and P. Koniusz, “Simple spectral graph convolution,” in ICLR.   OpenReview.net, 2021.
  16. X. He, K. Deng, X. Wang, Y. Li, Y. Zhang, and M. Wang, “Lightgcn: Simplifying and powering graph convolution network for recommendation,” in ACM SIGIR.   ACM, 2020, pp. 639–648.
  17. S. Cao, W. Lu, and Q. Xu, “Deep neural networks for learning graph representations,” in AAAI.   AAAI Press, 2016, pp. 1145–1152.
  18. J. Tang, M. Qu, M. Wang, M. Zhang, J. Yan, and Q. Mei, “LINE: large-scale information network embedding,” in ACM WWW.   ACM, 2015, pp. 1067–1077.
  19. S. Cao, W. Lu, and Q. Xu, “Grarep: Learning graph representations with global structural information,” in ACM CIKM.   ACM, 2015, pp. 891–900.
  20. V. Klema and A. Laub, “The singular value decomposition: Its computation and some applications,” IEEE Transactions on automatic control, vol. 25, no. 2, pp. 164–176, 1980.
  21. T. N. Kipf and M. Welling, “Semi-supervised classification with graph convolutional networks,” in ICLR.   OpenReview.net, 2017.
  22. P. Velickovic, G. Cucurull, A. Casanova, A. Romero, P. Liò, and Y. Bengio, “Graph attention networks,” in ICLR.   OpenReview.net, 2018.
  23. W. L. Hamilton, Z. Ying, and J. Leskovec, “Inductive representation learning on large graphs,” in NeurIPS, 2017, pp. 1024–1034.
  24. W. Huang, Y. Rong, T. Xu, F. Sun, and J. Huang, “Tackling over-smoothing for general graph convolutional networks,” arXiv preprint arXiv:2008.09864, 2020.
  25. D. Chen, Y. Lin, W. Li, P. Li, J. Zhou, and X. Sun, “Measuring and relieving the over-smoothing problem for graph neural networks from the topological view,” in AAAI.   AAAI Press, 2020, pp. 3438–3445.
  26. J. Klicpera, S. Weißenberger, and S. Günnemann, “Diffusion improves graph learning,” in NeurIPS, 2019, pp. 13 333–13 345.
  27. L. Page, S. Brin, R. Motwani, and T. Winograd, “The pagerank citation ranking : Bringing order to the web,” in WWW 1999, 1999.
  28. X. Ning and G. Karypis, “SLIM: sparse linear methods for top-n recommender systems,” in IEEE ICDM.   IEEE Computer Society, 2011, pp. 497–506.
  29. D. Liang, R. G. Krishnan, M. D. Hoffman, and T. Jebara, “Variational autoencoders for collaborative filtering,” in ACM WWW.   ACM, 2018, pp. 689–698.
  30. X. He, L. Liao, H. Zhang, L. Nie, X. Hu, and T. Chua, “Neural collaborative filtering,” in ACM WWW.   ACM, 2017, pp. 173–182.
  31. S. Rendle, W. Krichene, L. Zhang, and J. R. Anderson, “Neural collaborative filtering vs. matrix factorization revisited,” in ACM RecSys.   ACM, 2020, pp. 240–248.
  32. R. van den Berg, T. N. Kipf, and M. Welling, “Graph convolutional matrix completion,” arXiv preprint arXiv:1706.02263, 2017.
  33. X. Wang, X. He, M. Wang, F. Feng, and T. Chua, “Neural graph collaborative filtering,” in ACM SIGIR.   ACM, 2019, pp. 165–174.
  34. J. Wu, X. Wang, F. Feng, X. He, L. Chen, J. Lian, and X. Xie, “Self-supervised graph learning for recommendation,” in ACM SIGIR.   ACM, 2021, pp. 726–735.
  35. K. Mao, J. Zhu, X. Xiao, B. Lu, Z. Wang, and X. He, “Ultragcn: Ultra simplification of graph convolutional networks for recommendation,” in ACM CIKM.   ACM, 2021, pp. 1253–1262.
  36. S. Rendle, C. Freudenthaler, Z. Gantner, and L. Schmidt-Thieme, “BPR: bayesian personalized ranking from implicit feedback,” in UAI.   AUAI Press, 2009, pp. 452–461.
  37. D. Zhou, O. Bousquet, T. N. Lal, J. Weston, and B. Schölkopf, “Learning with local and global consistency,” in NeurIPS.   MIT Press, 2003, pp. 321–328.
  38. L. Yao, C. Mao, and Y. Luo, “Graph convolutional networks for text classification,” in AAAI.   AAAI Press, 2019, pp. 7370–7377.
  39. A. van den Oord, Y. Li, and O. Vinyals, “Representation learning with contrastive predictive coding,” arXiv preprint arXiv:1807.03748, 2018.
  40. B. Poole, S. Ozair, A. van den Oord, A. Alemi, and G. Tucker, “On variational bounds of mutual information,” in ICML, ser. PMLR, vol. 97.   PMLR, 2019, pp. 5171–5180.
  41. J. Hu, S. Qian, Q. Fang, Y. Wang, Q. Zhao, H. Zhang, and C. Xu, “Efficient graph deep learning in tensorflow with tf_geometric,” in ACM MM.   ACM, 2021, pp. 3775–3778.
Citations (14)
View on Semantic Scholar

Summary

We haven't generated a summary for this paper yet.

Ai Sparkles Streamline Icon: https://streamlinehq.com Summarize Now
Github Logo Streamline Icon: https://streamlinehq.com

GitHub

  1. GitHub - hujunxianligong/MGDCF (4 stars)