hrcak mascot   Srce   HID

Izvorni znanstveni članak
https://doi.org/10.2498/cit.1001104

Applying Dynamic Co-occurrence in Story Link Detection

Hua Zhao
Tiejun Zhao

Puni tekst: engleski, pdf (275 KB) str. 157-164 preuzimanja: 454* citiraj
APA 6th Edition
Zhao, H. i Zhao, T. (2009). Applying Dynamic Co-occurrence in Story Link Detection. Journal of computing and information technology, 17 (2), 157-164. https://doi.org/10.2498/cit.1001104
MLA 8th Edition
Zhao, Hua i Tiejun Zhao. "Applying Dynamic Co-occurrence in Story Link Detection." Journal of computing and information technology, vol. 17, br. 2, 2009, str. 157-164. https://doi.org/10.2498/cit.1001104. Citirano 29.03.2020.
Chicago 17th Edition
Zhao, Hua i Tiejun Zhao. "Applying Dynamic Co-occurrence in Story Link Detection." Journal of computing and information technology 17, br. 2 (2009): 157-164. https://doi.org/10.2498/cit.1001104
Harvard
Zhao, H., i Zhao, T. (2009). 'Applying Dynamic Co-occurrence in Story Link Detection', Journal of computing and information technology, 17(2), str. 157-164. https://doi.org/10.2498/cit.1001104
Vancouver
Zhao H, Zhao T. Applying Dynamic Co-occurrence in Story Link Detection. Journal of computing and information technology [Internet]. 2009 [pristupljeno 29.03.2020.];17(2):157-164. https://doi.org/10.2498/cit.1001104
IEEE
H. Zhao i T. Zhao, "Applying Dynamic Co-occurrence in Story Link Detection", Journal of computing and information technology, vol.17, br. 2, str. 157-164, 2009. [Online]. https://doi.org/10.2498/cit.1001104

Sažetak
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.

Hrčak ID: 44855

URI
https://hrcak.srce.hr/44855

Posjeta: 583 *