Extractive multi-document text summarization based on graph independent sets

dc.authoriduckan, Taner/0000-0001-5385-6775
dc.authoridKarci, Ali/0000-0002-8489-8617
dc.authorwosiduckan, Taner/IZP-9705-2023
dc.authorwosidKarci, Ali/AAG-5337-2019
dc.contributor.authorUckan, Taner
dc.contributor.authorKarci, Ali
dc.date.accessioned2024-08-04T20:47:03Z
dc.date.available2024-08-04T20:47:03Z
dc.date.issued2020
dc.departmentİnönü Üniversitesien_US
dc.description.abstractWe propose a novel methodology for extractive, generic summarization of text documents. The Maximum Independent Set, which has not been used previously in any summarization study, has been utilized within the context of this study. In addition, a text processing tool, which we named KUSH, is suggested in order to preserve the semantic cohesion between sentences in the representation stage of introductory texts. Our anticipation was that the set of sentences corresponding to the nodes in the independent set should be excluded from the summary. Based on this anticipation, the nodes forming the Independent Set on the graphs are identified and removed from the graph. Thus, prior to quantification of the effect of the nodes on the global graph, a limitation is applied on the documents to be summarized. This limitation prevents repetition of word groups to be included in the summary. Performance of the proposed approach on the Document Understanding Conference (DUC-2002 and DUC-2004) datasets was calculated using ROUGE evaluation metrics. The developed model achieved a 0.38072 ROUGE performance value for 100-word summaries, 0.51954 for 200-word summaries, and 0.59208 for 400-word summaries. The values reported throughout the experimental processes of the study reveal the contribution of this innovative method. (C) 2019 Production and hosting by Elsevier B.V. on behalf of Faculty of Computers and Artificial Intelligence, Cairo University.en_US
dc.identifier.doi10.1016/j.eij.2019.12.002
dc.identifier.endpage157en_US
dc.identifier.issn1110-8665
dc.identifier.issn2090-4754
dc.identifier.issue3en_US
dc.identifier.scopus2-s2.0-85077387625en_US
dc.identifier.scopusqualityQ1en_US
dc.identifier.startpage145en_US
dc.identifier.urihttps://doi.org/10.1016/j.eij.2019.12.002
dc.identifier.urihttps://hdl.handle.net/11616/99130
dc.identifier.volume21en_US
dc.identifier.wosWOS:000573603100003en_US
dc.identifier.wosqualityQ2en_US
dc.indekslendigikaynakWeb of Scienceen_US
dc.indekslendigikaynakScopusen_US
dc.language.isoenen_US
dc.publisherCairo Univ, Fac Computers & Informationen_US
dc.relation.ispartofEgyptian Informatics Journalen_US
dc.relation.publicationcategoryMakale - Uluslararası Hakemli Dergi - Kurum Öğretim Elemanıen_US
dc.rightsinfo:eu-repo/semantics/openAccessen_US
dc.subjectGraph independent seten_US
dc.subjectGraph-based document summarizationen_US
dc.subjectGeneric document summarizationen_US
dc.subjectExtractive text summarizationen_US
dc.subjectMulti document text summarizationen_US
dc.titleExtractive multi-document text summarization based on graph independent setsen_US
dc.typeArticleen_US

Dosyalar