CoChat

The DOI matches its Crossref record; 63 of the 65 references it cites were found in a registry or an index.

Bursty and hierarchical structure in streams

Kleinberg, Jon · 2002 · Proceedings of the eighth ACM SIGKDD international conference on Knowledge discovery and data mining

Abstract

A fundamental problem in text data mining is to extract meaningful structure from document streams that arrive continuously over time. E-mail and news articles are two natural examples of such streams, each characterized by topics that appear, grow in intensity for a period of time, and then fade away. The published literature in a particular research field can be seen to exhibit similar phenomena over a much longer time scale. Underlying much of the text mining work in this area is the following intuitive premise --- that the appearance of a topic in a document stream is signaled by a "burst of activity," with certain features rising sharply in frequency as the topic emerges.The goal of the present work is to develop a formal approach for modeling such "bursts," in such a way that they can be robustly and efficiently identified, and can provide an organizational framework for analyzing the underlying content. The approach is based on modeling the stream using an infinite-state automaton, in which bursts appear naturally as state transitions; in some ways, it can be viewed as drawing an analogy with models from queueing theory for bursty network traffic. The resulting algorithms are highly efficient, and yield a nested representation of the set of bursts that imposes a hierarchical structure on the overall stream. Experiments with e-mail and research paper archives suggest that the resulting structures have a natural meaning in terms of the content that gave rise to them.

Overview

Integrity signals

Registry

Crossref · 10.1145/775047.775061

Cites

63 of 63 references verified0 citation errors · 0 not checkable

Statistics

Recomputing p-values needs the paper’s full text.

Verification

Claims the paper makes

This paper’s full text isn’t openly available, so its claims and self-check weren’t run. The registry and citation checks still apply.

Citations

Cites

Show all 65 references

Research works printed but not linked: 21

  1. Agrawal R., 1995, Proc. Intl. Conf. on Data Engineering
  2. Allan J., 1998, DARPA Broadcast News Transcription and Understanding Workshop
  3. T. Blanton Ed. White House E-mail New Press 1995. T. Blanton Ed. White House E-mail New Press 1995.
  4. Chatman S., 1978, Cornell Univ. Press
  5. Cohen W., 1996, AAAI Spring Symp. Machine Learning and Information Access
  6. Genette G., 1980, Cornell Univ. Press
  7. G. Genette Narrative Discourse Revisited English translation (J.E. Lewin) Cornell Univ. Press 1988. G. Genette Narrative Discourse Revisited English translation (J.E. Lewin) Cornell Univ. Press 1988.
  8. Han J., 1998, Proc. Intl. Conf. Knowledge Discovery and Data Mining
  9. 10.5555/857190.857680 · doi:10.5555/857190.857680
  10. Kelly F. P., 1996, Press
  11. Keogh E., 1997, Intl. Conf. Knowledge Discovery and Data Mining
  12. Lavrenko V., 2000, KDD-2000 Workshop on Text Mining
  13. Mannila H., 1995, Intl. Conf. on Knowledge Discovery and Data Mining
  14. Martin R., 2001, Temporal Data Mining
  15. Miller N., 1998, IEEE Visualization
  16. Redmond M., 1998, AAAI Workshop on Case-Based Reasoning
  17. Rennie J., 2000, KDD Workshop on Text Mining
  18. Sahami M., 1998, AAAI Workshop on Learning for Text Categorization
  19. B. Schneier Applied Cryptography Wiley 1996. B. Schneier Applied Cryptography Wiley 1996.
  20. Segal R., 2000, Proc. Intl. Conf. on Machine Learning
  21. Wong P., 2000, IEEE Information Visualization

Cited by

Items 901–1,000 of 1,342

Metadata

Authors
Kleinberg, J.
Affiliations
Cornell University (US)
Corresponding author
Kleinberg, Jon
Venue
Proceedings of the eighth ACM SIGKDD international conference on Knowledge discovery and data mining
Publisher
ACM
Published
2002-07-23
Pages
91-101
OpenAlex
W2026302857
Cited by
1,337
References
65
Citations by year
2026: 101 · 2025: 68 · 2024: 63 · 2023: 77 · 2022: 43 · 2021: 44 · 2020: 45 · 2019: 41 · 2018: 58 · 2017: 61 · 2016: 59 · 2015: 92 · 2014: 73 · 2013: 81 · 2012: 70
FWCI
19.27
Type
conference paper
Language
en
Open access
closed
Locations
  • ACM SIGKDD Conference on Knowledge Discovery and Data Mining (KDD) (publishedVersion)
  • eCommons (Cornell University) (submittedVersion)
Topics
  • Physical Sciences › Computer Science › Artificial Intelligence › Advanced Text Analysis Techniques
  • Physical Sciences › Computer Science › Artificial Intelligence › Topic Modeling
  • Social Sciences › General Social Sciences › Computational and Text Analysis Methods
Keywords
document streams, burst detection, hierarchy, state transitions, email, topic emergence

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.