CoChat

Detecting bursty terms in computer science research

Tattershall, E., Nenadic, G., Stevens, R. D. · 2020 · Scientometrics
Cited by 21

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.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1007/s11192-019-03307-5

Cites

6 of 6 references verified0 citation errors · 0 not checkable

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.

A few free checks a day · papers already verified open instantly · results are public

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?

1 more claim about this paper

Create a free account to see every claim other papers make about this one.

See all claims — free account

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

Show all 6 references

Research works printed but not linked: 24

  1. 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).
  2. Allen Institute for Artificial Intelligence. (2015). Semantic scholar. Retrieved April 13, 2019 from https://www.semanticscholar.org/.
  3. Appel, G. (2005). Technical analysis: Power tools for active investors. Upper Saddle River: FT Press.
  4. 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
  5. Bird, S., Klein, E., & Loper, E. (2009). Natural language processing with python. Sebastopol: O’Reilly Media Inc.
  6. Blei, D. M., Ng, A. Y., & Jordan, M. I. (2003). Latent dirichlet allocation. Journal of Machine Learning Research, 3, 993–1022.
  7. Cavacini, A. (2015). What is the best database for computer science journal articles? Scientometrics, 102(3), 2059–2071. · DOI
  8. 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).
  9. 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.
  10. 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.
  11. Griffiths, T. L., & Steyvers, M. (2004). Finding scientific topics. Proceedings of the National Academy of Sciences, 101(suppl 1), 5228–5235. · DOI · Paper page
  12. 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
  13. 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
  14. Kahaner, D. (1994). Japanese activities in virtual reality. IEEE Computer Graphics and Applications, 14(1), 75–78. · doi:10.1109/38.250923
  15. 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
  16. 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
  17. 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
  18. Murphy, J. (1999). Technical analysis of the financial markets: A comprehensive guide to trading methods and applications. New York: New York Institute of Finance.
  19. 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).
  20. 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
  21. 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
  22. 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
  23. 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
  24. Zhang, X., & Shasha, D. (2006). Better burst detection. In 22nd international conference on data engineering (ICDE’06) (pp. 146–146). · DOI

Cited by

See all 21

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
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.