Manifold-Ranking Based Topic-Focused Multi-Document Summarization
Proceedings of the Twentieth International Joint Conference on Artificial Intelligence. Pages 2903-2907.
Abstract
Topic-focused multi-document summarization aims to produce a summary biased to a given topic or user profile. This paper presents a novel extractive approach based on manifold-ranking of sentences to this summarization task. The manifold-ranking process can naturally make full use of both the relationships among all the sentences in the documents and the relationships between the given topic and the sentences. The ranking score is obtained for each sentence in the manifold-ranking process to denote the biased information richness of the sentence. Then the greedy algorithm is employed to impose diversity penalty on each sentence. The summary is produced by choosing the sentences with both high biased information richness and high information novelty. Experiments on DUC2003 and DUC2005 are performed and the ROUGE evaluation results show that the proposed approach can significantly outperform existing approaches of the top performing systems in DUC tasks and baseline approaches.
@inproceedings{ijcai2007p467,
title = {Manifold-Ranking Based Topic-Focused Multi-Document Summarization},
author = {Wan, Xiaojun and Yang, Jianwu and Xiao, Jianguo},
booktitle = {Proceedings of the Twentieth International Joint Conference on
Artificial Intelligence, {IJCAI-07}},
publisher = {International Joint Conferences on Artificial Intelligence},
editor = {Ramon López de Mántaras},
pages = {2903--2907},
year = {2007},
url = {https://ijcai.org/proceedings/2007/467},
}
TY - CPAPER TI - Manifold-Ranking Based Topic-Focused Multi-Document Summarization AU - Wan, Xiaojun AU - Yang, Jianwu AU - Xiao, Jianguo T2 - Proceedings of the Twentieth International Joint Conference on Artificial Intelligence, IJCAI-07 PB - International Joint Conferences on Artificial Intelligence PY - 2007 SP - 2903 EP - 2907 UR - https://ijcai.org/proceedings/2007/467 ER -Copied
Machine-readable versions of this paper, for tools and AI agents: