期刊名称：Journal of Computing and Information Technology
印刷版ISSN：1330-1136
电子版ISSN：1846-3908
出版年度：2009
卷号：17
期号：2
页码：157-164
出版社：SRCE - Sveučilišni računski centar
摘要：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 testify 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.
