The DOI matches its Crossref record; 20 of the 20 references it cites were found in a registry or an index.
SIMPATH: An Efficient Algorithm for Influence Maximization under the Linear Threshold Model
Abstract
There is significant current interest in the problem of influence maximization: given a directed social network with influence weights on edges and a number k, find k seed nodes such that activating them leads to the maximum expected number of activated nodes, according to a propagation model. Kempe et al. showed, among other things, that under the Linear Threshold Model, the problem is NP-hard, and that a simple greedy algorithm guarantees the best possible approximation factor in PTIME. However, this algorithm suffers from various major performance drawbacks. In this paper, we propose SIMPATH, an efficient and effective algorithm for influence maximization under the linear threshold model that addresses these drawbacks by incorporating several clever optimizations. Through a comprehensive performance study on four real data sets, we show that SIMPATH consistently outperforms the state of the art w.r.t. running time, memory consumption and the quality of the seed set chosen, measured in terms of expected influence spread achieved.
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
(1979) · Cited by 43,841
The 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
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
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
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
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 Complexity of Enumeration and Reliability Problems
Valiant, L. G. (1979) · SIAM Journal on Computing · doi:10.1137/0208032 · Cited by 2,076
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
A matrix factorization technique with trust propagation for recommendation in social networks
Jamali, M., & Ester, M. (2010) · Proceedings of the fourth ACM conference on Recommender systems · doi:10.1145/1864708.1864736 · Cited by 1,632
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
Self-citationScalable 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
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
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
Self-citationPersonalized 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
A better approximation ratio for the vertex cover problem
Karakostas, G. (2009) · ACM Transactions on Algorithms · doi:10.1145/1597036.1597045 · Cited by 156
Folks in Folksonomies: Social Link Prediction from Shared MetadataPreprint
Schifanella, R., Barrat, A., Cattuto, C., Markines, B., & Menczer, F. (2010) · arXiv (Cornell University) · doi:10.48550/arxiv.1003.2281 · Cited by 138
Folks in Folksonomies: social link prediction from shared metadata
Schifanella, R., Barrat, A., Cattuto, C., Markines, B., & Menczer, F. (2010) · ACM International Conference on Web Search and Data Mining (WSDM) · doi:10.1145/1718487.1718521 · Cited by 138
Cited by
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
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
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
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
A survey on influence maximization in a social network
Banerjee, S., Jenamani, M., & Pratihar, D. K. (2020) · Knowledge and Information Systems · doi:10.1007/s10115-020-01461-4 · Cited by 262
Metadata
- Authors
- Goyal, A., Lu, W., & Lakshmanan, L. V. S.
- Venue
- 2011 IEEE 11th International Conference on Data Mining
- Publisher
- IEEE
- Published
- 2011-12
- Pages
- 211-220
- ISSN
- 1550-4786 (ISSN-L)
- OpenAlex
- W1990570693
- Cited by
- 508
- References
- 20
- FWCI
- 15.49
- Type
- conference paper
- Language
- en
- Open access
- closed
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.