Anzeige
Erschienen in:
2015 | OriginalPaper | Buchkapitel
Minimizing the Cost to Win Competition in Social Network
verfasst von : Ziyan Liu, Xiaoguang Hong, Zhaohui Peng, Zhiyong Chen, Weibo Wang, Tianhang Song
Erschienen in: Web Technologies and Applications
Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.
Wählen Sie Textabschnitte aus um mit Künstlicher Intelligenz passenden Patente zu finden. powered by
Markieren Sie Textabschnitte, um KI-gestützt weitere passende Inhalte zu finden. powered by
In social network, influences are propagating among users. Influence maximizing is an important problem which has been studied widely in recent years. However, in the real world, sometimes users need to make their influence maximization through social network and defeat their competitors under minimum cost, such as online voting, expanding market share, etc. In this paper, we consider the problem of selecting a seed set with the minimum cost to influence more people than other competitors. We show this problem is NP-hard and propose a cost-effective greedy algorithm to approximately solve the problem and improve the efficiency based on the submodularity. Furthermore, a new cost-effective Degree Adjust heuristics is proposed to get high efficiency. Experimental results show that our cost-effective greedy algorithm achieves better effectiveness than other algorithms and the cost-effective Degree Adjust heuristic algorithm achieves high efficiency and gets better effectiveness than Degree and Random heuristics.