Cited by 28

The DOI matches its Crossref record.

Extracting collective expectations about the future from large text collections

Jatowt, Adam, Au Yeung, Ching-man·2011·Proceedings of the 20th ACM international conference on Information and knowledge management

Abstract

News articles often contain information about the future. Given the huge volume of information available nowadays, an automatic way for extracting and summarizing future-related information is desirable. Such information will allow people to obtain a collective image of the future, to recognize possible future scenarios and be prepared for the future events. We propose a model-based clustering algorithm for detecting future events based on information extracted from a text corpus. The algorithm takes into account both textual and temporal similarity of sentences. We demonstrate that our algorithm can be used to discover future events and estimate their probabilities over time.

Overview

Integrity signals

Registry

Crossref · 10.1145/2063576.2063759

Cites

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.

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?

Citations

Cites

No references could be resolved yet.

Research works printed but not linked: 10

  1. 10.1145/1645953.1645968 · DOI
  2. R. Baeza-Yates. Searching the Future. In MF/IR 2005 , 2005 . R. Baeza-Yates. Searching the Future. In MF/IR 2005, 2005.
  3. W. B. Cavnar and J. M. Trenkle . N-Gram-Based Text Categorization. In SDAIR '94 , 161--175, 1994 . W. B. Cavnar and J. M. Trenkle. N-Gram-Based Text Categorization. In SDAIR '94, 161--175, 1994.
  4. 10.1145/1555400.1555420 · DOI · Paper page
  5. 10.1109/WI-IAT.2011.250 · DOI
  6. 10.1145/2009916.2010018 · DOI · Paper page
  7. 10.3115/1075218.1075228 · DOI · Paper page
  8. M. Matthews Searching through Time in the New York Times . In HCIR '10 , 2010 . M. Matthews et al. Searching through Time in the New York Times. In HCIR '10, 2010.
  9. 10.1145/1183614.1183627 · DOI
  10. X. Zhu , Z. Ghahramani , and J. Lafferty . Time-sensitive Dirichlet Process Mixture Models. Technical report , Carnegie Mellon University , 2005 .. X. Zhu, Z. Ghahramani, and J. Lafferty. Time-sensitive Dirichlet Process Mixture Models. Technical report, Carnegie Mellon University, 2005..

Cited by

Sorted by citations

See all 28

Metadata

Authors
Jatowt, A., & Au Yeung, C.-M.
Affiliations
  • Kyoto University, Kyoto, Japan
  • ASTRI, Hong Kong, Hong Kong
Venue
Proceedings of the 20th ACM international conference on Information and knowledge management
Publisher
ACM
Published
2011-10-24
Pages
1259-1264
Cited by
28
References
0

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