Multi-view Hypergraph Contrastive Policy Learning for Conversational Recommendation
Sen Zhao, Wei Wei, Xian-Ling Mao, Shuai Zhu, Minghui Yang, Zujie Wen, Dangyang Chen, Feida Zhu
摘要
Conversational recommendation systems (CRS) aim to interactively acquire user preferences and accordingly recommend items to users. Accurately learning the dynamic user preferences is of crucial importance for CRS. Previous works learn the user preferences with pairwise relations from the interactive conversation and item knowledge, while largely ignoring the fact that factors for a relationship in CRS are multiplex. Specifically, the user likes/dislikes the items that satisfy some attributes (Like/Dislike view). Moreover social influence is another important factor that affects user preference towards the item (Social view), while is largely ignored by previous works in CRS. The user preferences from these three views are inherently different but also correlated as a whole. The user preferences from the same views should be more similar than that from different views. The user preferences from Like View should be similar to Social View while different from Dislike View. To this end, we propose a novel model, namely Multi-view Hypergraph Contrastive Policy Learning (MHCPL). Specifically, MHCPL timely chooses useful social information according to the interactive history and builds a dynamic hypergraph with three types of multiplex relations from different views. The multiplex relations in each view are successively connected according to their generation order in the interactive conversation. A hierarchical hypergraph neural network is proposed to learn user preferences by integrating information of the graphical and sequential structure from the dynamic hypergraph. A cross-view contrastive learning module is proposed to maintain the inherent characteristics and the correlations of user preferences from different views. Extensive experiments conducted on benchmark datasets demonstrate that MHCPL outperforms the state-of-the-art methods.
问问这篇 Paper
智能体会读完全文。
Lune 把这篇 Paper 索引到了每一个公式,引用它的顶会 Paper 也一样。你提问,回答直接引用原文。
引用它的顶会 Paper3
- Hypergraph-Enhanced Contrastive Learning for Multi-View Clustering with Hyper-Laplacian RegularizationZhibin Gu, Weili WangNeurIPS 2025 · 被引用 7 次
- Semantic Enhanced Heterogeneous Hypergraph Network for Collaborative FilteringMingtao Xu, Wei Wei, Peixuan Yang, Hulong WuAAAI 2025 · 被引用 4 次
- SHARP-Distill: A 68× Faster Recommender System with Hypergraph Neural Networks and Language ModelsSaman Forouzandeh, Parham Moradi, Mahdi JaliliICML 2025
它引用的顶会 Paper10
- Contrastive Multi-View Representation Learning on GraphsKaveh Hassani, Amir Hosein Khas AhmadiICML 2020 · 被引用 1,663 次
- Self-supervised Graph Learning for RecommendationJiancan Wu, Xiang Wang, Fuli Feng, Xiangnan He 等SIGIR 2021 · 被引用 1,476 次
- Hypergraph Contrastive Collaborative FilteringLianghao Xia, Chao Huang, Yong Xu, Jiashu Zhao 等SIGIR 2022 · 被引用 445 次
- Improving Conversational Recommender Systems via Knowledge Graph based Semantic FusionKun Zhou, Wayne Xin Zhao, Shuqing Bian, Yuanhang Zhou 等KDD 2020 · 被引用 309 次
- Interactive Path Reasoning on Graph for Conversational RecommendationWenqiang Lei, Gangyi Zhang, Xiangnan He, Yisong Miao 等KDD 2020 · 被引用 158 次
相关 Paper
- Self-Supervised Multi-Channel Hypergraph Convolutional Network for Social RecommendationJunliang Yu, Hongzhi Yin, Jundong Li, Qinyong Wang 等WWW 2021 · 被引用 598 次
- Disentangled Contrastive Hypergraph Learning for Next POI RecommendationYantong Lai, Yijun Su, Lingwei Wei, Tianqi He 等SIGIR 2024 · 被引用 56 次
- Next-item Recommendation with Sequential HypergraphsJianling Wang, Kaize Ding, Liangjie Hong, Huan Liu 等SIGIR 2020 · 被引用 284 次
- Multiple Choice Questions based Multi-Interest Policy Learning for Conversational RecommendationYiming Zhang, Lingfei Wu, Qi Shen, Yitong Pang 等WWW 2022 · 被引用 72 次
- Confident Action Decision via Hierarchical Policy Learning for Conversational RecommendationHeeseon Kim, Hyeongjun Yang, Kyong-Ho LeeWWW 2023 · 被引用 10 次
