{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,20]],"date-time":"2026-04-20T10:23:12Z","timestamp":1776680592328,"version":"3.51.2"},"reference-count":39,"publisher":"Springer Science and Business Media LLC","issue":"9","license":[{"start":{"date-parts":[[2025,6,6]],"date-time":"2025-06-06T00:00:00Z","timestamp":1749168000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by-nc-nd\/4.0"},{"start":{"date-parts":[[2025,6,6]],"date-time":"2025-06-06T00:00:00Z","timestamp":1749168000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by-nc-nd\/4.0"}],"funder":[{"name":"Committee of Science of the Ministry of Science and Higher Education of the Republic of Kazakhstan","award":["BR21882268"],"award-info":[{"award-number":["BR21882268"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Artif Intell Rev"],"DOI":"10.1007\/s10462-025-11276-w","type":"journal-article","created":{"date-parts":[[2025,6,6]],"date-time":"2025-06-06T03:35:25Z","timestamp":1749180925000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Dynamic optimization of min-df in the GreedSum algorithm for enhanced extractive summarization"],"prefix":"10.1007","volume":"58","author":[{"given":"Shakarim","family":"Aubakirov","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Iskander","family":"Akhmetov","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alexander","family":"Gelbukh","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rustam","family":"Mussabayev","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,6,6]]},"reference":[{"issue":"1","key":"11276_CR1","first-page":"1","volume":"874","author":"L Abualigah","year":"2020","unstructured":"Abualigah L, Bashabsheh MQ, Alabool H, Shehab M (2020) Text summarization: a brief review. Stud Comput Intell 874(1):1\u201315","journal-title":"Stud Comput Intell"},{"key":"11276_CR2","doi-asserted-by":"publisher","first-page":"168141","DOI":"10.1109\/ACCESS.2021.3136302","volume":"9","author":"I Akhmetov","year":"2021","unstructured":"Akhmetov I, Gelbukh A, Mussabayev R (2021a) Greedy optimization method for extractive summarization of scientific articles. IEEE Access 9:168141\u2013168153. https:\/\/doi.org\/10.1109\/ACCESS.2021.3136302","journal-title":"IEEE Access"},{"key":"11276_CR3","unstructured":"Akhmetov, I., Gelbukh, A., Mladenovic, N., Mussabayev, R.\u00a0(2021b) The arxive dataset extract with high rouge score summaries generated by 5 different methods v1. Technical report, Mendeley Data"},{"key":"11276_CR4","doi-asserted-by":"publisher","first-page":"166","DOI":"10.1007\/978-3-030-69625-2_13","volume-title":"Variable Neighborhood Search","author":"I Akhmetov","year":"2021","unstructured":"Akhmetov I, Mladenovic N, Mussabayev R (2021c) Using k-means and variable neighborhood search for automatic summarization of scientific articles. In: Mladenovic N, Sleptchenko A, Sifaleras A, Omar M (eds) Variable Neighborhood Search. Springer, Cham, pp 166\u2013175"},{"key":"11276_CR5","doi-asserted-by":"publisher","first-page":"2677","DOI":"10.32604\/cmc.2023.033273","volume":"74","author":"R Alkanhel","year":"2022","unstructured":"Alkanhel R, El-kenawy E-S, Abdelhamid A, Ibrahim A, Alohali M, Abotaleb M, Khafaga D (2022) Network intrusion detection based on feature selection and hybrid metaheuristic optimization. Comput Mater Contin 74:2677\u20132693. https:\/\/doi.org\/10.32604\/cmc.2023.033273","journal-title":"Comput Mater Contin"},{"key":"11276_CR7","doi-asserted-by":"publisher","unstructured":"Aubakirov S (2024a) Sample of 376 article texts. Technical report, Mendeley Data. https:\/\/doi.org\/10.17632\/6zx6fw5t4t.1.\u00a0https:\/\/data.mendeley.com\/datasets\/6zx6fw5t4t\/1","DOI":"10.17632\/6zx6fw5t4t.1"},{"key":"11276_CR6","doi-asserted-by":"publisher","unstructured":"Aubakirov S, Akhmetov I (2024b) Dynamic optimization of minimum document frequency for extractive text summarization using greedsum algorithm. In: 2024 20th International Asian School-Seminar on Optimization Problems of Complex Systems (OPCS), pp 33\u201337. https:\/\/doi.org\/10.1109\/OPCS63516.2024.10720390","DOI":"10.1109\/OPCS63516.2024.10720390"},{"key":"11276_CR8","doi-asserted-by":"crossref","unstructured":"Cohan A, Dernoncourt F, Kim DS, Bui T, Kim S, Chang W, Goharian N (2018) A discourse-aware attention model for abstractive summarization of long documents. In: North American Chapter of the Association for Computational Linguistics. https:\/\/api.semanticscholar.org\/CorpusID:4894594","DOI":"10.18653\/v1\/N18-2097"},{"key":"11276_CR9","doi-asserted-by":"publisher","unstructured":"Dong Y, Mircea A, Cheung JCK (2021) Discourse-aware unsupervised summarization for long scientific documents. In: Merlo, P, Tiedemann, J, Tsarfaty, R (eds.) Proceedings of the 16th Conference of the European Chapter of the Association for Computational Linguistics, Association for Computational Linguistics, pp 1089\u20131102.https:\/\/doi.org\/10.18653\/v1\/2021.eacl-main.93. https:\/\/aclanthology.org\/2021.eacl-main.93","DOI":"10.18653\/v1\/2021.eacl-main.93"},{"key":"11276_CR10","doi-asserted-by":"publisher","first-page":"457","DOI":"10.1613\/jair.1523","volume":"22","author":"G Erkan","year":"2004","unstructured":"Erkan G, Radev DR (2004) Lexrank: graph-based lexical centrality as salience in text summarization. J Artif Intell Res 22:457\u2013479","journal-title":"J Artif Intell Res"},{"key":"11276_CR11","doi-asserted-by":"crossref","unstructured":"Ge Y, Jeoung S, Diesner J (2024) Extractive summarization via fine-grained semantic tuple extraction. In: Mahamood S, Minh NL, Ippolito D (eds) Proceedings of the 17th International Natural Language Generation Conference. Association for Computational Linguistics, Tokyo, pp 121\u2013133 https:\/\/aclanthology.org\/2024.inlg-main.10","DOI":"10.18653\/v1\/2024.inlg-main.10"},{"key":"11276_CR12","unstructured":"Guthrie WF (2020) NIST\/SEMATECH e-Handbook of statistical methods (NIST Handbook 151). https:\/\/www.itl.nist.gov\/div898\/handbook\/"},{"issue":"11","key":"11276_CR13","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1109\/2.881692","volume":"33","author":"U Hahn","year":"2000","unstructured":"Hahn U, Mani I (2000) The challenges of automatic summarization. Computer 33(11):29\u201336","journal-title":"Computer"},{"issue":"4","key":"11276_CR14","first-page":"319","volume":"6","author":"P Hansen","year":"2008","unstructured":"Hansen P, Mladenovi\u0107 N, P\u00e9rez JAM (2008) Variable neighbourhood search: methods and applications. Ann Oper Res 6(4):319\u2013360","journal-title":"Ann Oper Res"},{"key":"11276_CR15","doi-asserted-by":"crossref","unstructured":"Hansen P, Mladenovi\u0107 N (2018) Variable neighborhood search. In: Handbook Heuristics. vol 24. Springer, Cham","DOI":"10.1007\/978-3-319-07124-4_19"},{"issue":"16","key":"11276_CR16","doi-asserted-by":"publisher","first-page":"18372","DOI":"10.48550\/arXiv.2408.15801","volume":"38","author":"L Hemamou","year":"2024","unstructured":"Hemamou L, Debiane M (2024) Scaling up summarization: leveraging large language models for long text extractive summarization. Proc AAAI Conf Artif Intell 38(16):18372\u201318380. https:\/\/doi.org\/10.48550\/arXiv.2408.15801","journal-title":"Proc AAAI Conf Artif Intell"},{"issue":"16","key":"11276_CR17","doi-asserted-by":"publisher","first-page":"18372","DOI":"10.48550\/ARXIV.2312.06901","volume":"38","author":"R Jie","year":"2024","unstructured":"Jie R, Meng X, Jiang X, Liu Q (2024) Unsupervised extractive summarization with learnable length control. Strategies 38(16):18372\u201318380. https:\/\/doi.org\/10.48550\/ARXIV.2312.06901. arXiv:org\/abs\/2312.06901","journal-title":"Strategies"},{"key":"11276_CR18","doi-asserted-by":"crossref","unstructured":"Kupiec J, Pedersen J, Chen F (1995) A trainable document summarizer. In: Proceedings of the 18th Annual International ACM SIGIR Conference on Research and Development in Information Retrieval (SIGIR), pp 68\u201373\u00a0http:\/\/dl.acm.org\/citation.cfm?id=215333","DOI":"10.1145\/215206.215333"},{"key":"11276_CR19","doi-asserted-by":"publisher","first-page":"121204","DOI":"10.1016\/j.ins.2024.121204","volume":"681","author":"O Kozbagarov","year":"2024","unstructured":"Kozbagarov O, Mussabayev R (2024) Distributed random swap: an efficient algorithm for minimum sum-of-squares clustering. Inf Sci 681:121204. https:\/\/doi.org\/10.1016\/j.ins.2024.121204","journal-title":"Inf Sci"},{"key":"11276_CR20","doi-asserted-by":"crossref","unstructured":"Liang X, Wu S, Li M, Li Z (2021) Improving unsupervised extractive summarization with facet-aware modeling. In: Findings, pp 1685-1697.\u00a0https:\/\/api.semanticscholar.org\/CorpusID:236477774","DOI":"10.18653\/v1\/2021.findings-acl.147"},{"key":"11276_CR21","unstructured":"Lin C-Y (2004) ROUGE: a package for automatic evaluation of summaries. In: Text Summarization Branches Out. Association for Computational Linguistics, Barcelona, pp 74\u201381 https:\/\/aclanthology.org\/W04-1013"},{"issue":"4","key":"11276_CR22","doi-asserted-by":"publisher","first-page":"309","DOI":"10.1147\/rd.14.0309","volume":"1","author":"HP Luhn","year":"1957","unstructured":"Luhn HP (1957) A statistical approach to mechanized encoding and searching of literary information. IBM J Res Dev 1(4):309\u2013317","journal-title":"IBM J Res Dev"},{"issue":"2","key":"11276_CR23","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1147\/rd.22.0159","volume":"2","author":"HP Luhn","year":"1958","unstructured":"Luhn HP (1958) The automatic creation of literature abstracts. IBM J Res Dev 2(2):159\u2013165","journal-title":"IBM J Res Dev"},{"key":"11276_CR24","doi-asserted-by":"crossref","unstructured":"Liu Y, Lapata M (2019) Text Summarization with Pretrained Encoders","DOI":"10.18653\/v1\/D19-1387"},{"key":"11276_CR25","doi-asserted-by":"publisher","unstructured":"Markovic V, Njegus A, Bulaja D, Zivkovic T, Zivkovic M, Mani JP, Bacanin N (2024) Employee reviews sentiment classification using bert encoding and adaboost classifier tuned by modified pso algorithm. In: Proceedings of the 2nd International Conference on Innovation in Information Technology and Business (ICIITB 2024), vol 113. Atlantis Press, Springer Nature, pp 22\u201337https:\/\/doi.org\/10.2991\/978-94-6463-482-2_3","DOI":"10.2991\/978-94-6463-482-2_3"},{"key":"11276_CR26","unstructured":"Machine learning plus: cosine similarity - understanding and application with python (2023). https:\/\/www.machinelearningplus.com\/nlp\/cosine-similarity\/"},{"key":"11276_CR27","unstructured":"Mussabayev R, Mussabayev R (2023a) Comparative analysis of optimization strategies for K-means clustering in big data contexts: a review.\u00a0Preprint at https:\/\/arxiv.org\/abs\/quant-ph\/2310.09819"},{"issue":"23","key":"11276_CR28","doi-asserted-by":"publisher","first-page":"1","DOI":"10.3390\/math12233787","volume":"12","author":"R Mussabayev","year":"2024","unstructured":"Mussabayev R (2024a) Optimizing euclidean distance computation. Mathematics 12(23):1\u201336","journal-title":"Mathematics"},{"issue":"13","key":"11276_CR29","doi-asserted-by":"publisher","first-page":"1930","DOI":"10.3390\/math12131930","volume":"12","author":"R Mussabayev","year":"2024","unstructured":"Mussabayev R, Mussabayev R (2024b) High-performance hybrid algorithm for minimum sum-of-squares clustering of infinitely tall data. Mathematics 12(13):1930. https:\/\/doi.org\/10.3390\/math12131930","journal-title":"Mathematics"},{"issue":"109269","key":"11276_CR30","doi-asserted-by":"publisher","first-page":"109269","DOI":"10.1016\/j.patcog.2022.109269","volume":"137","author":"R Mussabayev","year":"2023","unstructured":"Mussabayev R, Mladenovic N, Jarboui B, Mussabayev R (2023b) How to use k-means for big data clustering? Pattern Recognit 137(109269):109269","journal-title":"Pattern Recognit"},{"key":"11276_CR31","doi-asserted-by":"publisher","first-page":"23681","DOI":"10.1109\/access.2023.3253430","volume":"11","author":"H Myriam","year":"2023","unstructured":"Myriam H, Abdelhamid AA, El-Kenawy E-SM, Ibrahim A, Eid MM, Jamjoom MM, Khafaga DS (2023) Advanced meta-heuristic algorithm based on particle swarm and al-biruni earth radius optimization methods for oral cancer detection. IEEE Access 11:23681\u201323700. https:\/\/doi.org\/10.1109\/access.2023.3253430","journal-title":"IEEE Access"},{"key":"11276_CR32","first-page":"329","volume":"54","author":"K Pearson","year":"1893","unstructured":"Pearson K (1893) Contributions to the mathematical theory of evolution. [abstract]. Proc R Soc London 54:329\u2013333 (Accessed 2025-04-10)","journal-title":"Proc R Soc London"},{"key":"11276_CR33","doi-asserted-by":"publisher","unstructured":"Pietruszka M, Borchmann \u0141, Garncarek \u0141 (2022) Sparsifying transformer models with trainable representation pooling. In: Proceedings of the 60th Annual Meeting of the Association for Computational Linguistics (Vol 1. Long Papers), pp 8616\u20138633. https:\/\/doi.org\/10.18653\/v1\/2022.acl-long.590","DOI":"10.18653\/v1\/2022.acl-long.590"},{"key":"11276_CR34","unstructured":"Powell V, Lehe L (2023) Principal component analysis explained visually. Publica\u00e7\u00e3o na world wide web. https:\/\/setosa.io\/ev\/principal-component-analysis\/"},{"key":"11276_CR35","volume-title":"Data Mining","author":"A Rajaraman","year":"2011","unstructured":"Rajaraman A, Ullman JD (2011) Data Mining. Cambridge University Press, Cambridge"},{"key":"11276_CR36","doi-asserted-by":"crossref","unstructured":"Tolegen G, Toleu A, Mussabayev R, Krassovitskiy A (2022) A clustering-based approach for topic modeling via word network analysis. In: 2022 7th International Conference on Computer Science and Engineering (UBMK). IEEE, pp 192-197","DOI":"10.1109\/UBMK55850.2022.9919530"},{"key":"11276_CR37","doi-asserted-by":"crossref","unstructured":"Xiao W, Beltagy I, Carenini G, Cohan A (2021) Primera: pyramid-based masked sentence pre-training for multi-document summarization. In: Annual Meeting of the Association for Computational Linguistics. https:\/\/api.semanticscholar.org\/CorpusID:247519084","DOI":"10.18653\/v1\/2022.acl-long.360"},{"key":"11276_CR38","unstructured":"Zhang J, Zhao Y, Saleh M, Liu PJ (2019) PEGASUS: pre-training with extracted gap-sentences for abstractive summarization. In International conference on machine learning. pp 11328-11339"},{"key":"11276_CR39","doi-asserted-by":"publisher","unstructured":"Zhang L, Zou B, Yi J, Aw A (2024) Comprehensive abstractive comment summarization with dynamic clustering and chain of thought. In: Ku L-W, Martins A, Srikumar V (eds) Findings of the Association for Computational Linguistics ACL 2024. Association for Computational Linguistics, Bangkok, pp 2884\u20132896. https:\/\/doi.org\/10.18653\/v1\/2024.findings-acl.169. https:\/\/aclanthology.org\/2024.findings-acl.169","DOI":"10.18653\/v1\/2024.findings-acl.169"}],"container-title":["Artificial Intelligence Review"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10462-025-11276-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10462-025-11276-w\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10462-025-11276-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,9,6]],"date-time":"2025-09-06T18:07:20Z","timestamp":1757182040000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10462-025-11276-w"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,6,6]]},"references-count":39,"journal-issue":{"issue":"9","published-online":{"date-parts":[[2025,9]]}},"alternative-id":["11276"],"URL":"https:\/\/doi.org\/10.1007\/s10462-025-11276-w","relation":{"has-preprint":[{"id-type":"doi","id":"10.21203\/rs.3.rs-6224538\/v1","asserted-by":"object"}]},"ISSN":["1573-7462"],"issn-type":[{"value":"1573-7462","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,6,6]]},"assertion":[{"value":"20 May 2025","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"6 June 2025","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare that they have no Conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}},{"value":"Not applicable.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethics Approval"}}],"article-number":"270"}}