SoREX: Towards Self-Explainable Social Recommendation with Relevant Ego-Path Extraction

• URL: http://arxiv.org/abs/2510.00080v1
• Date: Tue, 30 Sep 2025 02:49:54 GMT
• Title: SoREX: Towards Self-Explainable Social Recommendation with Relevant Ego-Path Extraction
• Authors: Hanze Guo, Yijun Ma, Xiao Zhou,
• Abstract summary: Social recommendation has been proven effective in addressing data sparsity in user-item interaction modeling.<n>Many GNN-based approaches in social recommendation lack the ability to furnish meaningful explanations for their predictions.<n>We introduce SoREX, a self-explanatory GNN-based social recommendation framework.
• Score: 7.700637067247922
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Social recommendation has been proven effective in addressing data sparsity in user-item interaction modeling by leveraging social networks. The recent integration of Graph Neural Networks (GNNs) has further enhanced prediction accuracy in contemporary social recommendation algorithms. However, many GNN-based approaches in social recommendation lack the ability to furnish meaningful explanations for their predictions. In this study, we confront this challenge by introducing SoREX, a self-explanatory GNN-based social recommendation framework. SoREX adopts a two-tower framework enhanced by friend recommendation, independently modeling social relations and user-item interactions, while jointly optimizing an auxiliary task to reinforce social signals. To offer explanations, we propose a novel ego-path extraction approach. This method involves transforming the ego-net of a target user into a collection of multi-hop ego-paths, from which we extract factor-specific and candidate-aware ego-path subsets as explanations. This process facilitates the summarization of detailed comparative explanations among different candidate items through intricate substructure analysis. Furthermore, we conduct explanation re-aggregation to explicitly correlate explanations with downstream predictions, imbuing our framework with inherent self-explainability. Comprehensive experiments conducted on four widely adopted benchmark datasets validate the effectiveness of SoREX in predictive accuracy. Additionally, qualitative and quantitative analyses confirm the efficacy of the extracted explanations in SoREX. Our code and data are available at https://github.com/antman9914/SoREX.

Related papers

• Reasoning of Large Language Models over Knowledge Graphs with Super-Relations [53.14275361052276]
  We propose the ReKnoS framework, which aims to Reason over Knowledge Graphs with Super-Relations.<n>Our framework's key advantages include the inclusion of multiple relation paths through super-relations.<n>The results demonstrate the superior performance of ReKnoS over existing state-of-the-art baselines, with an average accuracy gain of 2.92%.
  arXiv  Detail & Related papers  (2025-03-28T06:11:04Z)
• Z-REx: Human-Interpretable GNN Explanations for Real Estate Recommendations [0.358439716487063]
  This work introduces Z-REx, a GNN explanation framework designed explicitly for heterogeneous link prediction tasks.<n>Z-REx utilizes structural and attribute perturbation to identify critical substructures and important features while reducing the search space by leveraging domain-specific knowledge.<n>We show the efficacy of Z-REx in generating contextually relevant and human-interpretable explanations for ZiGNN, a GNN-based recommendation engine, using a real-world real-estate dataset from Zillow Group, Inc.
  arXiv  Detail & Related papers  (2025-02-12T02:42:25Z)
• PageRank Bandits for Link Prediction [72.61386754332776]
  Link prediction is a critical problem in graph learning with broad applications such as recommender systems and knowledge graph completion. This paper reformulates link prediction as a sequential decision-making process, where each link prediction interaction occurs sequentially. We propose a novel fusion algorithm, PRB (PageRank Bandits), which is the first to combine contextual bandits with PageRank for collaborative exploitation and exploration.
  arXiv  Detail & Related papers  (2024-11-03T02:39:28Z)
• Relational Graph Convolutional Networks for Sentiment Analysis [0.0]
  Graph Convolutional Networks (NRGCs) offer interpretability and flexibility by capturing dependencies between data points represented as nodes in a graph. We demonstrate the effectiveness of our approach by using pre-trained language models such as BERT and RoBERTa with RGCN architecture on product reviews from Amazon and Digikala datasets.
  arXiv  Detail & Related papers  (2024-04-16T07:27:49Z)
• Link Prediction for Social Networks using Representation Learning and Heuristic-based Features [1.279952601030681]
  Predicting missing links in social networks efficiently can help in various modern-day business applications. Here, we explore various feature extraction techniques to generate representations of nodes and edges in a social network.
  arXiv  Detail & Related papers  (2024-03-13T15:23:55Z)
• Path-based Explanation for Knowledge Graph Completion [17.541247786437484]
  Proper explanations for the results of GNN-based Knowledge Graph Completion models increase model transparency. Existing practices for explaining KGC tasks rely on instance/subgraph-based approaches. We propose Power-Link, the first path-based KGC explainer that explores GNN-based models.
  arXiv  Detail & Related papers  (2024-01-04T14:19:37Z)
• Ordinal Graph Gamma Belief Network for Social Recommender Systems [54.9487910312535]
  We develop a hierarchical Bayesian model termed ordinal graph factor analysis (OGFA), which jointly models user-item and user-user interactions. OGFA not only achieves good recommendation performance, but also extracts interpretable latent factors corresponding to representative user preferences. We extend OGFA to ordinal graph gamma belief network, which is a multi-stochastic-layer deep probabilistic model.
  arXiv  Detail & Related papers  (2022-09-12T09:19:22Z)
• Reinforcement Learning based Path Exploration for Sequential Explainable Recommendation [57.67616822888859]
  We propose a novel Temporal Meta-path Guided Explainable Recommendation leveraging Reinforcement Learning (TMER-RL) TMER-RL utilizes reinforcement item-item path modelling between consecutive items with attention mechanisms to sequentially model dynamic user-item evolutions on dynamic knowledge graph for explainable recommendation. Extensive evaluations of TMER on two real-world datasets show state-of-the-art performance compared against recent strong baselines.
  arXiv  Detail & Related papers  (2021-11-24T04:34:26Z)
• D-REX: Dialogue Relation Extraction with Explanations [65.3862263565638]
  This work focuses on extracting explanations that indicate that a relation exists while using only partially labeled data. We propose our model-agnostic framework, D-REX, a policy-guided semi-supervised algorithm that explains and ranks relations. We find that about 90% of the time, human annotators prefer D-REX's explanations over a strong BERT-based joint relation extraction and explanation model.
  arXiv  Detail & Related papers  (2021-09-10T22:30:48Z)
• Interpretable Signed Link Prediction with Signed Infomax Hyperbolic Graph [54.03786611989613]
  signed link prediction in social networks aims to reveal the underlying relationships (i.e. links) among users (i.e. nodes) We develop a unified framework, termed as Signed Infomax Hyperbolic Graph (textbfSIHG) In order to model high-order user relations and complex hierarchies, the node embeddings are projected and measured in a hyperbolic space with a lower distortion.
  arXiv  Detail & Related papers  (2020-11-25T05:09:03Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.