News topic tracking and re-ranking with query expansion based on near-duplicate detection

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

Abstract

Increase of digital storage capacity enabled the creation of large-scale news video archives. To make full use of the archive, it is necessary to grasp the development and dependencies of news stories. Considering this problem, we investigate tracking and re-ranking methodologies of news stories. The archive used as a test-bed consists of more than 30,000 news stories. This paper proposes a novel scheme of mining topic-related stories through a query-expansion algorithm on the basis of near duplicates built on top of text. Experiments showed that the query-expansion algorithm based on near-duplicate constraints outperformed traditional methods that only use textual features. © 2009 Springer-Verlag Berlin Heidelberg.

Cite

CITATION STYLE

APA

Wu, X., Ide, I., & Satoh, S. (2009). News topic tracking and re-ranking with query expansion based on near-duplicate detection. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5879 LNCS, pp. 755–766). https://doi.org/10.1007/978-3-642-10467-1_66

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