Knowledge is Power, Understanding is Impact: Utility and Beyond Goals, Explanation Quality, and Fairness in Path Reasoning Recommendation

• URL: http://arxiv.org/abs/2301.05944v1
• Date: Sat, 14 Jan 2023 16:18:46 GMT
• Title: Knowledge is Power, Understanding is Impact: Utility and Beyond Goals, Explanation Quality, and Fairness in Path Reasoning Recommendation
• Authors: Giacomo Balloccu, Ludovico Boratto, Christian Cancedda, Gianni Fenu, Mirko Marras
• Abstract summary: Path reasoning is a notable recommendation approach that models high-order user-product relations. We replicated three state-of-the-art relevant path reasoning recommendation methods proposed in top-tier conferences. We studied the extent to which they meet recommendation utility and beyond objectives, explanation quality, and consumer and provider fairness.
• Score: 12.925021362985987
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Path reasoning is a notable recommendation approach that models high-order user-product relations, based on a Knowledge Graph (KG). This approach can extract reasoning paths between recommended products and already experienced products and, then, turn such paths into textual explanations for the user. Unfortunately, evaluation protocols in this field appear heterogeneous and limited, making it hard to contextualize the impact of the existing methods. In this paper, we replicated three state-of-the-art relevant path reasoning recommendation methods proposed in top-tier conferences. Under a common evaluation protocol, based on two public data sets and in comparison with other knowledge-aware methods, we then studied the extent to which they meet recommendation utility and beyond objectives, explanation quality, and consumer and provider fairness. Our study provides a picture of the progress in this field, highlighting open issues and future directions. Source code: \url{https://github.com/giacoballoccu/rep-path-reasoning-recsys}.

Related papers

• CADRL: Category-aware Dual-agent Reinforcement Learning for Explainable Recommendations over Knowledge Graphs [34.83895369861899]
  We propose a category-aware dual-agent reinforcement learning model for explainable recommendations over knowledge graphs. Our model comprises two components: (1) a category-aware gated graph neural network that jointly captures context-aware item representations from neighboring entities and categories, and (2) a dual-agent RL framework where two agents efficiently traverse long paths to search for suitable items.
  arXiv  Detail & Related papers  (2024-08-06T13:07:08Z)
• How to Surprisingly Consider Recommendations? A Knowledge-Graph-based Approach Relying on Complex Network Metrics [0.2537383030441368]
  We propose a Knowledge Graph based recommender system by encoding user interactions on item catalogs. Our study explores whether network-level metrics on KGs can influence the degree of surprise in recommendations. We experimentally evaluate our approach on two datasets of LastFM listening histories and synthetic Netflix viewing profiles.
  arXiv  Detail & Related papers  (2024-05-14T09:38:44Z)
• Anchoring Path for Inductive Relation Prediction in Knowledge Graphs [69.81600732388182]
  APST takes both APs and CPs as the inputs of a unified Sentence Transformer architecture. We evaluate APST on three public datasets and achieve state-of-the-art (SOTA) performance in 30 of 36 transductive, inductive, and few-shot experimental settings.
  arXiv  Detail & Related papers  (2023-12-21T06:02:25Z)
• CRAFT: Concept Recursive Activation FacTorization for Explainability [5.306341151551106]
  CRAFT is a novel approach to identify both "what" and "where" by generating concept-based explanations. We conduct both human and computer vision experiments to demonstrate the benefits of the proposed approach.
  arXiv  Detail & Related papers  (2022-11-17T14:22:47Z)
• Inferring Substitutable and Complementary Products with Knowledge-Aware Path Reasoning based on Dynamic Policy Network [15.723090822315454]
  Inferring substitutable and complementary products for a given product is an essential and fundamental concern for the recommender system. Existing approaches take advantage of the knowledge graphs to learn more evidences for inference, whereas they often suffer from invalid reasoning for lack of elegant decision making strategies. We propose a novel Knowledge-Aware Path Reasoning (KAPR) model which leverages the dynamic policy network to make explicit reasoning over knowledge graphs.
  arXiv  Detail & Related papers  (2021-10-07T09:00:36Z)
• Rating and aspect-based opinion graph embeddings for explainable recommendations [69.9674326582747]
  We propose to exploit embeddings extracted from graphs that combine information from ratings and aspect-based opinions expressed in textual reviews. We then adapt and evaluate state-of-the-art graph embedding techniques over graphs generated from Amazon and Yelp reviews on six domains, outperforming baseline recommenders.
  arXiv  Detail & Related papers  (2021-07-07T14:07:07Z)
• Graphing else matters: exploiting aspect opinions and ratings in explainable graph-based recommendations [66.83527496838937]
  We propose to exploit embeddings extracted from graphs that combine information from ratings and aspect-based opinions expressed in textual reviews. We then adapt and evaluate state-of-the-art graph embedding techniques over graphs generated from Amazon and Yelp reviews on six domains. Our approach has the advantage of providing explanations which leverage aspect-based opinions given by users about recommended items.
  arXiv  Detail & Related papers  (2021-07-07T13:57:28Z)
• Joint Semantics and Data-Driven Path Representation for Knowledge Graph Inference [60.048447849653876]
  We propose a novel joint semantics and data-driven path representation that balances explainability and generalization in the framework of KG embedding. Our proposed model is evaluated on two classes of tasks: link prediction and path query answering task.
  arXiv  Detail & Related papers  (2020-10-06T10:24:45Z)
• Recommendation system using a deep learning and graph analysis approach [1.2183405753834562]
  We propose a novel recommendation method based on Matrix Factorization and graph analysis methods. In addition, we leverage deep Autoencoders to initialize users and items latent factors, and deep embedding method gathers users' latent factors from the user trust graph.
  arXiv  Detail & Related papers  (2020-04-17T08:05:33Z)
• A Survey on Knowledge Graph-Based Recommender Systems [65.50486149662564]
  We conduct a systematical survey of knowledge graph-based recommender systems. We focus on how the papers utilize the knowledge graph for accurate and explainable recommendation. We introduce datasets used in these works.
  arXiv  Detail & Related papers  (2020-02-28T02:26:30Z)
• Relational Message Passing for Knowledge Graph Completion [78.47976646383222]
  We propose a relational message passing method for knowledge graph completion. It passes relational messages among edges iteratively to aggregate neighborhood information. Results show our method outperforms stateof-the-art knowledge completion methods by a large margin.
  arXiv  Detail & Related papers  (2020-02-17T03:33:41Z)

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.