Detecting bursty terms in computer science research
The DOI matches its Crossref record; 6 of the 6 references it cites were found in a registry or an index.
Abstract
Research topics rise and fall in popularity over time, some more swiftly than others. The fastest rising topics are typically called bursts; for example “deep learning”, “internet of things” and “big data”. Being able to automatically detect and track bursty terms in the literature could give insight into how scientific thought evolves over time. In this paper, we take a trend detection algorithm from stock market analysis and apply it to over 30 years of computer science research abstracts, treating the prevalence of each term in the dataset like the price of a stock. Unlike previous work in this domain, we use the free text of abstracts and titles, resulting in a finer-grained analysis. We report a list of bursty terms, and then use historical data to build a classifier to predict whether they will rise or fall in popularity in the future, obtaining accuracy in the region of 80%. The proposed methodology can be applied to any time-ordered collection of text to yield past and present bursty terms and predict their probable fate.
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.
Claims other papers make about this one
Each is checked against this paper’s own text: does it say what the citing paper says it does?
In the citing paper
“Unlike latent-topic (Blei & Lafferty, 2006;Griffiths & Steyvers, 2004;Jelodar et al., 2019) and graph-based methods (Chen, 2006;Hou et al., 2018), n-gram analysis is grounded in observable linguistic patterns, allowing direct interpretability and traceability (Tattershall et al., 2020).”
From Identifying and evaluating emerging scientific trends through temporal n-gram analysis (2026) · cites this paper as Tattershall et al., 2020
In the citing paper
“To complement this and better handle discrete time-series data, the Moving Average Convergence Divergence (MACD) indicator is employed, a computationally efficient method from financial analysis adapted for term-frequency data (He & Parker, 2010;Tattershall et al., 2020).”
From Identifying and evaluating emerging scientific trends through temporal n-gram analysis (2026) · cites this paper as Tattershall et al., 2020
In the citing paper
“However, its core assumption of a continuous event stream is a known limitation when applied to scientific literature, which is published in discrete batches (Tattershall et al., 2020).”
From Identifying and evaluating emerging scientific trends through temporal n-gram analysis (2026) · cites this paper as Tattershall et al., 2020
In the citing paper
“Most trend detection systems rely on indirect validation, such as alignment with expert-curated taxonomies or retrospective correlation with later citation counts (Kleinberg, 2002;Tattershall et al., 2020;Wei et al., 2022).”
From Identifying and evaluating emerging scientific trends through temporal n-gram analysis (2026) · cites this paper as Tattershall et al., 2020
In the citing paper
“Relative to earlier studies, the approach is adapted to raw n-gram counts, avoiding reliance on document-level statistics required by the normalization scheme of Tattershall et al. (2020) and is run at quarterly rather than yearly resolution to better capture fast-moving trends.”
From Identifying and evaluating emerging scientific trends through temporal n-gram analysis (2026) · cites this paper as Tattershall et al. (2020)
1 more claim about this paper
Create a free account to see every claim other papers make about this one.
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
Learning representations by back-propagating errors
Rumelhart, D. E., Hinton, G. E., & Williams, R. J. (1986) · Nature · doi:10.1038/323533a0 · Cited by 31,892
The rise of deep learning in drug discovery
Chen, H., Engkvist, O., Wang, Y., Olivecrona, M., & Blaschke, T. (2018) · Drug Discovery Today · doi:10.1016/j.drudis.2018.01.039 · Cited by 1,770
Bornmann, L., & Mutz, R. (2015) · Journal of the Association for Information Science and Technology · doi:10.1002/asi.23329 · Cited by 1,576
Bursty and hierarchical structure in streams
Kleinberg, J. (2002) · Proceedings of the eighth ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/775047.775061 · Cited by 1,337
Rotation-invariant convolutional neural networks for galaxy morphology prediction
Dieleman, S., Willett, K. W., & Dambre, J. (2015) · Monthly Notices of the Royal Astronomical Society · doi:10.1093/mnras/stv632 · Cited by 781
Research works printed but not linked: 24
- Allan, J., et al. (1998). Topic detection and tracking pilot study final report. In In Proceedings of the DARPA broadcast news transcription and understanding workshop (pp. 194–218).
- Allen Institute for Artificial Intelligence. (2015). Semantic scholar. Retrieved April 13, 2019 from https://www.semanticscholar.org/.
- Appel, G. (2005). Technical analysis: Power tools for active investors. Upper Saddle River: FT Press.
- Balili, C., Segev, A., & Lee, U. (2017). Tracking and predicting the evolution of research topics in scientific literature. In 2017 IEEE international conference on big data (big data) (pp. 1694–1697). · DOI
- Bird, S., Klein, E., & Loper, E. (2009). Natural language processing with python. Sebastopol: O’Reilly Media Inc.
- Blei, D. M., Ng, A. Y., & Jordan, M. I. (2003). Latent dirichlet allocation. Journal of Machine Learning Research, 3, 993–1022.
- Cavacini, A. (2015). What is the best database for computer science journal articles? Scientometrics, 102(3), 2059–2071. · DOI
- Diao, Q., Jiang, J., Zhu, F., & Lim, E. -P. (2012). Finding bursty topics from microblogs. In Proceedings of the 50th annual meeting of the association for computational linguistics: Long papers-volume 1, ACL ’12 (pp. 536–544).
- Fenn, J., & Raskino, M. (2008). Mastering the hype cycle: How to choose the right innovation at the right time. Gartner series. Brighton: Harvard Business Press.
- Fung, G. P. C., Yu, J. X., Yu, P. S., & Lu, H. (2005). Parameter free bursty events detection in text streams. In Proceedings of the 31st international conference on very large data bases, VLDB ’05 (pp. 181–192). VLDB Endowment.
- Griffiths, T. L., & Steyvers, M. (2004). Finding scientific topics. Proceedings of the National Academy of Sciences, 101(suppl 1), 5228–5235. · DOI · Paper page
- He, D., & Parker, D. S. (2010). Topic dynamics: An alternative model of bursts in streams of topics. In Proceedings of the 16th ACM SIGKDD international conference on knowledge discovery and data mining (pp. 443–452). · DOI · Paper page
- He, D., & Parker, D. S. (2011). Learning the funding momentum of research projects. In Advances in knowledge discovery and data mining (pp. 532–543). · doi:10.1007/978-3-642-20847-8_44
- Kahaner, D. (1994). Japanese activities in virtual reality. IEEE Computer Graphics and Applications, 14(1), 75–78. · doi:10.1109/38.250923
- Mane, K. K., & Borner, K. (2004). Mapping topics and topic bursts in PNAS. Proceedings of the National Academy of Sciences, 101(suppl 1), 5287–5290. · DOI · Paper page
- Mathioudakis, M., & Koudas, N. (2010). Twittermonitor: Trend detection over the twitter stream. In Proceedings of the 2010 ACM SIGMOD international conference on management of data, SIGMOD ’10 (pp. 1155–1158). · DOI · Paper page
- Mei, Q., & Zhai, C. (2005). Discovering evolutionary theme patterns from text: An exploration of temporal text mining. In Proceedings of the eleventh ACM SIGKDD international conference on knowledge discovery in data mining, KDD ’05 (pp. 198–207). · DOI · Paper page
- Murphy, J. (1999). Technical analysis of the financial markets: A comprehensive guide to trading methods and applications. New York: New York Institute of Finance.
- Prabhakaran, V., Hamilton, W. L., McFarland, D., & Jurafsky, D. (2016). Predicting the rise and fall of scientific topics from trends in their rhetorical framing. In Proceedings of the 54th annual meeting of the association for computational linguistics (volume 1: long papers) (pp. 1170–1180).
- Steyvers, M., Smyth, P., Rosen-Zvi, M., & Griffiths, T. (2004). Probabilistic author-topic models for information discovery. In Proceedings of the tenth ACM SIGKDD international conference on knowledge discovery and data mining, KDD ’04 (pp. 306–315). · DOI · Paper page
- Stroup, D., David Williamson, G., Herndon, L. J., & Karon, J. (1989). Detection of aberrations in the occurrence of notifiable diseases surveillance data. Statistics in Medicine, 8, 323–329. · DOI
- Takahashi, Y., Utsuro, T., Yoshioka, M., Kando, N., Fukuhara, T., Nakagawa, H., & Kiyota, Y. (2012). Applying a burst model to detect bursty topics in a topic model. In H. Isahara, K. Kanzaki (Eds.), Advances in natural language processing (pp. 239–249). Berlin: Springer. · DOI
- Wu, Y., Venkatramanan, S., Chiu, D. (2018). A population model for academia: Case study of the computer science community using DBLP bibliography 1960–2016. IEEE Transactions on Emerging Topics in Computing. https://doi.org/10.1109/TETC.2018.2855156. · DOI
- Zhang, X., & Shasha, D. (2006). Better burst detection. In 22nd international conference on data engineering (ICDE’06) (pp. 146–146). · DOI
Cited by
Identifying and evaluating emerging scientific trends through temporal n-gram analysis
Štimec, G., Novalija, I., Brank, J., Šturm, J., Topal, O., Gheorghe, M., Grobelnik, M., & Roman, D. (2026) · Scientometrics · doi:10.1007/s11192-026-05744-5
Metadata
- Authors
- Tattershall, E., Nenadic, G., & Stevens, R. D.
- Venue
- Scientometrics
- Published
- 2019-11-22
- Volume
- 122
- Issue
- 1
- Pages
- 681-699
- ISSN
- 0138-9130
- 1588-2861
- Cited by
- 21
- References
- 6
- Language
- en
- Licence
- creativecommons.org/licenses/by/4.0 (tdm)
- creativecommons.org/licenses/by/4.0 (vor)
- Funders
- Engineering and Physical Sciences Research Council (EP/I028099/1)
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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Detecting bursty terms in computer science research. https://app.cochat.ai/papers/10.1007/s11192-019-03307-5
- The paper
- Tattershall, E., Nenadic, G., & Stevens, R. D. (2020). Detecting bursty terms in computer science research. Scientometrics. https://doi.org/10.1007/s11192-019-03307-5
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.