MCRMR: Maximum coverage and relevancy with minimal redundancy based multi-document summarization

被引:45
作者
Verma, Pradeepika [1 ]
Om, Hari [1 ]
机构
[1] IIT ISM, Dept Comp Sci & Engn, Dhanbad, Bihar, India
关键词
Multi-document summarization; Word Mover's distance; Normalized google distance; Shark smell optimization; Coverage; Non-redundancy; INFORMATION-RETRIEVAL; TEXT; FRAMEWORK; REVIEWS; SINGLE;
D O I
10.1016/j.eswa.2018.11.022
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
In this paper, we propose a novel extraction based method for multi-document summarization that covers three important features of a good summary: coverage, non-redundancy, and relevancy. The coverage and non-redundancy features are modeled to generate a single document from the multiple documents. These features are explored by the weighted combination of word embedding and Google based similarity methods. To accommodate the relevancy feature in the system generated summaries, the text summarization task is modeled as an optimization problem, where various text features with their optimized weights are used to score the sentences to find the relevant sentences. For feature's weight optimization, we use the meta-heuristic approach, Shark Smell Optimization (SSO). The experiments are performed on six benchmark datasets (DUC04, DUC06, DUC07, TAC08, TAC11, and MultiLing13) with the co-selection and content based performance parameters. The experimental results show that the proposed approach is viable and effective for multi-document summarization. (C) 2018 Elsevier Ltd. All rights reserved.
引用
收藏
页码:43 / 56
页数:14
相关论文
共 61 条
[1]   Fuzzy evolutionary cellular learning automata model for text summarization [J].
Abbasi-ghalehtaki, Razieh ;
Khotanlou, Hassan ;
Esmaeilpour, Mansour .
SWARM AND EVOLUTIONARY COMPUTATION, 2016, 30 :11-26
[2]   A New Metaheuristic Algorithm Based on Shark Smell Optimization [J].
Abedinia, Oveis ;
Amjady, Nima ;
Ghasemi, Ali .
COMPLEXITY, 2016, 21 (05) :97-116
[3]   Multiple documents summarization based on evolutionary optimization algorithm [J].
Alguliev, Rasim M. ;
Aliguliyev, Ramiz M. ;
Isazade, Nijat R. .
EXPERT SYSTEMS WITH APPLICATIONS, 2013, 40 (05) :1675-1689
[4]   MCMR: Maximum coverage and minimum redundant text summarization model [J].
Alguliev, Rasim M. ;
Aliguliyev, Ramiz M. ;
Hajirahimova, Makrufa S. ;
Mehdiyev, Chingiz A. .
EXPERT SYSTEMS WITH APPLICATIONS, 2011, 38 (12) :14514-14522
[5]   Probing the Topological Properties of Complex Networks Modeling Short Written Texts [J].
Amancio, Diego R. .
PLOS ONE, 2015, 10 (02)
[6]   Extractive summarization using complex networks and syntactic dependency [J].
Amancio, Diego R. ;
Nunes, Maria G. V. ;
Oliveira, Osvaldo N., Jr. ;
Costa, Luciano da F. .
PHYSICA A-STATISTICAL MECHANICS AND ITS APPLICATIONS, 2012, 391 (04) :1855-1864
[7]  
Amini MR, 2005, LECT NOTES COMPUT SC, V3408, P142
[8]  
[Anonymous], 2004, P DOC UND C DUC 2004
[9]  
[Anonymous], 2003, P 2003 C N AM CHAPT
[10]  
Asgari Hamed., 2014, 2014 Iranian Conference on Intelligent Systems (ICIS), P1, DOI DOI 10.1109/IRANIAN-CIS.2014.6802592