Papers
Topics
Authors
Recent
2000 character limit reached

Knowledge Graph Self-Supervised Rationalization for Recommendation (2307.02759v1)

Published 6 Jul 2023 in cs.IR and cs.AI

Abstract: In this paper, we introduce a new self-supervised rationalization method, called KGRec, for knowledge-aware recommender systems. To effectively identify informative knowledge connections, we propose an attentive knowledge rationalization mechanism that generates rational scores for knowledge triplets. With these scores, KGRec integrates generative and contrastive self-supervised tasks for recommendation through rational masking. To highlight rationales in the knowledge graph, we design a novel generative task in the form of masking-reconstructing. By masking important knowledge with high rational scores, KGRec is trained to rebuild and highlight useful knowledge connections that serve as rationales. To further rationalize the effect of collaborative interactions on knowledge graph learning, we introduce a contrastive learning task that aligns signals from knowledge and user-item interaction views. To ensure noise-resistant contrasting, potential noisy edges in both graphs judged by the rational scores are masked. Extensive experiments on three real-world datasets demonstrate that KGRec outperforms state-of-the-art methods. We also provide the implementation codes for our approach at https://github.com/HKUDS/KGRec.

Definition Search Book Streamline Icon: https://streamlinehq.com
References (52)
  1. Graph convolutional matrix completion. arXiv preprint arXiv:1706.02263 (2017).
  2. Unifying knowledge graph learning and recommendation: Towards a better understanding of user preferences. In The Web Conference (WWW). 151–161.
  3. Attentive collaborative filtering: Multimedia recommendation with item-and component-level attention. In International Conference on Research and Development in Information Retrieval (SIGIR). 335–344.
  4. Masked Autoencoders As Spatiotemporal Learners. arXiv preprint arXiv:2205.09113 (2022).
  5. Michael Gutmann and Aapo Hyvärinen. 2010. Noise-contrastive estimation: A new estimation principle for unnormalized statistical models. In International Conference on Artificial Intelligence and Statistics (AISTATS). 297–304.
  6. Masked autoencoders are scalable vision learners. In IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR). 16000–16009.
  7. Xiangnan He and Tat-Seng Chua. 2017. Neural factorization machines for sparse predictive analytics. In International Conference on Research and Development in Information Retrieval (SIGIR). 355–364.
  8. Lightgcn: Simplifying and powering graph convolution network for recommendation. In International Conference on Research and Development in Information Retrieval (SIGIR). 639–648.
  9. Neural collaborative filtering. In The Web Conference (WWW). 173–182.
  10. Leveraging meta-path based context for top-n recommendation with a neural co-attention model. In International Conference on Knowledge Discovery & Data Mining (KDD). 1531–1540.
  11. Heterogeneous graph transformer. In The Web Conference (WWW). 2704–2710.
  12. Stochastic client selection for federated learning with volatile clients. IEEE Internet of Things Journal (2022).
  13. Categorical Reparametrization with Gumble-Softmax. In International Conference on Learning Representations (ICLR).
  14. Supervised contrastive learning. (2020), 18661–18673.
  15. Rating-based collaborative filtering: algorithms and evaluation. Social information access: Systems and technologies (2018), 344–390.
  16. Graph Transformer for Recommendation. arXiv preprint arXiv:2306.02330 (2023).
  17. Federated optimization in heterogeneous networks. Proceedings of Machine Learning and Systems 2 (2020), 429–450.
  18. Scaling Language-Image Pre-training via Masking. arXiv preprint arXiv:2212.00794 (2022).
  19. Variational autoencoders for collaborative filtering. In The Web Conference (WWW). 689–698.
  20. Learning entity and relation embeddings for knowledge graph completion. In AAAI Conference on Artificial Intelligence (AAAI).
  21. K-bert: Enabling language representation with knowledge graph. In AAAI Conference on Artificial Intelligence (AAAI). 2901–2908.
  22. BPR: Bayesian personalized ranking from implicit feedback. In International Conference on Uncertainty in Artificial Intelligence (UAI). 452–461.
  23. Baoxu Shi and Tim Weninger. 2018. Open-world knowledge graph completion. In AAAI Conference on Artificial Intelligence (AAAI).
  24. BERT4Rec: Sequential recommendation with bidirectional encoder representations from transformer. In International Conference on Information and Knowledge Management (CIKM). 1441–1450.
  25. RotatE: Knowledge Graph Embedding by Relational Rotation in Complex Space. In International Conference on Learning Representations (ICLR).
  26. Joint knowledge pruning and recurrent graph convolution for news recommendation. In International Conference on Research and Development in Information Retrieval (SIGIR). 51–60.
  27. DKN: Deep knowledge-aware network for news recommendation. In The Web Conference (WWW). 1835–1844.
  28. Knowledge-aware graph neural networks with label smoothness regularization for recommender systems. In International Conference on Knowledge Discovery & Data Mining (KDD). 968–977.
  29. Multi-task feature learning for knowledge graph enhanced recommendation. In ACM Web Conference (WWW). 2000–2010.
  30. Knowledge graph convolutional networks for recommender systems. In The Web Conference (WWW). 3307–3313.
  31. Swift and Sure: Hardness-aware Contrastive Learning for Low-dimensional Knowledge Graph Embeddings. In The Web Conference (WWW). 838–849.
  32. Tongzhou Wang and Phillip Isola. 2020. Understanding contrastive representation learning through alignment and uniformity on the hypersphere. In International Conference on Machine Learning (ICML). 9929–9939.
  33. Kgat: Knowledge graph attention network for recommendation. In International Conference on Knowledge Discovery & Data Mining (KDD). 950–958.
  34. Neural graph collaborative filtering. In International Conference on Research and Development in Information Retrieval (SIGIR). 165–174.
  35. Learning intents behind interactions with knowledge graph for recommendation. In The Web Conference (WWW). 878–887.
  36. Explainable reasoning over knowledge graphs for recommendation. In AAAI Conference on Artificial Intelligence (AAAI), Vol. 33. 5329–5336.
  37. Knowledge graph embedding by translating on hyperplanes. In AAAI Conference on Artificial Intelligence (AAAI).
  38. Multi-Modal Self-Supervised Learning for Recommendation. In The Web Conference (WWW). 790–800.
  39. Self-supervised graph learning for recommendation. In International Conference on Research and Development in Information Retrieval (SIGIR). 726–735.
  40. Automated Self-Supervised Learning for Recommendation. In ACM Web Conference (WWW). 992–1002.
  41. Graph-less Collaborative Filtering. In ACM Web Conference (WWW). 17–27.
  42. TransA: An adaptive approach for knowledge graph embedding. arXiv preprint arXiv:1509.05490 (2015).
  43. Debiased Contrastive Learning for Sequential Recommendation. In The Web Conference (WWW). 1063–1073.
  44. Knowledge Graph Contrastive Learning for Recommendation. In International Conference on Research and Development in Information Retrieval (SIGIR). 1434–1443.
  45. Self-supervised learning for large-scale item recommendations. In International Conference on Information & Knowledge Management (CIKM). 4321–4330.
  46. Self-supervised multi-channel hypergraph convolutional network for social recommendation. In The Web Conference (WWW). 413–424.
  47. Are graph augmentations necessary? simple graph contrastive learning for recommendation. In International Conference on Research and Development in Information Retrieval (SIGIR). 1294–1303.
  48. Personalized entity recommendation: A heterogeneous information network approach. In International Conference on Web Search and Data Mining (WSDM). 283–292.
  49. Collaborative knowledge base embedding for recommender systems. In International Conference on Knowledge Discovery & Data Mining (KDD). 353–362.
  50. Kb4rec: A data set for linking knowledge bases with recommender systems. Data Intelligence 1, 2 (2019), 121–136.
  51. S3-rec: Self-supervised learning for sequential recommendation with mutual information maximization. In International Conference on Information & Knowledge Management (CIKM). 1893–1902.
  52. Multi-level Cross-view Contrastive Learning for Knowledge-aware Recommender System. In International Conference on Research and Development in Information Retrieval (SIGIR).
