New Approach for Multi-Document Update Summarization
Date
2010
Journal Title
Journal ISSN
Volume Title
Publisher
Abstract
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.
Description
item.page.type
Abstract
item.page.format
Text
Keywords
DATA MINING, TEXT MINING, KOLMOGOROV COMPLEXITY, INFORMATION DISTANCE, DOCUMENT SUMMARIZATION, INFORMATION DISTANCE, CLUSTER ANALYSIS, INFORMATION THEORY
Citation
Long, C., Huang, M., Zhu, X., & Li, M. (2010). A New Approach for Multi-Document Update Summarization. Journal of Computer Science and Technology, 25 (4): 739-749. doi: 10.1007/s11390-010-9361-x