{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,23]],"date-time":"2026-01-23T06:31:10Z","timestamp":1769149870833,"version":"3.49.0"},"reference-count":46,"publisher":"SAGE Publications","issue":"3","license":[{"start":{"date-parts":[[2022,6,29]],"date-time":"2022-06-29T00:00:00Z","timestamp":1656460800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/journals.sagepub.com\/page\/policies\/text-and-data-mining-license"}],"content-domain":{"domain":["journals.sagepub.com"],"crossmark-restriction":true},"short-container-title":["Journal of Information Science"],"published-print":{"date-parts":[[2024,6]]},"abstract":"<jats:p> Automatic text summarisation is obtaining a subset that accurately represents the main text. A quality summary should contain the maximum amount of information while avoiding redundant information. Redundancy is a severe deficiency that causes unnecessary repetition of information within sentences and should not occur in summarisation studies. Although many optimisation-based text summarisation methods have been proposed in recent years, there exists a lack of research on the simultaneous optimisation of scope and redundancy. In this context, this study presents an approach in which maximum coverage and minimum redundancy, which form the two key features of a rich summary, are modelled as optimisation targets. In optimisation-based text summarisation studies, different conflicting objectives are generally weighted or formulated and transformed into single-objective problems. However, this transformation can directly affect the quality of the solution. In this study, the optimisation goals are met simultaneously without transformation or formulation. In addition, the multi-objective saplings growing-up algorithm (MO-SGuA) is implemented and modified for text summarisation. The presented approach, called Pareto optimal, achieves an optimal solution with simultaneous optimisation. Experimentation with the MO-SGuA method was tested using open-access (document understanding conference; DUC) data sets. Performance success of the MO-SGuA approach was calculated using the recall-oriented understudy for gisting evaluation (ROUGE) metrics and then compared with the competitive practices used in the literature. Testing achieved a 26.6% summarisation result for the ROUGE-2 metric and 65.96% for ROUGE-L, which represents an improvement of 11.17% and 20.54%, respectively. The experimental results showed that good-quality summaries were achieved using the proposed approach. <\/jats:p>","DOI":"10.1177\/01655515221101841","type":"journal-article","created":{"date-parts":[[2022,6,29]],"date-time":"2022-06-29T09:57:10Z","timestamp":1656496630000},"page":"635-650","update-policy":"https:\/\/doi.org\/10.1177\/sage-journals-update-policy","source":"Crossref","is-referenced-by-count":6,"title":["A new multi-document summarisation approach using saplings growing-up optimisation algorithms: Simultaneously optimised coverage and diversity"],"prefix":"10.1177","volume":"50","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-5190-3504","authenticated-orcid":false,"given":"Cengiz","family":"Hark","sequence":"first","affiliation":[{"name":"Department of Computer Engineering, \u0130n\u00f6n\u00fc University, Turkey"}]},{"given":"Taner","family":"U\u00e7kan","sequence":"additional","affiliation":[{"name":"Department of Computer Engineering, Van Y\u00fcz\u00fcnc\u00fc Y\u0131l University, Turkey"}]},{"given":"Ali","family":"Karc\u0131","sequence":"additional","affiliation":[{"name":"Department of Computer Engineering, \u0130n\u00f6n\u00fc University, Turkey"}]}],"member":"179","published-online":{"date-parts":[[2022,6,29]]},"reference":[{"key":"bibr1-01655515221101841","volume-title":"Extractive multi-document summarization of news articles","author":"Grant H","year":"2019"},{"issue":"3","key":"bibr2-01655515221101841","doi-asserted-by":"crossref","first-page":"1109","DOI":"10.17798\/bitlisfen.568883","volume":"8","author":"Hark C","year":"2019","journal-title":"Bitlis Eren \u00dcniv Fen Bilim Derg"},{"key":"bibr3-01655515221101841","first-page":"1433","volume":"24","author":"U\u00e7kan T","year":"2021","journal-title":"J Polytech"},{"key":"bibr4-01655515221101841","first-page":"343","volume-title":"Uniw \u015bl\u0105ski","author":"Maciej Serda","year":"2013"},{"key":"bibr5-01655515221101841","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2017.05.075"},{"key":"bibr6-01655515221101841","volume-title":"2019 international artificial intelligence and data processing symposium (IDAP)","author":"Hark C"},{"key":"bibr7-01655515221101841","doi-asserted-by":"publisher","DOI":"10.17798\/bitlisfen.531221"},{"key":"bibr8-01655515221101841","volume-title":"2017 international artificial intelligence and data processing symposium (IDAP)","author":"Hark C"},{"key":"bibr9-01655515221101841","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipm.2021.102536"},{"key":"bibr10-01655515221101841","volume-title":"Advances in automatic text summarization","author":"Mani I","year":"1999"},{"key":"bibr11-01655515221101841","doi-asserted-by":"publisher","DOI":"10.1016\/j.knosys.2018.03.022"},{"key":"bibr12-01655515221101841","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipm.2020.102478"},{"key":"bibr13-01655515221101841","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2015.04.050"},{"key":"bibr14-01655515221101841","doi-asserted-by":"publisher","DOI":"10.1016\/j.eij.2019.12.002"},{"key":"bibr15-01655515221101841","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipm.2020.102359"},{"key":"bibr16-01655515221101841","doi-asserted-by":"publisher","DOI":"10.1145\/290941.291025"},{"key":"bibr17-01655515221101841","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipm.2019.102187"},{"issue":"1","key":"bibr18-01655515221101841","first-page":"42","volume":"6","author":"Alguliyev RM","year":"2015","journal-title":"Probl Inf Technol"},{"key":"bibr19-01655515221101841","doi-asserted-by":"publisher","DOI":"10.1177\/0165551521990616"},{"key":"bibr20-01655515221101841","doi-asserted-by":"publisher","DOI":"10.1016\/j.physa.2017.02.056"},{"key":"bibr21-01655515221101841","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2018.11.022"},{"key":"bibr22-01655515221101841","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2011.05.033"},{"key":"bibr23-01655515221101841","first-page":"677","volume":"33","author":"Qaroush A","year":"2021","journal-title":"J King Saud Univ Comput Inf Sci"},{"key":"bibr24-01655515221101841","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2012.09.014"},{"key":"bibr25-01655515221101841","doi-asserted-by":"publisher","DOI":"10.1142\/S0219622013500156"},{"key":"bibr26-01655515221101841","first-page":"968","volume-title":"2010 international conference on measuring technology and mechatronics automation","volume":"2","author":"Zhao X"},{"key":"bibr27-01655515221101841","first-page":"324","volume-title":"Proceedings of the 2010 international conference on communication and computational intelligence (INCOCCI)","author":"Kogilavani A","year":"2010"},{"key":"bibr28-01655515221101841","first-page":"382","volume-title":"2010 third international symposium on intelligent information technology and security informatics","author":"Huang L"},{"key":"bibr29-01655515221101841","doi-asserted-by":"publisher","DOI":"10.1111\/j.1467-8640.2010.00365.x"},{"key":"bibr30-01655515221101841","doi-asserted-by":"publisher","DOI":"10.1016\/j.swevo.2013.12.004"},{"issue":"1","key":"bibr31-01655515221101841","first-page":"15","volume":"8856","author":"Lozano M","year":"2014","journal-title":"Mex Int Conf Artif Intell"},{"issue":"2","key":"bibr32-01655515221101841","first-page":"19","volume":"8","author":"Mirshojaei SH","year":"2015","journal-title":"J Comput Robot"},{"issue":"1","key":"bibr33-01655515221101841","first-page":"36","volume":"5","author":"Rautray R","year":"2015","journal-title":"Int J Inf Retr Res"},{"issue":"9","key":"bibr34-01655515221101841","first-page":"1689","volume":"53","author":"Goleman AD","year":"2019","journal-title":"J Chem Inf Model"},{"issue":"2","key":"bibr35-01655515221101841","first-page":"1489","volume":"56","author":"Saleh HH","year":"2015","journal-title":"Iraqi J Sci"},{"key":"bibr36-01655515221101841","doi-asserted-by":"publisher","DOI":"10.1016\/j.knosys.2017.11.029"},{"key":"bibr37-01655515221101841","doi-asserted-by":"publisher","DOI":"10.1016\/j.jksuci.2021.04.004"},{"key":"bibr38-01655515221101841","first-page":"221","volume-title":"2007 IEEE international conference on computational cybernetics","author":"Karci A"},{"key":"bibr39-01655515221101841","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-71618-1_50"},{"key":"bibr40-01655515221101841","first-page":"386","volume-title":"Intelligent data engineering and automated Learning (IDEAL)","author":"Karci A"},{"key":"bibr41-01655515221101841","doi-asserted-by":"publisher","DOI":"10.1007\/s12046-019-1082-4"},{"key":"bibr42-01655515221101841","first-page":"1029","volume":"34","author":"Widyassari AP","year":"2022","journal-title":"J King Saud Univ Comput Inf Sci"},{"key":"bibr43-01655515221101841","unstructured":"Document Understanding Conferences (DUC-2002), 2002. http:\/\/duc.nist.gov (accessed 1 March 2021)."},{"key":"bibr44-01655515221101841","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipm.2020.102341"},{"key":"bibr45-01655515221101841","unstructured":"Lin CY. ROUGE: a package for automatic evaluation of summaries. In: Proceedings of the workshop on text summarization branches out (WAS 2004), 2004, pp. 25\u201326, https:\/\/aclanthology.org\/W04-1013.pdf"},{"key":"bibr46-01655515221101841","doi-asserted-by":"publisher","DOI":"10.1016\/j.swevo.2011.06.006"}],"container-title":["Journal of Information Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/journals.sagepub.com\/doi\/pdf\/10.1177\/01655515221101841","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/journals.sagepub.com\/doi\/full-xml\/10.1177\/01655515221101841","content-type":"application\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/journals.sagepub.com\/doi\/pdf\/10.1177\/01655515221101841","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,1]],"date-time":"2025-03-01T00:54:43Z","timestamp":1740790483000},"score":1,"resource":{"primary":{"URL":"https:\/\/journals.sagepub.com\/doi\/10.1177\/01655515221101841"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,6,29]]},"references-count":46,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2024,6]]}},"alternative-id":["10.1177\/01655515221101841"],"URL":"https:\/\/doi.org\/10.1177\/01655515221101841","relation":{},"ISSN":["0165-5515","1741-6485"],"issn-type":[{"value":"0165-5515","type":"print"},{"value":"1741-6485","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,6,29]]}}}