Bias Reduction in Social Networks through Agent-Based Simulations

• URL: http://arxiv.org/abs/2409.16558v1
• Date: Wed, 25 Sep 2024 02:16:20 GMT
• Title: Bias Reduction in Social Networks through Agent-Based Simulations
• Authors: Nathan Bartley, Keith Burghardt, Kristina Lerman,
• Abstract summary: We show that a simple greedy algorithm that constructs a feed based on network properties reduces perception biases comparable to a random feed. This underscores the influence network structure has in determining the effectiveness of recommender systems in the social network context.
• Score: 1.9608359347635145
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Online social networks use recommender systems to suggest relevant information to their users in the form of personalized timelines. Studying how these systems expose people to information at scale is difficult to do as one cannot assume each user is subject to the same timeline condition and building appropriate evaluation infrastructure is costly. We show that a simple agent-based model where users have fixed preferences affords us the ability to compare different recommender systems (and thus different personalized timelines) in their ability to skew users' perception of their network. Importantly, we show that a simple greedy algorithm that constructs a feed based on network properties reduces such perception biases comparable to a random feed. This underscores the influence network structure has in determining the effectiveness of recommender systems in the social network context and offers a tool for mitigating perception biases through algorithmic feed construction.

Related papers

• Recommendation Fairness in Social Networks Over Time [20.27386486425493]
  We study the evolution of recommendation fairness over time and its relation to dynamic network properties. Our results suggest that recommendation fairness improves over time, regardless of the recommendation method. Two network properties, minority ratio, and homophily ratio, exhibit stable correlations with fairness over time.
  arXiv  Detail & Related papers  (2024-02-05T19:03:23Z)
• Big-data-driven and AI-based framework to enable personalization in wireless networks [20.26379197206863]
  We propose a big-data-driven and AI-based personalization framework to integrate personalization into wireless networks. Based on each user's actual requirements and context, a multi-objective formulation enables the network to micromanage and optimize the provided user satisfaction levels simultaneously.
  arXiv  Detail & Related papers  (2023-06-08T02:30:55Z)
• Fair Information Spread on Social Networks with Community Structure [2.9613974659787132]
  Influence maximiza- tion (IM) algorithms aim to identify individuals who will generate the greatest spread through the social network if provided with information. This work relies on fitting a model to the social network which is then used to determine a seed allocation strategy for optimal fair information spread.
  arXiv  Detail & Related papers  (2023-05-15T16:51:18Z)
• A Comparative Analysis of Bias Amplification in Graph Neural Network Approaches for Recommender Systems [0.0]
  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.
  arXiv  Detail & Related papers  (2023-01-18T16:29:05Z)
• Cross-Network Social User Embedding with Hybrid Differential Privacy Guarantees [81.6471440778355]
  We propose a Cross-network Social User Embedding framework, namely DP-CroSUE, to learn the comprehensive representations of users in a privacy-preserving way. In particular, for each heterogeneous social network, we first introduce a hybrid differential privacy notion to capture the variation of privacy expectations for heterogeneous data types. To further enhance user embeddings, a novel cross-network GCN embedding model is designed to transfer knowledge across networks through those aligned users.
  arXiv  Detail & Related papers  (2022-09-04T06:22:37Z)
• Relational Graph Neural Networks for Fraud Detection in a Super-App environment [53.561797148529664]
  We propose a framework of relational graph convolutional networks methods for fraudulent behaviour prevention in the financial services of a Super-App. We use an interpretability algorithm for graph neural networks to determine the most important relations to the classification task of the users. Our results show that there is an added value when considering models that take advantage of the alternative data of the Super-App and the interactions found in their high connectivity.
  arXiv  Detail & Related papers  (2021-07-29T00:02:06Z)
• Locate Who You Are: Matching Geo-location to Text for Anchor Link Prediction [40.654494490237]
  We propose a novel anchor link prediction framework for matching users across networks. Our approach outperforms existing methods and achieves state-of-the-art results.
  arXiv  Detail & Related papers  (2021-04-19T08:15:28Z)
• Online Learning Demands in Max-min Fairness [91.37280766977923]
  We describe mechanisms for the allocation of a scarce resource among multiple users in a way that is efficient, fair, and strategy-proof. The mechanism is repeated for multiple rounds and a user's requirements can change on each round. At the end of each round, users provide feedback about the allocation they received, enabling the mechanism to learn user preferences over time.
  arXiv  Detail & Related papers  (2020-12-15T22:15:20Z)
• Unsatisfied Today, Satisfied Tomorrow: a simulation framework for performance evaluation of crowdsourcing-based network monitoring [68.8204255655161]
  We propose an empirical framework tailored to assess the quality of the detection of under-performing cells. The framework simulates both the processes of satisfaction surveys delivery and users satisfaction prediction. We use the simulation framework to test empirically the performance of under-performing sites detection in general scenarios.
  arXiv  Detail & Related papers  (2020-10-30T10:03:48Z)
• Learning from Failure: Training Debiased Classifier from Biased Classifier [76.52804102765931]
  We show that neural networks learn to rely on spurious correlation only when it is "easier" to learn than the desired knowledge. We propose a failure-based debiasing scheme by training a pair of neural networks simultaneously. Our method significantly improves the training of the network against various types of biases in both synthetic and real-world datasets.
  arXiv  Detail & Related papers  (2020-07-06T07:20:29Z)
• DiffNet++: A Neural Influence and Interest Diffusion Network for Social Recommendation [50.08581302050378]
  Social recommendation has emerged to leverage social connections among users for predicting users' unknown preferences. We propose a preliminary work of a neural influence diffusion network (i.e., DiffNet) for social recommendation (Diffnet) In this paper, we propose DiffNet++, an improved algorithm of Diffnet that models the neural influence diffusion and interest diffusion in a unified framework.
  arXiv  Detail & Related papers  (2020-01-15T08:45:34Z)

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.