Mixed heuristic and greedy strategies based algorithm for influence maximization in social networks

被引：1
|
作者：
Cao J. [1 ,2 ]
Min H. [1 ,2 ]
Xu S. [1 ,2 ]
Liu B. [1 ,2 ]
机构：
[1] School of Computer Science and Engineering, Southeast University, Nanjing
[2] College of Software Engineering, Southeast University, Suzhou
来源：
Dongnan Daxue Xuebao (Ziran Kexue Ban)/Journal of Southeast University (Natural Science Edition) | 2016年 / 46卷 / 05期
关键词：
Dissemination model; Greedy algorithm; Heuristic algorithm; Influence maximization; Social networks;
D O I：
10.3969/j.issn.1001-0505.2016.05.009
中图分类号：
学科分类号：
摘要：
To solve the imbalance problem between the influence scope and the running time of the classic influence maximization algorithms, a mixed heuristic and greedy strategies based algorithm (MHG algorithm) for influence maximization in social networks is proposed. The algorithm considers the advantages on the greedy and heuristic strategies, and the selection of seed nodes is divided into two steps. First, the candidate node set is selected by the heuristic algorithm, and then the final seed node set is deduced from this set by the greedy algorithm. The results show that the MHG algorithm is superior in influence scope compared with current heuristic algorithms. It exhibits the approximate effect of the greedy algorithm, but the running time is obviously lower. Therefore, the MHG algorithm achieves a good balance between the influence scope and the running time. Moreover, the MHG algorithm presents a stable influence scope when running on real data sets and different dissemination models, showing its scalability in large scale social networks. © 2016, Editorial Department of Journal of Southeast University. All right reserved.
引用
收藏
页码：950 / 956
页数：6
相关论文
共 15 条
  • [1] Domingos P., Richardson M., Mining the network value of customers, Proceedings of the 7th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining, pp. 57-66, (2001)
  • [2] Richardson M., Domingos P., Mining knowledge-sharing sites for viral marketing, Proceedings of the 8th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 61-70, (2002)
  • [3] Kempe D., Kleinberg J., Tardos E., Maximizing the spread of influence through a social network, Proceedings of the 9th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 137-146, (2003)
  • [4] Leskovec J., Krause A., Guestrin C., Et al., Cost-effective outbreak detection in networks, Proceedings of the 13th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 420-429, (2007)
  • [5] Chen W., Wang Y., Yang S., Efficient influence maximization in social networks, Proceedings of the 15th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 199-208, (2009)
  • [6] Goyal A., Lu W., Lakshmanan L.V.S., CELF++: optimizing the greedy algorithm for influence maximization in social networks, Proceedings of the 20th International Conference Companion on World Wide Web, pp. 47-48, (2011)
  • [7] Wasserman S., Faust K., Social network analysis, Encyclopedia of Social Network Analysis & Mining, 22, pp. 109-127, (2011)
  • [8] Brin S., Page L., Reprint of: The anatomy of a large-scale hypertextual web search engine, Computer Networks, 56, 18, pp. 3825-3833, (2012)
  • [9] Chen W., Wang C., Wang Y., Scalable influence maximization for prevalent viral marketing in large-scale social networks, Proceedings of the 16th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 1029-1038, (2010)
  • [10] Jung K., Heo W., Chen W., IRIE: Scalable and robust influence maximization in social networks, IEEE 12th International Conference on Data Mining (ICDM), pp. 918-923, (2011)
12