Advertisement
Published in:
01-05-2015
Loyalty improvement beyond the seeds in social networks
Published in: Journal of Combinatorial Optimization | Issue 4/2015
Log inActivate our intelligent search to find suitable subject content or patents.
Select sections of text to find matching patents with Artificial Intelligence. powered by
Select sections of text to find additional relevant content using AI-assisted search. powered by
Abstract
The influence maximization problem in modular social networks is to find a set of seed nodes such that the total influence effect is maximized. Difference with the previous research, in this paper we propose a novel task of influence improving, which is to find strategies to increase the members’ investments. The problem is studied under two influence propagation models: independent cascade (IC) and linear threshold (LT) models. We prove that our influence improving problem is \(\mathcal{NP }\)-hard, and propose new algorithms under both IC and LT models. To the best of our knowledge, our work is the first one that studies influence improving problem under bounded budget. Finally, we implement extensive experiments over a large data collection obtained from real-world social networks, and evaluate the performance of our approach.