Opinion-aware Influence Maximization in Online Social Networks
Ying Wang, Yanhao Wang

TL;DR
This paper introduces an opinion-aware influence maximization approach in social networks, aiming to promote positive opinions and reduce negative ones, with a novel algorithm that outperforms existing methods in real-world data.
Contribution
It proposes a new algorithm for opinion-aware influence maximization that considers user opinions, using reverse reachable sets and a sandwich approximation for seed selection.
Findings
Improves positive opinion spread compared to existing methods
Reduces negative opinion spread in experiments
Achieves a data-dependent approximation despite NP-hardness
Abstract
Influence maximization (IM) aims to find seed users on an online social network to maximize the spread of information about a target product through word-of-mouth propagation among all users. Prior IM methods mostly focus on maximizing the overall influence spread, which assumes that all users are potential customers of the product and that more exposure leads to higher benefits. However, in real-world scenarios, some users who dislike the product may express and spread negative opinions, damaging the product's reputation and lowering its profit. This paper investigates the opinion-aware influence maximization (OIM) problem, which finds a set of seed users to maximize the positive opinions toward the product while minimizing the negative opinions. We propose a novel algorithm for the OIM problem. Specifically, after obtaining the users with positive and negative opinions towards the…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsComplex Network Analysis Techniques · Opinion Dynamics and Social Influence · Social Media and Politics
