Abstract
The influence maximization (IM) is an optimization problem in the information propagation and social network analysis, which has the goal of finding a seed set that can influence largest number of users. There have been many studies on the IM problem, but most of them focus on maximizing influence effects based on individuals rather than on groups of users. In this paper, we studied a novel problem, the Threshold Benefit for Groups Influence (named \({\mathsf {TGI}}\)), defined as follows: given a social network G, a set of K target groups \({\mathcal C} =\{C_1, C_2, \ldots , C_K\}\) and a threshold \(T>0\), \({\mathsf {TGI}}\) asks us to find a seed set S in G with the minimum cost so that the benefit gained from the influence of the groups in C is at least T. We experimentally implement our proposed algorithm on real social network datasets diversity. It shows efficiency compared to other state-of-the-art IM algorithms in terms of cost and running time.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: 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.