Extractive single document summarization using binary differential evolution: Optimization of different sentence quality measures

被引:29
作者
Saini, Naveen [1 ]
Saha, Sriparna [1 ]
Chakraborty, Dhiraj [2 ]
Bhattacharyya, Pushpak [1 ]
机构
[1] Indian Inst Technol Patna, Dept Comp Sci & Engn, Patna, Bihar, India
[2] Univ North Bengal, Dept Comp Sci & Applicat, Darjeeling, W Bengal, India
关键词
GENETIC ALGORITHM; OPERATORS;
D O I
10.1371/journal.pone.0223477
中图分类号
O [数理科学和化学]; P [天文学、地球科学]; Q [生物科学]; N [自然科学总论];
学科分类号
07 ; 0710 ; 09 ;
摘要
With the increase in the amount of text information in different real-life applications, automatic text-summarization systems become more predominant in extracting relevant information. In the current study, we formulated the problem of extractive text-summarization as a binary optimization problem, and multi-objective binary differential evolution (DE) based optimization strategy is employed to solve this. The solutions of DE encode a possible subset of sentences to be present in the summary which is then evaluated based on some statistical features (objective functions) namely, the position of the sentence in the document, the similarity of a sentence with the title, length of the sentence, cohesion, readability, and coverage. These objective functions, measuring different aspects of summary, are optimized simultaneously using the search capability of DE. Some newly designed self-organizing map (SOM) based genetic operators are incorporated in the optimization process to improve the convergence. SOM generates a mating pool containing solutions and their neighborhoods. This mating pool takes part in the genetic operation (crossover and mutation) to create new solutions. To measure the similarity or dissimilarity between sentences, different existing measures like normalized Google distance, word mover distance, and cosine similarity are explored. For the purpose of evaluation, two standard summarization datasets namely, DUC2001, and DUC2002 are utilized, and the obtained results are compared with various supervised, unsupervised and optimization strategy based existing summarization techniques using ROUGE measures. Results illustrate the superiority of our approach in terms of convergence rate and ROUGE scores as compared to state-of-the-art methods. We have obtained 45% and 5% improvements over two recent state-of-the-art methods considering ROUGE-2 and ROUGE-1 scores, respectively, for the DUC2001 dataset. While for the DUC2002 dataset, improvements obtained by our approach are 20% and 5%, considering ROUGE-2 and ROUGE-1 scores, respectively. In addition to these standard datasets, CNN news dataset is also utilized to evaluate the efficacy of our proposed approach. It was also shown that the best performance not only depends on the objective functions used but also on the correct choice of similarity/dissimilarity measure between sentences.
引用
收藏
页数:36
相关论文
共 73 条
[1]  
Alguliyev RM, 2018, EXPERT SYST
[2]   Performance evaluation of density-based clustering methods [J].
Aliguliyev, Ramiz M. .
INFORMATION SCIENCES, 2009, 179 (20) :3583-3602
[3]   A new sentence similarity measure and sentence based extractive technique for automatic text summarization [J].
Aliguliyev, Ramiz M. .
EXPERT SYSTEMS WITH APPLICATIONS, 2009, 36 (04) :7764-7772
[4]  
[Anonymous], P 5 INT C NAT COMP I
[5]  
[Anonymous], 2009, NEURAL NETWORKS LEAR
[6]  
[Anonymous], 2007, IJCAI
[7]   A simulated annealing-based multiobjective optimization algorithm: AMOSA [J].
Bandyopadhyay, Sanghamitra ;
Saha, Sriparna ;
Maulik, Ujjwal ;
Deb, Kalyanmoy .
IEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION, 2008, 12 (03) :269-283
[8]  
Bird Steven., 2004, P ACL INT POST DEM S, P214
[9]  
Burges C., 2005, P 22 INT C MACH LEAR, P89
[10]  
Cheng J., 2016, ARXIV160307252