GSPSummary: A Graph-Based Sub-topic Partition Algorithm for Summarization

摘要：

Multi-document summarization (MDS) is a challenging research topic in natural language processing.In order to obtain an effective summary,this paper presents a novel extractive approach based on graph-based sub-topic partition algorithm (GSPSummary).In particular,a sub-topic model bascd on graph representation is presented with emphasis on the implicit logic structure of the topic covered in the document collection.Then,a new framework of MDS with sub-topic partition is proposed.Furthermore,a novel scalable ranking criterion is adopted,in which both word based features and global features are integrated together.Experimental results on DUC2005 show that the proposed approach can significantly outperform existing approaches of the top performing systems in DUC tasks.

关键词： Multi-document Summarization Sub-topic Graph Representation

作者: Jin Zhang Xueqi Cheng Hongbo Xu

作者单位: Institute of Computing Technology,Chinese Academy of Sciences,Beijing,P.R.China

会议类型: 国际会议

会议名称: 4th Asia Information Retrieval Symposium(AIRS 2008)(第四届亚洲信息检索研讨会)

会议地点: 哈尔滨

会议语种:英文

页码: 321-334

在线出版日期: 2008-01-16（万方平台首次上网日期，不代表论文的发表时间）