A Comparative Analysis of Bias Amplification in Graph Neural Network Approaches for Recommender Systems

• URL: http://arxiv.org/abs/2301.07639v1
• Date: Wed, 18 Jan 2023 16:29:05 GMT
• Title: A Comparative Analysis of Bias Amplification in Graph Neural Network Approaches for Recommender Systems
• Authors: Nikzad Chizari, Niloufar Shoeibi and Mar\'ia N. Moreno-Garc\'ia
• Abstract summary: The bias amplification issue needs to be investigated while using these algorithms. In this paper, we aim to comprehensively study this problem through a literature review and an analysis of the behavior against biases of different GNN-based algorithms.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Recommender Systems (RSs) are used to provide users with personalized item recommendations and help them overcome the problem of information overload. Currently, recommendation methods based on deep learning are gaining ground over traditional methods such as matrix factorization due to their ability to represent the complex relationships between users and items and to incorporate additional information. The fact that these data have a graph structure and the greater capability of Graph Neural Networks (GNNs) to learn from these structures has led to their successful incorporation into recommender systems. However, the bias amplification issue needs to be investigated while using these algorithms. Bias results in unfair decisions, which can negatively affect the company reputation and financial status due to societal disappointment and environmental harm. In this paper, we aim to comprehensively study this problem through a literature review and an analysis of the behavior against biases of different GNN-based algorithms compared to state-of-the-art methods. We also intend to explore appropriate solutions to tackle this issue with the least possible impact on the model performance.

Related papers

• Linear-Time Graph Neural Networks for Scalable Recommendations [50.45612795600707]
  The key of recommender systems is to forecast users' future behaviors based on previous user-item interactions. Recent years have witnessed a rising interest in leveraging Graph Neural Networks (GNNs) to boost the prediction performance of recommender systems. We propose a Linear-Time Graph Neural Network (LTGNN) to scale up GNN-based recommender systems to achieve comparable scalability as classic MF approaches.
  arXiv  Detail & Related papers  (2024-02-21T17:58:10Z)
• Graph Neural Bandits [49.85090929163639]
  We propose a framework named Graph Neural Bandits (GNB) to leverage the collaborative nature among users empowered by graph neural networks (GNNs) To refine the recommendation strategy, we utilize separate GNN-based models on estimated user graphs for exploitation and adaptive exploration.
  arXiv  Detail & Related papers  (2023-08-21T15:57:57Z)
• Multi-Agent Reinforcement Learning with Graph Convolutional Neural Networks for optimal Bidding Strategies of Generation Units in Electricity Markets [1.370633147306388]
  This paper proposes a distributed learning algorithm based on deep reinforcement learning (DRL) and a graph convolutional neural network (GCN) The state and connection between nodes are the inputs of the GCN, which can make agents aware of the structure of the system. We evaluate the proposed algorithm on the IEEE 30-bus system under different scenarios.
  arXiv  Detail & Related papers  (2022-08-11T09:29:31Z)
• Efficient Human-in-the-loop System for Guiding DNNs Attention [25.501443892795614]
  We propose an efficient human-in-the-loop system to interactively direct the attention of classifiers to the regions specified by users. Previous approaches for attention guidance require the preparation of pixel-level annotations and are not designed as interactive systems.
  arXiv  Detail & Related papers  (2022-06-13T09:04:32Z)
• Broad Recommender System: An Efficient Nonlinear Collaborative Filtering Approach [56.12815715932561]
  We propose a new broad recommender system called Broad Collaborative Filtering (BroadCF) Instead of Deep Neural Networks (DNNs), Broad Learning System (BLS) is used as a mapping function to learn the complex nonlinear relationships between users and items. Extensive experiments conducted on seven benchmark datasets have confirmed the effectiveness of the proposed BroadCF algorithm.
  arXiv  Detail & Related papers  (2022-04-20T01:25:08Z)
• 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)
• DSKReG: Differentiable Sampling on Knowledge Graph for Recommendation with Relational GNN [59.160401038969795]
  We propose differentiable sampling on Knowledge Graph for Recommendation with GNN (DSKReG) We devise a differentiable sampling strategy, which enables the selection of relevant items to be jointly optimized with the model training procedure. The experimental results demonstrate that our model outperforms state-of-the-art KG-based recommender systems.
  arXiv  Detail & Related papers  (2021-08-26T16:19:59Z)
• Graph Trend Networks for Recommendations [34.06649831739749]
  The key of recommender systems is to predict how likely users will interact with items based on their historical online behaviors. To exploit these user-item interactions, there are increasing efforts on considering the user-item interactions as a user-item bipartite graph. Despite their success, most existing GNN-based recommender systems overlook the existence of interactions caused by unreliable behaviors. We propose the Graph Trend Networks for recommendations (GTN) with principled designs that can capture the adaptive reliability of the interactions.
  arXiv  Detail & Related papers  (2021-08-12T06:09:18Z)
• Fairness-Aware Explainable Recommendation over Knowledge Graphs [73.81994676695346]
  We analyze different groups of users according to their level of activity, and find that bias exists in recommendation performance between different groups. We show that inactive users may be more susceptible to receiving unsatisfactory recommendations, due to insufficient training data for the inactive users. We propose a fairness constrained approach via re-ranking to mitigate this problem in the context of explainable recommendation over knowledge graphs.
  arXiv  Detail & Related papers  (2020-06-03T05:04:38Z)
• 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)

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.