Influence maximization in social networks based on discrete particle swarm optimization

Information Sciences

Volumn 367-368, Issue , 2016, Pages 600-614

  Gong, Maoguo ^a   Yan, Jianan ^a   Shen, Bo ^a   Ma, Lijia ^a   Cai, Qing ^a  

^a XIDIAN UNIVERSITY   (China)

Author keywords

Cascade model; Influence maximization; Particle swarm optimization; Social networks

Indexed keywords

ALGORITHMS; ECONOMIC AND SOCIAL EFFECTS; PARTICLE SWARM OPTIMIZATION (PSO); SOCIAL NETWORKING (ONLINE);

CASCADE MODEL; DISCRETE PARTICLE SWARM OPTIMIZATION; DISCRETE PARTICLE SWARM OPTIMIZATION ALGORITHM; EFFECTIVENESS AND EFFICIENCIES; INFLUENCE MAXIMIZATIONS; LOCAL INFLUENCE; LOCAL SEARCH STRATEGY; OPTIMIZATION MODELING;

OPTIMIZATION;

EID: 84978173168     PISSN: 00200255     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ins.2016.07.012     Document Type: Article

References (64)

1. [1] Altarelli, F., Braunstein, A., DallAsta, L., Wakeling, J.R., Zecchina, R., Containing epidemic outbreaks by message-passing techniques. Phys. Rev. X, 4(2), 2014, 021024.
2. [2] Blum, C., Li, X., Swarm intelligence in optimization. Swarm Intelligence, 2008, Springer, 43–85.
3. [3] Bond, R.M., Fariss, C.J., Jones, J.J., Kramer, A.D., Marlow, C., Settle, J.E., Fowler, J.H., A 61-million-person experiment in social influence and political mobilization. Nature 489:7415 (2012), 295–298.
4. [4] Brin, S., Page, L., Reprint of: the anatomy of a large-scale hypertextual web search engine. Comput. Netw. 56:18 (2012), 3825–3833.
5. [5] Buldyrev, S.V., Parshani, R., Paul, G., Stanley, H.E., Havlin, S., Catastrophic cascade of failures in interdependent networks. Nature 464:7291 (2010), 1025–1028.
6. [6] Cai, Q., Gong, M., Ma, L., Ruan, S., Yuan, F., Jiao, L., Greedy discrete particle swarm optimization for large-scale social network clustering. Inf. Sci. 316 (2015), 503–516.
7. [7] Cai, Q., Gong, M., Shen, B., Ma, L., Jiao, L., Discrete particle swarm optimization for identifying community structures in signed social networks. Neural Netw. 58 (2014), 4–13.
8. [8] Chen, D., Lü, L., Shang, M.-S., Zhang, Y.-C., Zhou, T., Identifying influential nodes in complex networks. Phys. A 391:4 (2012), 1777–1787.
9. [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, 2010, ACM, 1029–1038.
10. [10] 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, 2009, ACM, 199–208.
11. [11] Chen, Y.-C., Zhu, W.-Y., Peng, W.-C., Lee, W.-C., Lee, S.-Y., Cim: community-based influence maximization in social networks. ACM Trans. Intell. Syst. Technol. (TIST), 5(2), 2014, 25.
12. [12] Christakis, N.A., Fowler, J.H., Connected: the surprising power of our social networks and how they shape our lives. 2009, Little, Brown.
13. [13] Contractor, N.S., DeChurch, L.A., Integrating social networks and human social motives to achieve social influence at scale. Proc. National Acad. Sci. 111:Supplement 4 (2014), 13650–13657.
14. [14] Derrac, J., García, S., Molina, D., Herrera, F., A practical tutorial on the use of nonparametric statistical tests as a methodology for comparing evolutionary and swarm intelligence algorithms. Swarm Evol. Comput. 1:1 (2011), 3–18.
15. [15] Domingos, P., Richardson, M., Mining the network value of customers. Proceedings of the Seventh ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, 2001, ACM, 57–66.
16. [16] Eberhart, R.C., Kennedy, J., et al. A new optimizer using particle swarm theory. Proceedings of the Sixth International Symposium on Micro Machine and Human Science, 1, 1995, New York, NY, 39–43.
17. [17] Eberhart, R.C., Shi, Y., Guest editorial special issue on particle swarm optimization. IEEE Trans. Evolut. Comput. 8:3 (2004), 201–203.
18. [18] Friedman, M., The use of ranks to avoid the assumption of normality implicit in the analysis of variance. J. Am. Stat. Assoc. 32:200 (1937), 675–701.
19. [19] García, S., Molina, D., Lozano, M., Herrera, F., A study on the use of non-parametric tests for analyzing the evolutionary algorithms behaviour: a case study on the cec2005 special session on real parameter optimization. J. Heuristics 15:6 (2009), 617–644.
20. [20] Goldenberg, J., Libai, B., Muller, E., Using complex systems analysis to advance marketing theory development: modeling heterogeneity effects on new product growth through stochastic cellular automata. Acad. Market. Sci. Rev., 2001, 2001, 1.
21. [21] Gong, M., Ma, L., Cai, Q., Jiao, L., Enhancing robustness of coupled networks under targeted recoveries. Sci. Rep., 5, 2015, 8439.
22. [22] Gong, M., Wu, Y., Cai, Q., Ma, W., Qin, A., Wang, Z., Jiao, L., Discrete particle swarm optimization for high-order graph matching. Inf. Sci. 328 (2016), 158–171.
23. [23] Goyal, A., Lu, W., Lakshmanan, L.V., Celf++: optimizing the greedy algorithm for influence maximization in social networks. Proceedings of the 20th International Conference Companion on World Wide Web, 2011, ACM, 47–48.
24. [24] Granovetter, M., Threshold models of collective behavior. Am. J. Sociol. 83:6 (1978), 1420–1443.
25. [25] He, X., Kempe, D., Stability of influence maximization. Proceedings of the 20th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, 2014, ACM, 1256–1265.
26. [26] Holm, S., A simple sequentially rejective multiple test procedure. Scandinavian. Stat. 6:2 (1979), 65–70.
27. [27] Iman, R.L., Davenport, J.M., Approximations of the critical region of the fbietkan statistic. Commun. Stat. 9:6 (1980), 571–595.
28. [28] Isella, L., Stehlé, J., Barrat, A., Cattuto, C., Pinton, J.-F., Van den Broeck, W., What's in a crowd? Analysis of face-to-face behavioral networks. J. Theor. Biol. 271:1 (2011), 166–180.
29. [29] Jiang, Q., Song, G., Cong, G., Wang, Y., Si, W., Xie, K., Simulated annealing based influence maximization in social networks. AAAI, 11, 2011, 127–132.
30. [30] Kempe, D., Kleinberg, J., Tardos, É., Maximizing the spread of influence through a social network. Proceedings of the Ninth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, 2003, ACM, 137–146.
31. [31] Kempe, D., Kleinberg, J., Tardos, É., Maximizing the spread of influence through a social network. Theory Comput. 11:4 (2015), 105–147.
32. [32] Kennedy, J., Particle swarm optimization. Encyclopedia of Machine Learning, 2011, Springer, 760–766.
33. [33] Kennedy, J., Eberhart, R.C., A discrete binary version of the particle swarm algorithm. Proceedings of IEEE International Conference on Computational Cybernetics and Simulation, 5, 1997, IEEE, 4104–4108.
34. [34] Kundu, S., Pal, S.K., Deprecation based greedy strategy for target set selection in large scale social networks. Inf. Sci. 316 (2015), 107–122.
35. [35] Lee, J.-R., Chung, C.-W., A query approach for influence maximization on specific users in social networks. IEEE Trans. Knowl. Data Eng. 27:2 (2015), 340–353.
36. [36] Leskovec, J., Kleinberg, J., Faloutsos, C., Graph evolution: Densification and shrinking diameters. ACM Trans. Knowl. Discov. Data (TKDD), 1(1), 2007, 2.
37. [37] Leskovec, J., Krause, A., Guestrin, C., Faloutsos, C., VanBriesen, J., Glance, N., Cost-effective outbreak detection in networks. Proceedings of the 13th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, 2007, ACM, 420–429.
38. [38] Li, Y., Zhan, Z.-H., Lin, S., Zhang, J., Luo, X., Competitive and cooperative particle swarm optimization with information sharing mechanism for global optimization problems. Inf. Sci. 293 (2015), 370–382.
39. [39] Liu, B., Cong, G., Zeng, Y., Xu, D., Chee, Y.M., Influence spreading path and its application to the time constrained social influence maximization problem and beyond. IEEE Trans. Knowl. Data Eng. 26:8 (2014), 1904–1917.
40. [40] Morone, F., Makse, H.A., Influence maximization in complex networks through optimal percolation. Nature 524:7563 (2015), 65–68.
41. [41] Newman, M.E., Finding community structure in networks using the eigenvectors of matrices. Phys. Rev. E, 74(3), 2006, 036104.
42. [42] Newman, M.E., Modularity and community structure in networks. Proc. National Acad. Sci. 103:23 (2006), 8577–8582.
43. [43] Nguyen, H., Zheng, R., On budgeted influence maximization in social networks. IEEE J. Selected Areas Commun. 31:6 (2013), 1084–1094.
44. [44] Ni, Y., Xie, L., Liu, Z.-Q., Minimizing the expected complete influence time of a social network. Inf. Sci. 180:13 (2010), 2514–2527.
45. [45] Onnela, J.-P., Reed-Tsochas, F., Spontaneous emergence of social influence in online systems. Proc. National Acad. Sci. 107:43 (2010), 18375–18380.
46. [46] Pei, S., Muchnik, L., Andrade Jr, J.S., Zheng, Z., Makse, H.A., Searching for superspreaders of information in real-world social media. Sci. Rep., 4, 2014, 5547.
47. [47] Qu, B.-Y., Liang, J.J., Suganthan, P.N., Niching particle swarm optimization with local search for multi-modal optimization. Inf. Sci. 197 (2012), 131–143.
48. [48] Rahimkhani, K., Aleahmad, A., Rahgozar, M., Moeini, A., A fast algorithm for finding most influential people based on the linear threshold model. Expert Syst. Appl. 42:3 (2015), 1353–1361.
49. [49] Ren, Z., Jiang, H., Xuan, J., Hu, Y., Luo, Z., New insights into diversification of hyper-heuristics. IEEE Trans. Cybern. 44:10 (2014), 1747–1761.
50. [50] Saito, K., Kimura, M., Ohara, K., Motoda, H., Super mediator–a new centrality measure of node importance for information diffusion over social network. Inf. Sci. 329 (2016), 985–1000.
51. [51] Shi, Y., Eberhart, R., A modified particle swarm optimizer. Proceedings of the 1998 IEEE International Conference on Evolutionary Computation, 1998, IEEE, 69–73.
52. [52] Song, G., Zhou, X., Wang, Y., Xie, K., Influence maximization on large-scale mobile social network: a divide-and-conquer method. IEEE Trans. Parallel Distrib. Syst. 26:5 (2015), 1379–1392.
53. [53] Wang, Y., Cong, G., Song, G., Xie, K., Community-based greedy algorithm for mining top-k influential nodes in mobile social networks. Proceedings of the 16th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, 2010, ACM, 1039–1048.
54. [54] Weng, L., Menczer, F., Ahn, Y.-Y., Virality prediction and community structure in social networks. Sci. Rep., 3(8), 2012, 618.
55. [55] Xiong, T., Bao, Y., Hu, Z., Chiong, R., Forecasting interval time series using a fully complex-valued rbf neural network with dpso and pso algorithms. Inf. Sci. 305 (2015), 77–92.
56. [56] Xu, W., Wu, W., Fan, L., Lu, Z., Du, D.-Z., Influence diffusion in social networks. Optimization in Science and Engineering, 2014, Springer, 567–581.
57. [57] Xuan, J., Jiang, H., Ren, Z., Luo, Z., Solving the large scale next release problem with a backbone-based multilevel algorithm. IEEE Trans. Softw. Eng. 38:5 (2012), 1195–1212.
58. [58] Yang, Y., Zhang, J., Qin, R., Li, J., Wang, F.-Y., Qi, W., A budget optimization framework for search advertisements across markets. IEEE Trans. Syst. Man Cybern. Part A 42:5 (2012), 1141–1151.
59. [59] Yu, Z., Wang, C., Bu, J., Wang, X., Wu, Y., Chen, C., Friend recommendation with content spread enhancement in social networks. Inf. Sci. 309 (2015), 102–118.
60. [60] Zhang, X., Zhu, J., Wang, Q., Zhao, H., Identifying influential nodes in complex networks with community structure. Knowl. Based Syst. 42 (2013), 74–84.
61. [61] Zhang, Y., Gu, Q., Zheng, J., Chen, D., Estimate on expectation for influence maximization in social networks. Pacific-Asia Conference on Knowledge Discovery and Data Mining, 2010, Springer, 99–106.
62. [62] Zhu, T., Wang, B., Wu, B., Zhu, C., Maximizing the spread of influence ranking in social networks. Inf. Sci. 278 (2014), 535–544.
63. [63] Zhu, Z., Jia, S., He, S., Sun, Y., Ji, Z., Shen, L., Three-dimensional gabor feature extraction for hyperspectral imagery classification using a memetic framework. Inf. Sci. 298 (2015), 274–287.
64. [64] Zhu, Z., Xiao, J., He, S., Ji, Z., Sun, Y., A multi-objective memetic algorithm based on locality-sensitive hashing for one-to-many-to-one dynamic pickup-and-delivery problem. Inf. Sci. 329 (2016), 73–89.