Finding news story chains based on multi-dimensional event profiles

  • Authors:
  • Xianshu Zhu;Tim Oates

  • Affiliations:
  • University of Maryland, Baltimore County, Baltimore, MD;University of Maryland, Baltimore County, Baltimore, MD

  • Venue:
  • Proceedings of the 10th Conference on Open Research Areas in Information Retrieval
  • Year:
  • 2013

Quantified Score

Hi-index 0.00

Visualization

Abstract

Large amounts of information about news events are published on the Internet every day in online newspapers. While search engines like Google help retrieve information using keywords, the large volumes of unstructured search results returned by search engines make it hard to track the evolution of an event. A story chain is composed of a set of news articles that coherently connect together to help answer the question of how event A is related to event B. Previous algorithms for finding story chains do not utilize the fact that news events are composed of "Who", "What", "Where" and "When". In this paper, we extract structured information from unstructured news articles so that every news article is represented as a multi-dimensional event profile. News article relevance is computed base on the event profile. An improved story chain algorithm is further proposed based on the new relevance measure. Experimental results show that the proposed article representation can help to find relevant news articles and our proposed algorithm can generate better story chains.