{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,1]],"date-time":"2025-03-01T20:40:16Z","timestamp":1740861616296,"version":"3.38.0"},"reference-count":59,"publisher":"SAGE Publications","issue":"4","license":[{"start":{"date-parts":[[2022,8,27]],"date-time":"2022-08-27T00:00:00Z","timestamp":1661558400000},"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,8]]},"abstract":"<jats:p> Identifying and extracting valuable information from textual documents in the form of cohesively and appropriately developed summaries is one of the most challenging tasks in text mining and natural language processing. In this article, we present a sequential Markov model, equipped with Bayesian inference, to estimate the degree of importance of sentences in a document and thereby address the text summarisation problem. The proposed methodology models the extractive sentence summarisation as a Bayesian state estimation problem, where the system state is the importance degree of each sentence in a document. The transition and observation models are derived using a nonlinear dynamical system identification based on a recurrent feedback neural model that predicts the sentence observation using the sentence input data. In the end, the transition and observation probability density functions are modelled using a mixture density network. The performance assessment of the system has been carried out by investigating the optimal feature dimensionality and the impact of the model parameters on the system accuracy, using entropy-based risk and loss-based risk measures. Finally, the superiority of the proposed methodology over the state of the art in extractive summarisation is discussed and verified by reporting the recall, precision and accuracy on the real-world benchmark data sets. <\/jats:p>","DOI":"10.1177\/01655515221112842","type":"journal-article","created":{"date-parts":[[2022,8,27]],"date-time":"2022-08-27T09:38:41Z","timestamp":1661593121000},"page":"1005-1018","update-policy":"https:\/\/doi.org\/10.1177\/sage-journals-update-policy","source":"Crossref","is-referenced-by-count":0,"title":["Extractive text summarisation using Bayesian state estimation of sentences: A Markovian framework"],"prefix":"10.1177","volume":"50","author":[{"given":"Saba","family":"Ghanbari Haez","sequence":"first","affiliation":[{"name":"University of Trento, Italy"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6371-6557","authenticated-orcid":false,"given":"Farhad","family":"Shamsfakhr","sequence":"additional","affiliation":[{"name":"University of Trento, Italy"}]}],"member":"179","published-online":{"date-parts":[[2022,8,27]]},"reference":[{"doi-asserted-by":"publisher","key":"bibr1-01655515221112842","DOI":"10.1145\/321510.321519"},{"volume-title":"Advances in automatic text summarization","year":"1999","author":"Maybury M.","key":"bibr2-01655515221112842"},{"doi-asserted-by":"publisher","key":"bibr3-01655515221112842","DOI":"10.1177\/0165551511408848"},{"doi-asserted-by":"publisher","key":"bibr4-01655515221112842","DOI":"10.1016\/j.eswa.2018.12.011"},{"doi-asserted-by":"publisher","key":"bibr5-01655515221112842","DOI":"10.18653\/v1\/2020.emnlp-main.506"},{"doi-asserted-by":"publisher","key":"bibr6-01655515221112842","DOI":"10.18653\/v1\/P17-1099"},{"unstructured":"Wu Y, Hu B. Learning to extract coherent summary via deep reinforcement learning. In: Thirty-second AAAI conference on artificial intelligence, https:\/\/ojs.aaai.org\/index.php\/AAAI\/article\/view\/11987","key":"bibr7-01655515221112842"},{"doi-asserted-by":"publisher","key":"bibr8-01655515221112842","DOI":"10.18653\/v1\/P18-1061"},{"unstructured":"Nallapati R, Zhai F, Zhou B. SummaRuNNer: a recurrent neural network based sequence model for extractive summarization of documents. In: Thirty-first AAAI conference on artificial intelligence, https:\/\/dl.acm.org\/doi\/10.5555\/3298483.3298681","key":"bibr9-01655515221112842"},{"doi-asserted-by":"publisher","key":"bibr10-01655515221112842","DOI":"10.18653\/v1\/D18-1409"},{"doi-asserted-by":"publisher","key":"bibr11-01655515221112842","DOI":"10.18653\/v1\/D19-1324"},{"key":"bibr12-01655515221112842","first-page":"6999","volume-title":"Proceedings of the AAAI conference on artificial intelligence","volume":"33","author":"Shi J"},{"doi-asserted-by":"publisher","key":"bibr13-01655515221112842","DOI":"10.18653\/v1\/2020.acl-main.703"},{"doi-asserted-by":"publisher","key":"bibr14-01655515221112842","DOI":"10.18653\/v1\/D19-1387"},{"doi-asserted-by":"publisher","key":"bibr15-01655515221112842","DOI":"10.18653\/v1\/K19-1074"},{"doi-asserted-by":"publisher","key":"bibr16-01655515221112842","DOI":"10.1177\/0165551507084630"},{"unstructured":"Kry\u015bci\u0144ski W, Keskar NS, McCann B et al. Neural text summarization: a critical evaluation. arXiv Preprint 2019: 190808960, https:\/\/arxiv.org\/abs\/1908.08960","key":"bibr17-01655515221112842"},{"unstructured":"Kry\u015bci\u0144ski W, McCann B, Xiong C et al. Evaluating the factual consistency of abstractive text summarization. arXiv Preprint 2019: 191012840, https:\/\/arxiv.org\/abs\/1910.12840","key":"bibr18-01655515221112842"},{"doi-asserted-by":"publisher","key":"bibr19-01655515221112842","DOI":"10.18653\/v1\/P17-1123"},{"doi-asserted-by":"publisher","key":"bibr20-01655515221112842","DOI":"10.18653\/v1\/D17-1219"},{"volume-title":"Pacific-Asia conference on knowledge discovery and data mining","author":"Kumar V","first-page":"335","key":"bibr21-01655515221112842"},{"doi-asserted-by":"publisher","key":"bibr22-01655515221112842","DOI":"10.18653\/v1\/2020.emnlp-main.128"},{"volume-title":"Developmental and remedial reading in the middle grades","year":"1978","author":"Aulls MW.","key":"bibr23-01655515221112842"},{"doi-asserted-by":"publisher","key":"bibr24-01655515221112842","DOI":"10.58680\/rte197420099"},{"doi-asserted-by":"publisher","key":"bibr25-01655515221112842","DOI":"10.1080\/10790195.1985.10850261"},{"doi-asserted-by":"publisher","key":"bibr26-01655515221112842","DOI":"10.58680\/rte198715578"},{"key":"bibr27-01655515221112842","first-page":"72","volume":"1989","author":"Hare VC","journal-title":"Read Res Quart"},{"volume-title":"Proceedings of the 24th annual international ACM SIGIR conference on Research and development in information retrieval","author":"Conroy JM","first-page":"406","key":"bibr28-01655515221112842"},{"key":"bibr29-01655515221112842","first-page":"833","volume":"37","author":"Belanger D","year":"2015","journal-title":"PMLR"},{"doi-asserted-by":"publisher","key":"bibr30-01655515221112842","DOI":"10.18653\/v1\/N18-1065"},{"unstructured":"Dang HT. Overview of DUC 2005. In: Proceedings of the document understanding conference, vol. 2005, pp. 1\u201312, https:\/\/www-nlpir.nist.gov\/projects\/duc\/pubs\/2005papers\/OVERVIEW05.pdf","key":"bibr31-01655515221112842"},{"unstructured":"Napoles C, Gormley MR, Van Durme B. Annotated Gigaword. In: Proceedings of the joint workshop on automatic knowledge base construction and web-scale knowledge extraction (AKBC-WEKEX), pp. 95\u2013100, https:\/\/aclanthology.org\/W12-3018.pdf","key":"bibr32-01655515221112842"},{"volume-title":"The New York Times annotated corpus","year":"2008","author":"Sandhaus E.","key":"bibr33-01655515221112842"},{"doi-asserted-by":"publisher","key":"bibr34-01655515221112842","DOI":"10.18653\/v1\/D15-1044"},{"key":"bibr35-01655515221112842","first-page":"1","volume":"28","author":"Hermann KM","year":"2015","journal-title":"Adv Neural Inf Process Syst"},{"volume-title":"A modern approach","year":"2002","author":"Norvig PR","key":"bibr36-01655515221112842"},{"key":"bibr37-01655515221112842","first-page":"91","volume-title":"Artificial intelligence based mobile robotics: case studies of successful robot systems","author":"Koenig S","year":"1998"},{"key":"bibr38-01655515221112842","volume-title":"Hidden Markov models: estimation and control","volume":"29","author":"Elliott RJ","year":"2008"},{"doi-asserted-by":"publisher","key":"bibr39-01655515221112842","DOI":"10.1613\/jair.616"},{"issue":"2","key":"bibr40-01655515221112842","first-page":"250","volume":"194","author":"Swinburne R.","year":"2004","journal-title":"Rev Philos Fr Etrang"},{"volume-title":"Probability theory: a comprehensive course","year":"2013","author":"Klenke A.","key":"bibr41-01655515221112842"},{"doi-asserted-by":"publisher","key":"bibr42-01655515221112842","DOI":"10.2514\/3.3166"},{"doi-asserted-by":"publisher","key":"bibr43-01655515221112842","DOI":"10.1016\/S0967-0661(01)00050-8"},{"volume-title":"European conference on information retrieval","author":"Moschitti A","first-page":"181","key":"bibr44-01655515221112842"},{"doi-asserted-by":"publisher","key":"bibr45-01655515221112842","DOI":"10.1017\/9781108686136"},{"doi-asserted-by":"publisher","key":"bibr46-01655515221112842","DOI":"10.3115\/1072228.1072281"},{"doi-asserted-by":"publisher","key":"bibr47-01655515221112842","DOI":"10.1109\/MC.2009.263"},{"unstructured":"Chen HH. Weighted-SVD: matrix factorization with weights on the latent factors. arXiv Preprint 2017: 171000482, https:\/\/arxiv.org\/abs\/1710.00482","key":"bibr48-01655515221112842"},{"volume-title":"Mixture density networks","year":"1994","author":"Bishop CM.","key":"bibr49-01655515221112842"},{"unstructured":"Kingma DP, Ba J. Adam: a method for stochastic optimization. arXiv Preprint 2014: 14126980, https:\/\/arxiv.org\/abs\/1412.6980","key":"bibr50-01655515221112842"},{"doi-asserted-by":"publisher","key":"bibr51-01655515221112842","DOI":"10.1080\/01621459.1986.10478289"},{"doi-asserted-by":"publisher","key":"bibr52-01655515221112842","DOI":"10.1103\/PhysRevLett.84.2263"},{"unstructured":"Lin CY. Rouge: a package for automatic evaluation of summaries. In: Text summarization branches out, pp. 74\u201381, https:\/\/aclanthology.org\/W04-1013.pdf","key":"bibr53-01655515221112842"},{"issue":"4","key":"bibr54-01655515221112842","doi-asserted-by":"crossref","first-page":"285","DOI":"10.21512\/comtech.v7i4.3746","volume":"7","author":"Christian H","year":"2016","journal-title":"ComTech: Comput Math Eng Appl"},{"doi-asserted-by":"publisher","key":"bibr55-01655515221112842","DOI":"10.1016\/j.ipm.2004.04.003"},{"doi-asserted-by":"publisher","key":"bibr56-01655515221112842","DOI":"10.1007\/978-3-642-28601-8_31"},{"doi-asserted-by":"publisher","key":"bibr57-01655515221112842","DOI":"10.1007\/978-981-13-0514-6_14"},{"doi-asserted-by":"publisher","key":"bibr58-01655515221112842","DOI":"10.18653\/v1\/P18-1013"},{"doi-asserted-by":"publisher","key":"bibr59-01655515221112842","DOI":"10.18653\/v1\/2020.acl-main.552"}],"container-title":["Journal of Information Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/journals.sagepub.com\/doi\/pdf\/10.1177\/01655515221112842","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/journals.sagepub.com\/doi\/full-xml\/10.1177\/01655515221112842","content-type":"application\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/journals.sagepub.com\/doi\/pdf\/10.1177\/01655515221112842","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,1]],"date-time":"2025-03-01T20:09:50Z","timestamp":1740859790000},"score":1,"resource":{"primary":{"URL":"https:\/\/journals.sagepub.com\/doi\/10.1177\/01655515221112842"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,8,27]]},"references-count":59,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2024,8]]}},"alternative-id":["10.1177\/01655515221112842"],"URL":"https:\/\/doi.org\/10.1177\/01655515221112842","relation":{},"ISSN":["0165-5515","1741-6485"],"issn-type":[{"type":"print","value":"0165-5515"},{"type":"electronic","value":"1741-6485"}],"subject":[],"published":{"date-parts":[[2022,8,27]]}}}