A New Approach for Multi-Document Update Summarization

Fast changing knowledge on the Internet can be acquired more efficiently with the help of automatic document summarization and updating techniques. This paper describes a novel approach for multi-document update summarization. The best summary is defined to be the one which has the minimum information distance to the entire document set. The best update summary has the minimum conditional information distance to a document cluster given that a prior document cluster has already been read. Experiments on the DUC/TAC 2007 to 2009 datasets (http://duc.nist.gov/, http://www.nist.gov/tac/) have proved that our method closely correlates with the human summaries and outperforms other programs such as LexRank in many categories under the ROUGE evaluation criterion. Keywords data mining, text mining, Kolmogorov complexity, information distance

• Type: Journal
• Year: 2010
• Where: JCST
• Authors: Chong Long, Minlie Huang, Xiaoyan Zhu, Ming Li
• Keywords: Document, Document Cluster, Information Distance, JCST 2010