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 }$$ 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.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
