Identifying Minimum Set of Persons that Influenced by a Promotion Campaign

摘要

As it has been proved by different researches that, they just focus on rinding a different sets of the k-key players that had shown the greatest influence such as on social media network. This is equivalent finding a set of promotion people to make the maximum influenced in promotion campaigns. However, it can't predict the outcome of the campaign in advance. In this research, we propose a new approach for a promotion campaign, that is: identifying a minimum set of players to achieve the promotion goals with "at least M people are affected by the set of players with an influence that is greater than or equal to a threshold θ". Through this approach it can be, quantify the result of the campaign first, and then find the minimum set of persons that can influenced by promotion campaign.