mlsanityData to 7 Oct 2026

Triple Structural Information Modelling for Accurate, Explainable and Interactive Recommendation

arXiv 2304.11528 ↗First posted 23 Apr 2023cs.IR cs.LGcited by 12

Not on the map. Why?

Abstract (arXiv)

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 TriSIM4Rec, a triple structural information modeling method for accurate, explainable and interactive recommendation on dynamic interaction graphs. Specifically, TriSIM4Rec 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 decomposition (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 TriSIM4Rec 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 TriSIM4Rec in accuracy, explainability and interactivity.

Key facts. Cited by 12 papers in the map (data through 7 Oct 2026). Builds on 20 of its 45 references that are in the map. First posted on arXiv 23 Apr 2023.

Builds on

20 of 45 references.

References · 20

  1. 2017Attention Is All You Needcited by 59,932
  2. 2018Self-Attentive Sequential Recommendationcited by 1,169
  3. 2020LightGCN: Simplifying and Powering Graph Convolution Network for Recommendationcited by 1,134
  4. 2015Session-based Recommendations with Recurrent Neural Networkscited by 685
  5. 2016Ups and Downs: Modeling the Visual Evolution of Fashion Trends with One-Class Collaborative Filteringcited by 517
  6. 2018Personalized Top-N Sequential Recommendation via Convolutional Sequence Embeddingcited by 473
  7. 2019Predicting Dynamic Embedding Trajectory in Temporal Interaction Networkscited by 443
  8. 2019Representation Learning for Dynamic Graphs: A Surveycited by 260
  9. 2020Bias and Debias in Recommender System: A Survey and Future Directionscited by 239
  10. 2017Know-Evolve: Deep Temporal Reasoning for Dynamic Knowledge Graphscited by 149
  11. 2019Intensity-Free Learning of Temporal Point Processescited by 138
  12. 2021How Powerful is Graph Convolution for Recommendation?cited by 50
8 more
  1. 2022TREND: TempoRal Event and Node Dynamics for Graph Representation Learningcited by 50
  2. 2016Deep Coevolutionary Network: Embedding User and Item Features for Recommendationcited by 33
  3. 2021Dynamic Graph Collaborative Filteringcited by 33
  4. 2023Personalized Graph Signal Processing for Collaborative Filteringcited by 29
  5. 2022Parameter-free Dynamic Graph Embedding for Link Predictioncited by 12
  6. 2019Markov Random Fields for Collaborative Filteringcited by 8
  7. 2021Deep Structural Point Process for Learning Temporal Interaction Networkscited by 8
  8. 2020Dynamic Embeddings for Interaction Predictioncited by 6

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2023: 2; 2024: 1; 2025: 6; 2026: 3.

12 papers.