Genetic algorithm based multi-document summarization

  • Authors:
  • Dexi Liu;Yanxiang He;Donghong Ji;Hua Yang

  • Affiliations:
  • School of Physics, Xiangfan University, Xiangfan, P.R. China;School of Computer, Wuhan University, Wuhan, P.R. China;Institute for Infocomm Research, Singapore;School of Computer, Wuhan University, Wuhan, P.R. China

  • Venue:
  • PRICAI'06 Proceedings of the 9th Pacific Rim international conference on Artificial intelligence
  • Year:
  • 2006

Quantified Score

Hi-index 0.00

Visualization

Abstract

The multi-document summarizer using genetic algorithm-based sentence extraction (SBGA) regards summarization process as an optimization problem where the optimal summary is chosen among a set of summaries formed by the conjunction of the original articles sentences. To solve the NP hard optimization problem, SBGA adopts genetic algorithm, which can choose the optimal summary on global aspect. To improve the accuracy of term frequency, SBGA employs a novel method TFS, which takes word sense into account while calculating term frequency. The experiments on DUC04 data show that our strategy is effective and the ROUGE-1 score is only 0.55% lower than the best participant in DUC04.