Graphing else matters: exploiting aspect opinions and ratings in explainable graph-based recommendations

• URL: http://arxiv.org/abs/2107.03226v1
• Date: Wed, 7 Jul 2021 13:57:28 GMT
• Title: Graphing else matters: exploiting aspect opinions and ratings in explainable graph-based recommendations
• Authors: Iv\'an Cantador, Andr\'es Carvallo, Fernando Diez, Denis Parra
• Abstract summary: 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.
• Score: 66.83527496838937
• License: http://creativecommons.org/publicdomain/zero/1.0/
• Abstract: The success of neural network embeddings has entailed a renewed interest in using knowledge graphs for a wide variety of machine learning and information retrieval tasks. In particular, current recommendation methods based on graph embeddings have shown state-of-the-art performance. These methods commonly encode latent rating patterns and content features. Different from previous work, in this paper, 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. Our approach has the advantage of providing explanations which leverage aspect-based opinions given by users about recommended items. Furthermore, we also provide examples of the applicability of recommendations utilizing aspect opinions as explanations in a visualization dashboard, which allows obtaining information about the most and least liked aspects of similar users obtained from the embeddings of an input graph.

Related papers

• Review of Explainable Graph-Based Recommender Systems [2.1711205684359247]
  This review paper discusses state-of-the-art approaches of explainable graph-based recommender systems. It categorizes them based on three aspects: learning methods, explaining methods, and explanation types.
  arXiv  Detail & Related papers  (2024-07-31T21:30:36Z)
• Evaluating graph-based explanations for AI-based recommender systems [1.2499537119440245]
  We study the effectiveness of graph-based explanations in improving users' perception of AI-based recommendations. We find that users perceive graph-based explanations as more usable than designs involving feature importance.
  arXiv  Detail & Related papers  (2024-07-17T07:28:49Z)
• Conditional Attention Networks for Distilling Knowledge Graphs in Recommendation [74.14009444678031]
  We propose Knowledge-aware Conditional Attention Networks (KCAN) to incorporate knowledge graph into a recommender system. We use a knowledge-aware attention propagation manner to obtain the node representation first, which captures the global semantic similarity on the user-item network and the knowledge graph. Then, by applying a conditional attention aggregation on the subgraph, we refine the knowledge graph to obtain target-specific node representations.
  arXiv  Detail & Related papers  (2021-11-03T09:40:43Z)
• Unbiased Graph Embedding with Biased Graph Observations [52.82841737832561]
  We propose a principled new way for obtaining unbiased representations by learning from an underlying bias-free graph. Based on this new perspective, we propose two complementary methods for uncovering such an underlying graph.
  arXiv  Detail & Related papers  (2021-10-26T18:44:37Z)
• Recommender systems based on graph embedding techniques: A comprehensive review [9.871096870138043]
  This article systematically retrospects graph embedding-based recommendation from embedding techniques for bipartite graphs, general graphs, and knowledge graphs. Comparing several representative graph embedding-based recommendation models with the most common-used conventional recommendation models, on simulations, manifests that the conventional models overall outperform the graph embedding-based ones in predicting implicit user-item interactions.
  arXiv  Detail & Related papers  (2021-09-20T14:42:39Z)
• 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)
• Reinforcement Learning with Feedback Graphs [69.1524391595912]
  We study episodic reinforcement learning in decision processes when the agent receives additional feedback per step. We formalize this setting using a feedback graph over state-action pairs and show that model-based algorithms can leverage the additional feedback for more sample-efficient learning.
  arXiv  Detail & Related papers  (2020-05-07T22:35:37Z)
• 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)

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.