4.7 Article

Maximizing the Diversity of Exposure in a Social Network

Journal

IEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING
Volume 34, Issue 9, Pages 4357-4370

Publisher

IEEE COMPUTER SOC
DOI: 10.1109/TKDE.2020.3038711

Keywords

Cultural differences; Social networking (online); Approximation algorithms; Computer science; Task analysis; Resource management; Greedy algorithms; Information propagation; diversity maximization; filter bubbles; social influence

Funding

  1. Academy of Finland [317085, 325117]
  2. ERC Advanced Grant REBOUND [834862]
  3. EC H2020 RIA project SoBigData [871042]
  4. Wallenberg AI, Autonomous Systems and Software Program (WASP) - Knut and AliceWallenberg Foundation
  5. European Research Council (ERC) [834862] Funding Source: European Research Council (ERC)
  6. Academy of Finland (AKA) [325117, 325117, 317085, 317085] Funding Source: Academy of Finland (AKA)

Ask authors/readers for more resources

Social-media platforms have provided new ways for citizens to participate in public debates and stay informed. This paper proposes a novel approach to maximize the diversity of exposure in a social network, ensuring citizens are exposed to diverse viewpoints for a healthy information sharing environment.
Social-media platforms have created new ways for citizens to stay informed and participate in public debates. However, to enable a healthy environment for information sharing, social deliberation, and opinion formation, citizens need to be exposed to sufficiently diverse viewpoints that challenge their assumptions, instead of being trapped inside filter bubbles. In this paper, we take a step in this direction and propose a novel approach to maximize the diversity of exposure in a social network. We formulate the problem in the context of information propagation, as a task of recommending a small number of news articles to selected users. In the proposed setting, we take into account content and user leanings, and the probability of further sharing an article. Our model allows to capture the balance between maximizing the spread of information and ensuring the exposure of users to diverse viewpoints. The resulting problem can be cast as maximizing a monotone and submodular function, subject to a matroid constraint on the allocation of articles to users. It is a challenging generalization of the influence-maximization problem. Yet, we are able to devise scalable approximation algorithms by introducing a novel extension to the notion of random reverse-reachable sets. We experimentally demonstrate the efficiency and scalability of our algorithm on several real-world datasets.

Authors

I am an author on this paper
Click your name to claim this paper and add it to your profile.

Reviews

Primary Rating

4.7
Not enough ratings

Secondary Ratings

Novelty
-
Significance
-
Scientific rigor
-
Rate this paper

Recommended

No Data Available
No Data Available