The DOI matches its Crossref record; 96 of the 96 references it cites were found in a registry or an index.
A survey on influence maximization in a social network
Open accessAbstract
Given a social network with diffusion probabilities as edge weights and a positive integer k, which k nodes should be chosen for initial injection of information to maximize the influence in the network? This problem is popularly known as the Social Influence Maximization Problem (SIM Problem). This is an active area of research in computational social network analysis domain, since one and half decades or so. Due to its practical importance in various domains, such as viral marketing, target advertisement and personalized recommendation, the problem has been studied in different variants, and different solution methodologies have been proposed over the years. This paper presents a survey on the progress in and around SIM Problem. At last, it discusses current research trends and future research directions as well.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Centrality in social networks conceptual clarification
Freeman, L. C. (1978) · Social Networks · doi:10.1016/0378-8733(78)90021-7 · Cited by 17,062 · cited 1×
“– Centrality-based heuristics Centrality is a well-known measure in network analysis, which signifies howmuch importance a node has in the network [45,76].”
BackgroundThe anatomy of a large-scale hypertextual Web search engine
Brin, S., & Page, L. (1998) · Computer Networks and ISDN Systems · doi:10.1016/s0169-7552(98)00110-x · Cited by 16,004
Reducibility among Combinatorial Problems
Karp, R. M. (1972) · Complexity of Computer Computations · doi:10.1007/978-1-4684-2001-2_9 · Cited by 11,511
Fortunato, S. (2010) · Physics Reports · doi:10.1016/j.physrep.2009.11.002 · Cited by 11,293
Finding community structure in very large networks
Clauset, A., Newman, M. E. J., & Moore, C. (2004) · Physical Review E · doi:10.1103/physreve.70.066111 · Cited by 7,390
Maximizing the spread of influence through a social network
Kempe, D., Kleinberg, J., & Tardos, É. (2003) · Proceedings of the ninth ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/956750.956769 · Cited by 7,326
Nature-Inspired Metaheuristic Algorithms
Yang, X. (2008) · Medical Entomology and Zoology · Cited by 4,556
Mining the network value of customers
Domingos, P., & Richardson, M. (2001) · Proceedings of the seventh ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/502512.502525 · Cited by 2,830
The spread of behavior in an online social network experiment
Centola, D. (2010) · Science · doi:10.1126/science.1185231 · Cited by 2,692
Cost-effective outbreak detection in networks
Leskovec, J., Krause, A., Guestrin, C., Faloutsos, C., VanBriesen, J., & Glance, N. (2007) · Proceedings of the 13th ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/1281192.1281239 · Cited by 2,502
Graphs over time: densification laws, shrinking diameters and possible explanations
Leskovec, J., Kleinberg, J., & Faloutsos, C. (2005) · Proceedings of the eleventh ACM SIGKDD international conference on Knowledge discovery in data mining · doi:10.1145/1081870.1081893 · Cited by 2,281
Efficient influence maximization in social networks
Chen, W., Wang, Y., & Yang, S. (2009) · Proceedings of the 15th ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/1557019.1557047 · Cited by 2,156
The dynamics of viral marketing
Leskovec, J., Adamic, L. A., & Huberman, B. A. (2007) · ACM Transactions on the Web · doi:10.1145/1232722.1232727 · Cited by 2,032
TwitterRank: finding topic-sensitive influential twitterers
Weng, J., Lim, E.-P., Jiang, J., & He, Q. (2010) · Proceedings of the third ACM international conference on Web search and data mining · doi:10.1145/1718487.1718520 · Cited by 1,742
Scalable influence maximization for prevalent viral marketing in large-scale social networks
Chen, W., Wang, C., & Wang, Y. (2010) · Proceedings of the 16th ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/1835804.1835934 · Cited by 1,731
Everyone's an influencer: quantifying influence on twitter
Bakshy, E., Hofman, J. M., Mason, W. A., & Watts, D. J. (2011) · Proceedings of the fourth ACM international conference on Web search and data mining · doi:10.1145/1935826.1935845 · Cited by 1,689
Network models of the diffusion of innovations
Valente, T. (1996) · Computational and Mathematical Organization Theory · doi:10.1007/bf00240425 · Cited by 1,630
Mining knowledge-sharing sites for viral marketing
Richardson, M., & Domingos, P. (2002) · Proceedings of the eighth ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/775047.775057 · Cited by 1,612
Fundamentals of Parameterized Complexity
Downey, R. G., & Fellows, M. R. (2013) · Texts in Computer Science · doi:10.1007/978-1-4471-5559-1 · Cited by 1,411
The Design of Approximation Algorithms
Williamson, D. P., & Shmoys, D. B. (2011) · Cambridge University Press eBooks · doi:10.1017/cbo9780511921735 · Cited by 1,301
Social network thresholds in the diffusion of innovations
Valente, T. W. (1996) · Social Networks · doi:10.1016/0378-8733(95)00256-1 · Cited by 1,041
Information diffusion through blogspace
Gruhl, D., Guha, R., Liben-Nowell, D., & Tomkins, A. (2004) · Proceedings of the 13th international conference on World Wide Web · doi:10.1145/988672.988739 · Cited by 1,041
Learning influence probabilities in social networks
Goyal, A., Bonchi, F., & Lakshmanan, L. V. S. (2010) · Proceedings of the third ACM international conference on Web search and data mining · doi:10.1145/1718487.1718518 · Cited by 1,022
The budgeted maximum coverage problem
Khuller, S., Moss, A., & Naor, J. (. (1999) · Information Processing Letters · doi:10.1016/s0020-0190(99)00031-9 · Cited by 982
Influential Nodes in a Diffusion Model for Social Networks
Kempe, D., Kleinberg, J., & Tardos, É. (2005) · Lecture Notes in Computer Science · doi:10.1007/11523468_91 · Cited by 948
Scalable Influence Maximization in Social Networks under the Linear Threshold Model
Chen, W., Yuan, Y., & Zhang, L. (2010) · 2010 IEEE International Conference on Data Mining · doi:10.1109/icdm.2010.118 · Cited by 924
Network structure and the diffusion of knowledge
Cowan, R., & Jonard, N. (2004) · Journal of Economic Dynamics and Control · doi:10.1016/j.jedc.2003.04.002 · Cited by 910
User interactions in social networks and their implications
Wilson, C., Boe, B., Sala, A., Puttaswamy, K. P. N., & Zhao, B. Y. (2009) · Proceedings of the 4th ACM European conference on Computer systems · doi:10.1145/1519065.1519089 · Cited by 879
Theory of rumour spreading in complex social networks
Nekovee, M., Moreno, Y., Bianconi, G., & Marsili, M. (2007) · Physica A: Statistical Mechanics and its Applications · doi:10.1016/j.physa.2006.07.017 · Cited by 796
Influence Maximization in Near-Linear Time: A Martingale Approach
Tang, Y., Shi, Y., & Xiao, X. (2015) · Proceedings of the 2015 ACM SIGMOD International Conference on Management of Data · doi:10.1145/2723372.2723734 · Cited by 768
A high-resolution human contact network for infectious disease transmission
Salathé, M., Kazandjieva, M., Lee, J. W., Levis, P., Feldman, M. W., & Jones, J. H. (2010) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.1009094108 · Cited by 739
Influence Maximization on Social Graphs: A Survey
Li, Y., Fan, J., Wang, Y., & Tan, K.-L. (2018) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2018.2807843 · Cited by 659
Maximizing Social Influence in Nearly Optimal Time
Borgs, C., Brautbar, M., Chayes, J., & Lucier, B. (2014) · Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms · doi:10.1137/1.9781611973402.70 · Cited by 624
Modeling Information Diffusion in Implicit Networks
Yang, J., & Leskovec, J. (2010) · 2010 IEEE International Conference on Data Mining · doi:10.1109/icdm.2010.22 · Cited by 550
Community-based greedy algorithm for mining top-K influential nodes in mobile social networks
Wang, Y., Cong, G., Song, G., & Xie, K. (2010) · Proceedings of the 16th ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/1835804.1835935 · Cited by 541
Xie, J., Szymanski, B. K., & Liu, X. (2011) · 2011 IEEE 11th International Conference on Data Mining Workshops · doi:10.1109/icdmw.2011.154 · Cited by 519
SIMPATH: An Efficient Algorithm for Influence Maximization under the Linear Threshold Model
Goyal, A., Lu, W., & Lakshmanan, L. V. S. (2011) · 2011 IEEE 11th International Conference on Data Mining · doi:10.1109/icdm.2011.132 · Cited by 508
A Critical Review of Centrality Measures in Social Networks
Landherr, A., Friedl, B., & Heidemann, J. (2010) · Business & Information Systems Engineering · doi:10.1007/s12599-010-0127-3 · Cited by 455
Tractable Models for Information Diffusion in Social Networks
Kimura, M., & Saito, K. (2006) · Lecture Notes in Computer Science · doi:10.1007/11871637_27 · Cited by 444
IRIE: Scalable and Robust Influence Maximization in Social Networks
Jung, K., Heo, W., & Chen, W. (2012) · Proceedings · doi:10.1109/icdm.2012.79 · Cited by 441
Prediction of Information Diffusion Probabilities for Independent Cascade Model
Saito, K., Nakano, R., & Kimura, M. (2008) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-85567-5_9 · Cited by 436
A data-based approach to social influence maximization
Goyal, A., Bonchi, F., & Lakshmanan, L. V. S. (2011) · Proceedings of the VLDB Endowment · doi:10.14778/2047485.2047492 · Cited by 428
The structure of online diffusion networks
Goel, S., Watts, D. J., & Goldstein, D. G. (2012) · Proceedings of the 13th ACM Conference on Electronic Commerce · doi:10.1145/2229012.2229058 · Cited by 385
A simplified NP-complete satisfiability problem
Tovey, C. A. (1984) · Discrete Applied Mathematics · doi:10.1016/0166-218x(84)90081-7 · Cited by 382
A Shapley Value-Based Approach to Discover Influential Nodes in Social Networks
Narayanam, R., & Narahari, Y. (2011) · IEEE Transactions on Automation Science and Engineering · doi:10.1109/tase.2010.2052042 · Cited by 382
Scalable influence maximization for independent cascade model in large-scale social networks
Wang, C., Chen, W., & Wang, Y. (2012) · Data Mining and Knowledge Discovery · doi:10.1007/s10618-012-0262-1 · Cited by 368
Influence Maximization in Social Networks When Negative Opinions May Emerge and Propagate
Chen, W., Collins, A., Cummings, R., Ke, T., Liu, Z., Rincon, D., Sun, X., Wang, Y., Wei, W., & Yuan, Y. (2011) · Proceedings of the 2011 SIAM International Conference on Data Mining · doi:10.1137/1.9781611972818.33 · Cited by 352
2021 IEEE Congress on Evolutionary Computation (CEC)
(2021) · doi:10.1109/cec45853.2021 · Cited by 350
Stop-and-Stare: Optimal Sampling Algorithms for Viral Marketing in Billion-scale Networks
Nguyen, H. T., Thai, M. T., & Dinh, T. N. (2016) · Proceedings of the 2016 International Conference on Management of Data · doi:10.1145/2882903.2915207 · Cited by 346
Approximating the value of two power proof systems, with applications to MAX 2SAT and MAX DICUT
Feige, U., & Goemans, M. (2002) · Proceedings Third Israel Symposium on the Theory of Computing and Systems · doi:10.1109/istcs.1995.377033 · Cited by 328
Influence analysis in social networks: A survey
Peng, S., Zhou, Y., Cao, L., Yu, S., Niu, J., & Jia, W. (2018) · Journal of Network and Computer Applications · doi:10.1016/j.jnca.2018.01.005 · Cited by 308
Influence maximization in social networks based on discrete particle swarm optimization
Gong, M., Yan, J., Shen, B., Ma, L., & Cai, Q. (2016) · Information Sciences · doi:10.1016/j.ins.2016.07.012 · Cited by 297
Metrics for Community Analysis: A Survey
Chakraborty, T., Dalmia, A., Mukherjee, A., & Ganguly, N. (2018) · ACM Computing Surveys · doi:10.1145/3091106 · Cited by 296
Simulated Annealing Based Influence Maximization in Social Networks
Jiang, Q., Song, G., Gao, C., Wang, Y., Si, W., & Xie, K. (2011) · Proceedings of the AAAI Conference on Artificial Intelligence · doi:10.1609/aaai.v25i1.7838 · Cited by 288
Mining social networks using heat diffusion processes for marketing candidates selection
Ma, H., Yang, H., Lyu, M. R., & King, I. (2008) · Proceedings of the 17th ACM conference on Information and knowledge management · doi:10.1145/1458082.1458115 · Cited by 250
Adaptive Influence Maximization in Dynamic Social Networks
Tong, G., Wu, W., Tang, S., & Du, D.-Z. (2017) · IEEE/ACM Transactions on Networking · doi:10.1109/tnet.2016.2563397 · Cited by 219
Modeling and Simulation Study of the Propagation and Defense of Internet E-mail Worms
Zou, C. C., Towsley, D., & Gong, W. (2007) · IEEE Transactions on Dependable and Secure Computing · doi:10.1109/tdsc.2007.1001 · Cited by 201
Local majorities, coalitions and monopolies in graphs: a review
Peleg, D. (2002) · Theoretical Computer Science · doi:10.1016/s0304-3975(01)00055-x · Cited by 200
A Survey of Models and Algorithms for Social Influence Analysis
Sun, J., & Tang, J. (2011) · Social Network Data Analytics · doi:10.1007/978-1-4419-8462-3_7 · Cited by 199
CoFIM: A community-based framework for influence maximization on large-scale networks
Shang, J., Zhou, S., Li, X., Liu, L., & Wu, H. (2017) · Knowledge-Based Systems · doi:10.1016/j.knosys.2016.09.029 · Cited by 196
Li, Y., Chen, W., Wang, Y., & Zhang, Z.-L. (2013) · Proceedings of the sixth ACM international conference on Web search and data mining · doi:10.1145/2433396.2433478 · Cited by 194
Personalized recommendation driven by information flow
Song, X., Tseng, B. L., Lin, C.-Y., & Sun, M.-T. (2006) · Proceedings of the 29th annual international ACM SIGIR conference on Research and development in information retrieval · doi:10.1145/1148170.1148258 · Cited by 164
Opinion maximization in social networks
Gionis, A., Terzi, E., & Tsaparas, P. (2013) · SIAM International Conference on Data Mining · doi:10.1137/1.9781611972832.43 · Cited by 162
On Budgeted Influence Maximization in Social Networks
Nguyen, H. Q., & Zheng, R. (2013) · IEEE Journal on Selected Areas in Communications · doi:10.1109/jsac.2013.130610 · Cited by 158
Maximizing the Spread of Positive Influence in Online Social Networks
Zhang, H., Dinh, T. N., & Thai, M. T. (2013) · IEEE International Conference on Distributed Computing Systems (ICDCS) · doi:10.1109/icdcs.2013.37 · Cited by 126
Cost-aware Targeted Viral Marketing in billion-scale networks
Nguyen, H. T., Dinh, T. N., & Thaip, M. T. (2016) · IEEE Conference on Computer Communications (INFOCOM) · doi:10.1109/infocom.2016.7524377 · Cited by 119
Directed clustering coefficient as a measure of systemic risk in complex banking networks
Tabak, B. M., Takami, M. Y., Rocha, J. M. C., Cajueiro, D. O., & de Souza, S. R. S. (2013) · Physica A Statistical Mechanics and its Applications · doi:10.1016/j.physa.2013.09.010 · Cited by 116
A fast algorithm for finding most influential people based on the linear threshold model
Rahimkhani, K., Abolfazl Aleahmad, A., Rahgozar, M., & Moeini, A. (2014) · Expert Systems with Applications · doi:10.1016/j.eswa.2014.09.037 · Cited by 111
Holistic Influence Maximization
Galhotra, S., Arora, A., & Roy, S. (2016) · ACM SIGMOD International Conference on Management of Data (SIGMOD) · doi:10.1145/2882903.2882929 · Cited by 110
Understanding Graph Sampling Algorithms for Social Network Analysis
Wang, T., Chen, Y., Zhang, Z., Xu, T., Jin, L., Hui, P., Deng, B., & Li, X. (2011) · IEEE International Conference on Distributed Computing Systems Workshops (ICDCSW) · doi:10.1109/icdcsw.2011.34 · Cited by 109
Social Network Analysis with Content and Graphs
Campbell, W. M., Dagli, C. K., & Weinstein, C. J. (2013) · Cited by 101
Selecting Information Diffusion Models over Social Networks for Behavioral Analysis
Saito, K., Kimura, M., Ohara, K., & Motoda, H. (2010) · Lecture notes in computer science · doi:10.1007/978-3-642-15939-8_12 · Cited by 99
Multi-Round Influence Maximization
Sun, L., Huang, W., Yu, P. S., & Chen, W. (2018) · ACM SIGKDD Conference on Knowledge Discovery and Data Mining (KDD) · doi:10.1145/3219819.3220101 · Cited by 98
Stop-and-Stare: Optimal Sampling Algorithms for Viral Marketing in Billion-scale NetworksPreprint
Nguyen, H. T., Thai, M. T., & Dinh, T. N. (2016) · arXiv (Cornell University) · doi:10.48550/arxiv.1605.07990 · Cited by 91
A Billion-Scale Approximation Algorithm for Maximizing Benefit in Viral Marketing
Nguyen, H. T., Thai, M. T., & Dinh, T. N. (2017) · IEEE/ACM Transactions on Networking · doi:10.1109/tnet.2017.2691544 · Cited by 90
Liu, B. (2011) · Springer eBooks · doi:10.1007/978-3-642-19460-3_7 · Cited by 89
On tractable cases of Target Set Selection
Nichterlein, A., Niedermeier, R., Uhlmann, J., & Weller, M. (2012) · Social Network Analysis and Mining · doi:10.1007/s13278-012-0067-7 · Cited by 87
Maximizing influence in a social network: Improved results using a genetic algorithm
Zhang, K., Du, H., & Feldman, M. W. (2017) · Physica A Statistical Mechanics and its Applications · doi:10.1016/j.physa.2017.02.067 · Cited by 83
A Query Approach for Influence Maximization on Specific Users in Social Networks
Lee, J.-R., & Chung, C. (2014) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2014.2330833 · Cited by 78
Bootstrap Percolation in High Dimensions
Balogh, J., Bollobás, B., & Morris, R. (2010) · Combinatorics Probability Computing · doi:10.1017/s0963548310000271 · Cited by 75
Recent Advances in Information Diffusion and Influence Maximization of Complex Social Networks
Zhang, H., Mishra, S., & Thai, M. T. (2014) · CRC Press eBooks · doi:10.1201/b17231-3 · Cited by 60
The Meme Ranking Problem: Maximizing Microblogging Virality
Ienco, D., Bonchi, F., & Castillo, C. (2010) · IEEE ... International Conference on Data Mining workshops · doi:10.1109/icdmw.2010.127 · Cited by 57
An efficient and effective hop-based approach for influence maximization in social networks
Tang, J., Tang, X., & Yuan, J. (2018) · Social Network Analysis and Mining · doi:10.1007/s13278-018-0489-y · Cited by 56
Learning from Bees: An Approach for Influence Maximization on Viral Campaigns
Sankar, C. P., Asharaf, S., & Kumar, K. S. (2016) · PLoS ONE · doi:10.1371/journal.pone.0168125 · Cited by 54
Parameterized circuit complexity and the W hierarchy
Downey, R. G., Fellows, M. R., & Regan, K. W. (1998) · Theoretical Computer Science · doi:10.1016/s0304-3975(96)00317-9 · Cited by 45
Diffusion centrality: A paradigm to maximize spread in social networks
Kang, C., Kraus, S., Molinaro, C., Spezzano, F., & Subrahmanian, V. S. (2016) · Artificial Intelligence · doi:10.1016/j.artint.2016.06.008 · Cited by 42
Maximizing Welfare in Social Networks under A Utility Driven Influence Diffusion model
Banerjee, P., Chen, W., & Lakshmanan, L. V. S. (2019) · ACM SIGMOD International Conference on Management of Data (SIGMOD) · doi:10.1145/3299869.3319879 · Cited by 32
Influence Propagation over Large Scale Social Networks
Cordasco, G., Gargano, L., & Rescigno, A. A. (2015) · IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining (ASONAM) · doi:10.1145/2808797.2808888 · Cited by 21
Angell, R., & Schoenebeck, G. (2016) · Workshop on Internet and Network Economics · doi:10.1007/978-3-319-71924-5_2 · Cited by 21
Parameterized Algorithms for Generalized Domination
Raman, V., Saurabh, S., & Srihari, S. (2008) · Lecture notes in computer science · doi:10.1007/978-3-540-85097-7_11 · Cited by 19
A Fast and Effective Heuristic for Discovering Small Target Sets in Social Networks
Cordasco, G., Gargano, L., Mecchia, M., Rescigno, A. A., & Vaccaro, U. (2015) · Lecture notes in computer science · doi:10.1007/978-3-319-26626-8_15 · Cited by 15
Kasprzyk, R. (2012) · Journal of Telecommunications and Information Technology · doi:10.26636/jtit.2012.2.1270 · Cited by 12
Discrete particle swarm optimization based influence maximization in complex networks
Wang, Q., Gong, M., Song, C., & Wang, S. (2017) · IEEE Congress on Evolutionary Computation (CEC) · doi:10.1109/cec.2017.7969351 · Cited by 11
Real-Time Targeted-Influence Queries over Large Graphs
Epasto, A., Mahmoody, A., & Upfal, E. (2017) · IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining (ASONAM) · doi:10.1145/3110025.3110105 · Cited by 2
Modeling Information Diffusion in Social NetworksPreprint
Heidari, N. (2016) · arXiv (Cornell University) · doi:10.48550/arxiv.1603.02178 · Cited by 1
Metadata
- Authors
- Banerjee, S., Jenamani, M., & Pratihar, D. K.
- Venue
- Knowledge and Information Systems
- Published
- 2020-03-29
- Volume
- 62
- Issue
- 9
- Pages
- 3417-3455
- ISSN
- 0219-1377 (ISSN-L)
- 0219-3116
- OpenAlex
- W2887566697
- Cited by
- 262
- References
- 96
- FWCI
- 15.32
- Type
- journal article
- Language
- en
- Open access
- green
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.