Citations (65)

Summary

An Assessment of Knowledge Graph Self-Supervised Rationalization for Recommendation

This paper introduces KGRec, a recommendation framework based on integrating self-supervised learning into knowledge graph-augmented recommender systems. The work explores the rationale behind user-item interactions, leveraging a comprehensive self-supervised approach to enhance recommendation accuracy by discerning pertinent knowledge graph (KG) connections.

Research Contributions and Methodology

KGRec distinguishes itself by substituting random augmentation for a more nuanced approach in self-supervised learning paradigms, notably employing an innovative method called rational masking. This involves generating rationale scores for knowledge triplets to identify and represent informative connections. KGRec encapsulates two primary tasks as part of this method: a generative task and a contrastive learning task.

The generative component employs a masking-reconstructing strategy where knowledge triplets with high rationale scores are masked during training. The model is subsequently tasked with reconstructing these masked connections, effectively highlighting key knowledge paths within the KG. The resulting self-supervised learning process strengthens the model's ability to discern significant relational patterns that contribute most to recommendation tasks.

Complementing the generative task, KGRec incorporates a contrastive learning framework that aligns collaborative signals from user-item interactions with those from the KG. This task involves masking potential noise within both graphs to ensure robust contrastive learning, thereby enhancing the quality of entity representations.

Experimental Validation

The authors assert that KGRec achieves significant improvements over state-of-the-art methods, citing experiments conducted on three widely recognized datasets: Last-FM, MIND, and Alibaba-iFashion. By implementing the rationale-aware masking mechanism and cross-view contrastive tasks, KGRec is demonstrated to outperform other knowledge-aware recommenders in both recall and normalized discounted cumulative gain (NDCG) metrics.

The evaluation results are particularly noteworthy in cold-start and long-tail item scenarios, typical areas of weakness for many recommendation models. KGRec effectively manages data sparsity by leveraging knowledge graphs efficiently while maintaining interpretability in its recommendation process.

Theoretical and Practical Implications

The research underscores the necessity of integrating knowledge graphs into recommendation engines with a fine-grained, rationale-driven approach. The authors effectively demonstrate that self-supervised learning, when appropriately guided by task-related rationales, can markedly improve recommendation accuracy. Practically, this implies that organizations can achieve better alignment of recommendation results with user preferences, a critical factor in increasing user engagement and satisfaction.

Future developments in AI applications can draw from this work to explore more sophisticated graph representation learning strategies. The potential to personalize interaction-based services across various sectors, like e-commerce and content streaming, augments the significance of such methodological innovations.

Conclusion

KGRec presents a compelling advancement in knowledge-enhanced recommender systems by embedding self-supervised rationalization into their core functionality. The integration of rational masking and rationality-aware contrastive learning defines new horizons for achieving efficient and interpretable recommendation systems. The paper serves as a methodological reference for researchers aiming to advance the state-of-the-art in knowledge-aware recommendation frameworks, making a pivotal contribution to the field of recommender systems.

Whiteboard

Paper to Video (Beta)

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.