The DOI matches its Crossref record; 27 of the 27 references it cites were found in a registry or an index.
Cost-effective outbreak detection in networks
Open accessAbstract
Given a water distribution network, where should we place sensors toquickly detect contaminants? Or, which blogs should we read to avoid missing important stories?.
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
Boyd, S., & Vandenberghe, L. (2004) · doi:10.1017/cbo9780511804441 · Cited by 56,601
Rogers, E. M., Singhal, A., & Quinlan, M. M. (2019) · An Integrated Approach to Communication Theory and Research · doi:10.4324/9780203710753-35 · Cited by 37,322
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
An analysis of approximations for maximizing submodular set functions—I
Nemhauser, G. L., Wolsey, L. A., & Fisher, M. L. (1978) · Mathematical Programming · doi:10.1007/bf01588971 · Cited by 4,412
Gluesing, J. C. (2012) · Leadership in Science and Technology: A Reference Handbook · doi:10.4135/9781412994231.n14 · Cited by 3,210
Talk of the Network: A Complex Systems Look at the Underlying Process of Word-of-Mouth
Goldenberg, J., Libai, B., & Muller, E. (2001) · Marketing Letters · doi:10.1023/a:1011122126881 · Cited by 1,995
The Mathematical Theory of Infectious Diseases and its applications
Ling, N. R. (1978) · Immunology · Cited by 1,934
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
Immunization of complex networks
Pastor-Satorras, R., & Vespignani, A. (2002) · Physical Review E · doi:10.1103/physreve.65.036104 · Cited by 1,278
Efficient Immunization Strategies for Computer Networks and Populations
Cohen, R., Havlin, S., & ben-Avraham, D. (2003) · Physical Review Letters · doi:10.1103/physrevlett.91.247901 · Cited by 1,162
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
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
The Mathematical Theory of Infectious Diseases and Its Applications
Giles, P., & Bailey, N. T. J. (1977) · Operational Research Quarterly (1970-1977) · doi:10.2307/3009004 · Cited by 937
Information diffusion through blogspace
Gruhl, D., Liben-Nowell, D., Guha, R., & Tomkins, A. (2004) · ACM SIGKDD Explorations Newsletter · doi:10.1145/1046456.1046462 · Cited by 927
An analysis of approximations for maximizing submodular set functions - 1Preprint
Fisher, M. L., Nemhauser, G. L., & Wolsey, L. A. (1978) · RePEc: Research Papers in Economics · Cited by 855
A note on maximizing a submodular set function subject to a knapsack constraint
Sviridenko, M. (2004) · Operations Research Letters · doi:10.1016/s0167-6377(03)00062-2 · Cited by 690
Patterns of Cascading Behavior in Large Blog Graphs
Leskovec, J., McGlohon, M., Faloutsos, C., Glance, N., & Hurst, M. (2007) · Proceedings of the 2007 SIAM International Conference on Data Mining · doi:10.1137/1.9781611972771.60 · Cited by 570
Self-citationOn the bursty evolution of blogspace
Kumar, R., Novak, J., Raghavan, P., & Tomkins, A. (2003) · Proceedings of the twelfth international conference on World Wide Web - WWW '03 · doi:10.1145/775152.775233 · Cited by 553
Efficient Sensor Placement Optimization for Securing Large Water Distribution Networks
Krause, A., Leskovec, J., Guestrin, C., VanBriesen, J., & Faloutsos, C. (2008) · Journal of Water Resources Planning and Management · doi:10.1061/(asce)0733-9496(2008)134:6(516 · Cited by 414
Self-citationThe dynamics of viral marketing
Leskovec, J., Adamic, L. A., & Huberman, B. A. (2006) · Proceedings of the 7th ACM conference on Electronic commerce · doi:10.1145/1134707.1134732 · Cited by 391
Self-citationOptimal Layout of Early Warning Detection Stations for Water Distribution Systems Security
Ostfeld, A., & Salomons, E. (2004) · Journal of Water Resources Planning and Management · doi:10.1061/(asce)0733-9496(2004)130:5(377 · Cited by 339
The EPANET Programmer's Toolkit for Analysis of Water Distribution Systems
Rossman, L. A. (1999) · ASCE Annual Water Resources Planning and Management Conference (WRPMD) · doi:10.1061/40430(1999)39 · Cited by 223
Cascading Behavior in Large Blog Graphs
Leskovec, J., McGlohon, M., Faloutsos, C., Glance, N., & Hurst, M. F. (2007) · Cited by 133
Self-citationAn Efficient Algorithm for Sensor Placement in Water Distribution Systems
Dorini, G., Jonkergouw, P., Kapelan, Z. S., di Pierro, F., Khu, S. T., & Savic, D. A. (2008) · doi:10.1061/40941(247)101 · Cited by 63
An Accelerated Sequential Algorithm for Producing D -Optimal Designs
Robertazzi, T. G., & Schwartz, S. C. (1989) · SIAM Journal on Scientific and Statistical Computing · doi:10.1137/0910022 · Cited by 42
Predator - Prey Model for Discrete Sensor Placement
Gueli, R. (2008) · doi:10.1061/40941(247)104 · Cited by 33
(2008) · doi:10.1061/(asce)0733-9496(2008)134:6(556
Cited by
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
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
Entropy rate superpixel segmentation
Liu, M.-Y., Tuzel, O., Ramalingam, S., & Chellappa, R. (2011) · CVPR 2011 · doi:10.1109/cvpr.2011.5995323 · Cited by 1,026
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
Patterns of temporal variation in online media
Yang, J., & Leskovec, J. (2011) · Proceedings of the fourth ACM international conference on Web search and data mining · doi:10.1145/1935826.1935863 · Cited by 986
Self-citation
Metadata
- Authors
- Leskovec, J., Krause, A., Guestrin, C., Faloutsos, C., VanBriesen, J., & Glance, N.
- Venue
- Proceedings of the 13th ACM SIGKDD international conference on Knowledge discovery and data mining
- Publisher
- ACM
- Published
- 2007-08-12
- Pages
- 420-429
- OpenAlex
- W2141403143
- Cited by
- 2,502
- References
- 27
- FWCI
- 38.08
- Type
- conference paper
- 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.