Calculating the Upper Bounds for Multi-Document Summarization using Genetic Algorithms

dc.creatorROJAS SIMON, JONATHAN; 857852
dc.creatorLEDENEVA, YULIA NIKOLAEVNA; 213954
dc.creatorGARCIA HERNANDEZ, RENE ARNULFO; 202667
dc.creatorROJAS SIMON, JONATHAN
dc.creatorLEDENEVA, YULIA NIKOLAEVNA
dc.creatorGARCIA HERNANDEZ, RENE ARNULFO
dc.date2018-03-16T23:27:52Z
dc.date2018-03-16T23:27:52Z
dc.date2018-01-10
dc.date.accessioned2019-05-28T21:50:57Z
dc.date.available2019-05-28T21:50:57Z
dc.identifier1405-5546
dc.identifierhttp://hdl.handle.net/20.500.11799/80182
dc.identifier.urihttp://repositorioslatinoamericanos.uchile.cl/handle/2250/2907282
dc.descriptionOver the last years, several Multi-Document Summarization (MDS) methods have been presented in Document Understanding Conference (DUC), workshops. Since DUC01, several methods have been presented in approximately 268 publications of the stateof-the-art, that have allowed the continuous improvement of MDS, however in most works the upper bounds were unknowns. Recently, some works have been focused to calculate the best sentence combinations of a set of documents and in previous works we have been calculated the significance for single-document summarization task in DUC01 and DUC02 datasets. However, for MDS task has not performed an analysis of significance to rank the best multi-document summarization methods. In this paper, we describe a Genetic Algorithm-based method for calculating the best sentence combinations of DUC01 and DUC02 datasets in MDS through a Meta-document representation. Moreover, we have calculated three heuristics mentioned in several works of state-of-the-art to rank the most recent MDS methods, through the calculus of upper bounds and lower bounds.
dc.languageeng
dc.publisherComputación y Sistemas
dc.relationVol.;22
dc.relationNo.;1
dc.rightsopenAccess
dc.rightshttp://creativecommons.org/licenses/by-nc-nd/4.0
dc.subjectProcesamiento de Lenguaje Natural
dc.subjectLingüística Computacional
dc.subjectGeneración automática de Resúmenes
dc.subjectINGENIERÍA Y TECNOLOGÍA
dc.titleCalculating the Upper Bounds for Multi-Document Summarization using Genetic Algorithms
dc.typeArtículos de revistas
dc.typeArtículos de revistas


Este ítem pertenece a la siguiente institución