Skip to main navigation Skip to search Skip to main content

Applying dynamic co-occurrence in story link detection

  • Hua Zhao*
  • , Tiejun Zhao
  • *Corresponding author for this work
  • Shandong University of Science and Technology
  • School of Computer Science and Technology, Harbin Institute of Technology

Research output: Contribution to journalArticlepeer-review

Abstract

Story link detection is part of a broader initiative called Topic Detection and Tracking, which is defined to be the task of determining whether two stories, such as news articles or radio broadcasts, are about the same event, or linked. In order to mine more information from the contents of the stories being compared and achieve a more high-powered system, motivated by the idea of the word co-occurrence analysis, we propose our dynamic co-occurrence, which is defined to be a pair of words that satisfy certain relation restriction. In this paper, relation restriction refers to a set of features. This paper evaluates three features: capital, location and distance. We use dynamic co-occurrence in the similarity computation when we apply it in the story link detection system. Experimental results show that the story link detection systems based on the dynamic co-occurrence perform very well, which testifies the great capabilities of the dynamic co-occurrence. At the same time, we also find that relation restriction is critical to the performance of dynamic co-occurrence.

Original languageEnglish
Pages (from-to)157-164
Number of pages8
JournalJournal of Computing and Information Technology
Volume17
Issue number2
DOIs
StatePublished - 2009
Externally publishedYes

Keywords

  • Detection cost
  • Dynamic co-occurrence
  • Relation restriction
  • Story link detection
  • Topic detection and tracking
  • Word co-occurrence

Fingerprint

Dive into the research topics of 'Applying dynamic co-occurrence in story link detection'. Together they form a unique fingerprint.

Cite this