Building a hierarchy of events and topics for newspaper digital libraries

8Citations
Citations of this article
13Readers
Mendeley users who have this article in their library.
Get full text

Abstract

In this paper we propose an incremental hierarchical clustering algorithm for on-line event detection. This algorithm is applied to a set of newspaper articles in order to discover the structure of topics and events that they describe. In the first level, articles with a high temporal-semantic similarity are clustered together into events. In the next levels of the hierarchy, these events are successively clustered so that composite events and topics can be discovered. The results obtained for the Fl-measure and the Detection Cost demonstrate the validity of our algorithm for on-line event detection tasks. © Springer-Verlag Berlin Heidelberg 2003.

Cite

CITATION STYLE

APA

Pons-Porrata, A., Berlanga-Llavori, R., & Ruiz-Shulcloper, J. (2003). Building a hierarchy of events and topics for newspaper digital libraries. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2633, 588–596. https://doi.org/10.1007/3-540-36618-0_46

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free