DeepCas: An End-to-end Predictor of Information Cascades
Open accessThe DOI matches its Crossref record; 41 of the 41 references it cites were found in a registry or an index.
Abstract
Information cascades, effectively facilitated by most social network platforms, are recognized as a major factor in almost every social success and disaster in these networks. Can cascades be predicted? While many believe that they are inherently unpredictable, recent work has shown that some key properties of information cascades, such as size, growth, and shape, can be predicted by a machine learning algorithm that combines many features. These predictors all depend on a bag of hand-crafting features to represent the cascade network and the global network structures. Such features, always carefully and sometimes mysteriously designed, are not easy to extend or to generalize to a different platform or domain.
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
ImageNet classification with deep convolutional neural networks
Krizhevsky, A., Sutskever, I., & Hinton, G. E. (2017) · Communications of the ACM · doi:10.1145/3065386 · Cited by 112,155
Hochreiter, S., & Schmidhuber, J. (1997) · Neural Computation · doi:10.1162/neco.1997.9.8.1735 · Cited by 102,318
Efficient Estimation of Word Representations in Vector Space
Mikolov, T., Chen, K., Corrado, G., & Dean, J. (2013) · arXiv · doi:10.48550/arxiv.1301.3781 · Cited by 26,568
Fast unfolding of communities in large networks
Blondel, V. D., Guillaume, J.-L., Lambiotte, R., & Lefebvre, E. (2008) · Journal of Statistical Mechanics: Theory and Experiment · doi:10.1088/1742-5468/2008/10/p10008 · Cited by 21,424
Fortunato, S. (2010) · Physics Reports · doi:10.1016/j.physrep.2009.11.002 · Cited by 11,293
node2vec: Scalable Feature Learning for Networks
Grover, A., & Leskovec, J. (2016) · Proceedings of the 22nd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining · doi:10.1145/2939672.2939754 · Cited by 10,926 · cited 2×
“For node2vec, we follow [16], p, q are selected from {0.”
MethodDeepWalk: online learning of social representations
Perozzi, B., Al-Rfou, R., & Skiena, S. (2014) · Proceedings of the 20th ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/2623330.2623732 · Cited by 10,123 · cited 6×
“Node2vec is a generalization of DeepWalk [29], which is reported to be outperforming alternative methods such as Deep-”
MethodInfluentialA Simple Model of Herd Behavior
Banerjee, A. V. (1992) · The Quarterly Journal of Economics · doi:10.2307/2118364 · Cited by 6,556
LINE: Large-scale Information Network Embedding
Tang, J., Qu, M., Wang, M., Zhang, M., Yan, J., & Mei, Q. (2015) · Proceedings of the 24th International Conference on World Wide Web · doi:10.1145/2736277.2741093 · Cited by 5,416 · cited 1×
“One treats cascade prediction as a classification problem [39, 20, 10, 11], which predicts whether or not a piece of information will become popular and wide-spread (above a certain threshold).”
BackgroundSelf-citationThe Network Structure Of Social Capital
Burt, R. S. (2000) · Research in Organizational Behavior · doi:10.1016/s0191-3085(00)22009-1 · Cited by 4,104
Networks, Crowds, and Markets: Reasoning about a Highly Connected World
Easley, D., & Kleinberg, J. (2010) · doi:10.1017/cbo9780511761942 · Cited by 2,590
A Theory of Fads, Fashion, Custom, and Cultural Change as Informational Cascades
Bikhchandani, S., Hirshleifer, D., & Welch, I. (1992) · Journal of Political Economy · doi:10.1086/261849 · Cited by 1,805
Convolutional Neural Networks on Graphs with Fast Localized Spectral Filtering
Defferrard, M., Bresson, X., & Vandergheynst, P. (2016) · arXiv (Cornell University) · doi:10.48550/arxiv.1606.09375 · Cited by 1,673
Weisfeiler-Lehman Graph Kernels
Shervashidze, N., Schweitzer, P., van Leeuwen, E. J., Mehlhorn, K., & Borgwardt, K. M. (2010) · Max Planck Digital Library · Cited by 1,644
Networks, Crowds, and Markets: Network Dynamics: Structural Models
Easley, D. A., & Kleinberg, J. M. (2010) · Cited by 1,447
Networks, Crowds, and Markets: Network Dynamics: Population Models
Easley, D. A., & Kleinberg, J. M. (2010) · Cited by 1,447
Sequential Sales, Learning, and Cascades
WELCH, I. (1992) · The Journal of Finance · doi:10.1111/j.1540-6261.1992.tb04406.x · Cited by 1,298
Yanardag, P., & Vishwanathan, S. V. N. (2015) · Proceedings of the 21th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining · doi:10.1145/2783258.2783417 · Cited by 1,021
On Graph Kernels: Hardness Results and Efficient Alternatives
Gärtner, T., Flach, P., & Wrobel, S. (2003) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-45167-9_11 · Cited by 879
Shortest-Path Kernels on Graphs
Borgwardt, K. M., & Kriegel, H. (2006) · Fifth IEEE International Conference on Data Mining (ICDM'05) · doi:10.1109/icdm.2005.132 · Cited by 837
Information contagion: an empirical study of the spread of news on digg and twitter social networks
Lerman, K., & Ghosh, R. (2010) · Proceedings of the International AAAI Conference on Web and Social Media · doi:10.1609/icwsm.v4i1.14021 · Cited by 813
Cheng, J., Adamic, L. A., Dow, P. A., Kleinberg, J. M., & Leskovec, J. (2014) · Cited by 787
Learning Convolutional Neural Networks for Graphs
Niepert, M., Ahmed, M. M., & Kutzkov, K. (2016) · arXiv (Cornell University) · doi:10.48550/arxiv.1605.05273 · Cited by 775
Structural diversity in social contagion
Ugander, J., Backstrom, L., Marlow, C., & Kleinberg, J. (2012) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.1116502109 · Cited by 695
Cheng, J., Adamic, L., Dow, P. A., Kleinberg, J. M., & Leskovec, J. (2014) · Proceedings of the 23rd international conference on World wide web · doi:10.1145/2566486.2567997 · Cited by 544
Ratkiewicz (2011) · doi:10.1145/1963192.1963301 · Cited by 541 · cited 2×
“As the follower/followee relations are not available in the data and Twitter does not disclose the retweet paths, we follow existing work [30] and draw an edge from Twitter user A to B if either B retweeted a message of A or A mentioned B in a Tweet.”
BackgroundMethodSEISMIC: A Self-Exciting Point Process Model for Predicting Tweet Popularity
Zhao, Q., Erdogdu, M. A., He, H. Y., Rajaraman, A., & Leskovec, J. (2015) · Proceedings of the 21th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining · doi:10.1145/2783258.2783401 · Cited by 478
What's in a hashtag?: content based prediction of the spread of ideas in microblogging communities
Tsur, O., & Rappoport, A. (2012) · Proceedings of the fifth ACM international conference on Web search and data mining · doi:10.1145/2124295.2124320 · Cited by 423
Analyzing and predicting viral tweets
Jenders, M., Kasneci, G., & Naumann, F. (2013) · Proceedings of the 22nd International Conference on World Wide Web · doi:10.1145/2487788.2488017 · Cited by 195
A predictive model for the temporal dynamics of information diffusion in online social networks
Guille, A., & Hacid, H. (2012) · Proceedings of the 21st International Conference on World Wide Web · doi:10.1145/2187980.2188254 · Cited by 192
Predicting Successful Memes Using Network and Community Structure
Weng, L., Menczer, F., & Ahn, Y.-Y. (2014) · Proceedings of the International AAAI Conference on Web and Social Media · doi:10.1609/icwsm.v8i1.14530 · Cited by 188
Tan, C., Lee, L., & Pang, B. (2014) · Proceedings of the 52nd Annual Meeting of the Association for Computational Linguistics (Volume 1: Long Papers) · doi:10.3115/v1/p14-1017 · Cited by 188
Representation Learning for Information Diffusion through Social Networks: an Embedded Cascade Model
Bourigault, S., Lamprier, S., & Gallinari, P. (2016) · ACM International Conference on Web Search and Data Mining (WSDM) · doi:10.1145/2835776.2835817 · Cited by 181
Prediction of retweet cascade size over time
Kupavskii, A., Ostroumova, L., Umnov, A., Usachev, S., Serdyukov, P., Gusev, G., & Kustarev, A. (2012) · Proceedings of the 21st ACM international conference on Information and knowledge management · doi:10.1145/2396761.2398634 · Cited by 170
Cascading outbreak prediction in networks: a data-driven approach
Cui, P., Jin, S., Yu, L., Wang, F., Zhu, W., & Yang, S. (2013) · ACM SIGKDD Conference on Knowledge Discovery and Data Mining (KDD) · doi:10.1145/2487575.2487639 · Cited by 140
subgraph2vec: Learning Distributed Representations of Rooted Sub-graphs from Large Graphs
Narayanan, A. S., Chandramohan, M., Chen, L., Liu, Y., & Saminathan, S. (2016) · arXiv (Cornell University) · doi:10.48550/arxiv.1606.08928 · Cited by 136
RAIN: Social Role-Aware Information Diffusion
Yang, Y., Tang, J., Leung, C. W.-K., Sun, Y., Chen, Q., Li, J., & Yang, Q. (2015) · Proceedings of the AAAI Conference on Artificial Intelligence · doi:10.1609/aaai.v29i1.9164 · Cited by 114
Whom to mention: expand the diffusion of tweets by @ recommendation on micro-blogging systems
Wang, B., Wang, C., Bu, J., Chen, C., Zhang, W. V., Cai, D., & He, X. (2013) · International World Wide Web Conference (WWW) · doi:10.1145/2488388.2488505 · Cited by 94
A structural smoothing framework for Robust graph-comparison
Yanardag, P., & Vishwanathan, S. V. N. (2015) · neural information processing systems · Cited by 76
Bauckhage, C., Hadiji, F., & Kersting, K. (2021) · Proceedings of the International AAAI Conference on Web and Social Media · doi:10.1609/icwsm.v9i1.14598 · Cited by 30
DeepGraph: Graph Structure Predicts Network GrowthPreprint
Li, C., Guo, X., & Mei, Q. (2016) · arXiv (Cornell University) · doi:10.48550/arxiv.1610.06251 · Cited by 20
Self-citation
Cited by
A Comprehensive Survey of Graph Embedding: Problems, Techniques, and Applications
Cai, H., Zheng, V. W., & Chang, K. C.-C. (2018) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2018.2807452 · Cited by 2,034
Cui, P., Wang, X., Pei, J., & Zhu, W. (2019) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2018.2849727 · Cited by 1,274
DeepInf: Social Influence Prediction with Deep Learning
Qiu, J., Tang, J., Ma, H., Dong, Y., Wang, K., & Tang, J. (2018) · Proceedings of the 24th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining · doi:10.1145/3219819.3220077 · Cited by 587
A Survey of Information Cascade Analysis: Models, Predictions, and Recent Advances
Zhou, F., Xu, X., Trajcevski, G., & Zhang, K. (2022) · ACM Computing Surveys · doi:10.1145/3433000 · Cited by 259
Metadata
- Authors
- Li, C., Ma, J., Guo, X., & Mei, Q.
- Venue
- Proceedings of the 26th International Conference on World Wide Web
- Published
- 2017-04-03
- Pages
- 577-586
- OpenAlex
- W2551441958
- Cited by
- 296
- References
- 41
- FWCI
- 32.81
- Type
- conference paper
- Language
- en
- Open access
- hybrid
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.