Triple Structural Information Modelling for Accurate, Explainable and Interactive Recommendation
Jiahao Liu, Dongsheng Li, Hansu Gu, Tun Lu, Peng Zhang, Li Shang, Ning Gu
Abstract
In dynamic interaction graphs, user-item interactions usually follow heterogeneous patterns, represented by different structural information, such as user-item co-occurrence, sequential information of user interactions and the transition probabilities of item pairs. However, the existing methods cannot simultaneously leverage all three structural information, resulting in suboptimal performance. To this end, we propose øurs, a triple structural information modeling method for accurate, explainable and interactive recommendation on dynamic interaction graphs. Specifically, øurs consists of 1) a dynamic ideal low-pass graph filter to dynamically mine co-occurrence information in user-item interactions, which is implemented by incremental singular value ecomposition (SVD); 2) a parameter-free attention module to capture sequential information of user interactions effectively and efficiently; and 3) an item transition matrix to store the transition probabilities of item pairs. Then, we fuse the predictions from the triple structural information sources to obtain the final recommendation results. By analyzing the relationship between the SVD-based and the recently emerging graph signal processing (GSP)-based collaborative filtering methods, we find that the essence of SVD is an ideal low-pass graph filter, so that the interest vector space in øurs can be extended to achieve explainable and interactive recommendation, making it possible for users to actively break through the information cocoons. Experiments on six public datasets demonstrated the effectiveness of øurs in accuracy, explainability and interactivity.
Ask about this paper
Your agent reads all of it.
Lune indexed this paper to the last equation, along with the top-tier papers that cite it. Ask a question and the answer quotes them.
Your agent calls
Luneget_paper_fulltext
Free to start. No credit card required.
Terminal
Install the CLIlune papers fulltext 6b1eca00-003e-450e-b2c7-9e97995df97aCited by top-tier papers3
- FedCIA: Federated Collaborative Information Aggregation for Privacy-Preserving RecommendationMingzhe Han, Dongsheng Li, Jiafeng Xia, Jiahao Liu et al.SIGIR 2025 · 11 citations
- Filtering Discomforting Recommendations with Large Language ModelsJiahao Liu, Yiyang Shao, Peng Zhang, Dongsheng Li et al.WWW 2025 · 8 citations
- Distribution-Aware End-to-End Embedding for Streaming Numerical Features in Click-Through Rate PredictionJiahao Liu, Hongji Ruan, Weimin Zhang, Ziye Tong et al.KDD 2026 · 1 citation
Builds on7
- LightGCN: Simplifying and Powering Graph Convolution Network for RecommendationXiangnan He, Kuan Deng, Xiang Wang, Yan Li et al.SIGIR 2020 · 4,448 citations
- Intensity-Free Learning of Temporal Point ProcessesOleksandr Shchur, Marin Bilos, Stephan GünnemannICLR 2020 · 210 citations
- TREND: TempoRal Event and Node Dynamics for Graph Representation LearningZhihao Wen, Yuan FangWWW 2022 · 113 citations
- Personalized Graph Signal Processing for Collaborative FilteringJiahao Liu, Dongsheng Li, Hansu Gu, Tun Lu et al.WWW 2023 · 50 citations
- FIRE: Fast Incremental Recommendation with Graph Signal ProcessingJiafeng Xia, Dongsheng Li, Hansu Gu, Jiahao Liu et al.WWW 2022 · 41 citations
Related papers
- Hierarchical Graph Signal Processing for Collaborative FilteringJiafeng Xia, Dongsheng Li, Hansu Gu, Tun Lu et al.WWW 2024 · 13 citations
- Parameter-free Dynamic Graph Embedding for Link PredictionJiahao Liu, Dongsheng Li, Hansu Gu, Tun Lu et al.NeurIPS 2022 · 32 citations
- Next-item Recommendation with Sequential HypergraphsJianling Wang, Kaize Ding, Liangjie Hong, Huan Liu et al.SIGIR 2020 · 284 citations
- Group-Aware Long- and Short-Term Graph Representation Learning for Sequential Group RecommendationWen Wang, Wei Zhang, Jun Rao, Zhijie Qiu et al.SIGIR 2020 · 41 citations
- Sequential Recommendation with Graph Neural NetworksJianxin Chang, Chen Gao, Yu Zheng, Yiqun Hui et al.SIGIR 2021 · 435 citations
