{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,11]],"date-time":"2025-09-11T19:28:45Z","timestamp":1757618925261,"version":"3.44.0"},"reference-count":28,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[2025,7,15]],"date-time":"2025-07-15T00:00:00Z","timestamp":1752537600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,7,15]],"date-time":"2025-07-15T00:00:00Z","timestamp":1752537600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"name":"PRODEP\/TecNM program for strengthening academic corps."}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["SN COMPUT. SCI."],"DOI":"10.1007\/s42979-025-04197-6","type":"journal-article","created":{"date-parts":[[2025,7,15]],"date-time":"2025-07-15T02:53:44Z","timestamp":1752548024000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["On the Strongest Irreducible Testors and Their Computation Using a Physics-Inspired Algorithm"],"prefix":"10.1007","volume":"6","author":[{"given":"Manuel S.","family":"Lazo-Cort\u00e9s","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alejandro","family":"Rodr\u00edguez-Molina","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sandra S.","family":"Roblero-Aguilar","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rodolfo","family":"Vel\u00e1zquez-Mancilla","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,7,15]]},"reference":[{"issue":"10","key":"4197_CR1","first-page":"182","volume":"4","author":"I Cheguis","year":"1955","unstructured":"Cheguis I, Yablonskii S. On tests for electric circuits. Uspieji matematiceskij Nauk. 1955;4(10):182\u20134 (in Russian).","journal-title":"Uspieji matematiceskij Nauk"},{"key":"4197_CR2","first-page":"3","volume":"7","author":"A Dmitriev","year":"1966","unstructured":"Dmitriev A, Zhuravlev YL, Krendelev F. On mathematical principles for classification of objects and phenomena. Diskretnyi Analiz. 1966;7:3\u201315 (in Russian).","journal-title":"Diskretnyi Analiz"},{"issue":"4","key":"4197_CR3","doi-asserted-by":"publisher","first-page":"753","DOI":"10.1016\/S0031-3203(00)00028-5","volume":"34","author":"M Lazo-Cortes","year":"2001","unstructured":"Lazo-Cortes M, Ruiz Shulcloper J, Alba-Cabrera E. An overview of the evolution of the concept of testor. Pattern Recognit. 2001;34(4):753\u201362. https:\/\/doi.org\/10.1016\/S0031-3203(00)00028-5.","journal-title":"Pattern Recognit"},{"key":"4197_CR4","volume-title":"Three approaches to data analysis: test theory, rough sets and logical analysis of data","author":"I Chikalov","year":"2012","unstructured":"Chikalov I, Lozin V, Lozina I, Moshkov M, Nguyen HS, Skowron A, Zielosko B. Three approaches to data analysis: test theory, rough sets and logical analysis of data. Heidelberg: Springer; 2012."},{"key":"4197_CR5","unstructured":"Pawlak Z. Rough sets. Research report PAS 431. Institute of Computer Science, Polish Academy of Sciences, Warsaw Pol; 1981."},{"key":"4197_CR6","doi-asserted-by":"publisher","first-page":"82809","DOI":"10.1109\/ACCESS.2019.2922231","volume":"7","author":"E Alba-Cabrera","year":"2019","unstructured":"Alba-Cabrera E, Godoy-Calderon S, Lazo-Cort\u00e9s MS, Mart\u00ednez-Trinidad JF, Carrasco-Ochoa JA. On the relation between the concepts of irreducible testor and minimal transversal. IEEE Access. 2019;7:82809\u201316. https:\/\/doi.org\/10.1109\/ACCESS.2019.2922231.","journal-title":"IEEE Access"},{"key":"4197_CR7","doi-asserted-by":"publisher","unstructured":"Pons-Porrata A, Gil-Garc\u00eda R, Berlanga-Llavori R. Using typical testors for feature selection in text categorization. In: Proceedings of CIARP 2007. Lecture notes in computer science 4756; p. 643\u201352. Springer, Berlin; 2007. https:\/\/doi.org\/10.1007\/978-3-540-76725-1_67.","DOI":"10.1007\/978-3-540-76725-1_67"},{"key":"4197_CR8","doi-asserted-by":"publisher","first-page":"56312","DOI":"10.1109\/ACCESS.2020.2982133","volume":"8","author":"I Piza-Davila","year":"2020","unstructured":"Piza-Davila I, Sanchez-Diaz G, Lazo-Cortes MS, Villal\u00f3n-Turrubiates I. An algorithm for computing minimum-length irreducible testors. IEEE Access. 2020;8:56312\u201320. https:\/\/doi.org\/10.1109\/ACCESS.2020.2982133.","journal-title":"IEEE Access"},{"key":"4197_CR9","doi-asserted-by":"publisher","unstructured":"Mart\u00ednez-Mej\u00eda M, Alba-Cabrera E, P\u00e9rez-P\u00e9rez N. Typical testor selection process for classification models. In: Arai, K. (ed.) Intelligent systems and applications. p. 512\u201324. Springer, Cham; 2024. https:\/\/doi.org\/10.1007\/978-3-031-66431-1_36.","DOI":"10.1007\/978-3-031-66431-1_36"},{"issue":"8","key":"4197_CR10","doi-asserted-by":"publisher","first-page":"6607","DOI":"10.1007\/s10462-022-10162-z","volume":"55","author":"G Sanchez-Diaz","year":"2022","unstructured":"Sanchez-Diaz G, Lazo-Cortes MS, Aguirre-Salado CA, Piza-Davila I, Garcia-Contreras JP. A review of algorithms to computing irreducible testors applied to feature selection. Artif Intell Rev. 2022;55(8):6607\u201328. https:\/\/doi.org\/10.1007\/s10462-022-10162-z.","journal-title":"Artif Intell Rev"},{"key":"4197_CR11","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2023.119665","volume":"649","author":"JA Lefebre-Lobaina","year":"2023","unstructured":"Lefebre-Lobaina JA, Shulcloper JR. RegularSearch, a fast performance algorithm for typical testors computation. Inf Sci. 2023;649: 119665. https:\/\/doi.org\/10.1016\/j.ins.2023.119665.","journal-title":"Inf Sci"},{"issue":"3","key":"4197_CR12","doi-asserted-by":"publisher","first-page":"727","DOI":"10.1007\/s11047-009-9175-3","volume":"9","author":"E Rashedi","year":"2010","unstructured":"Rashedi E, Nezamabadi-Pour H, Saryazdi S. BGSA: binary gravitational search algorithm. Nat Comput. 2010;9(3):727\u201345. https:\/\/doi.org\/10.1007\/s11047-009-9175-3.","journal-title":"Nat Comput"},{"key":"4197_CR13","doi-asserted-by":"publisher","first-page":"128220","DOI":"10.1109\/ACCESS.2021.3112385","volume":"9","author":"J Pino-G\u00f3mez","year":"2021","unstructured":"Pino-G\u00f3mez J, Hern\u00e1ndez-Montero FE, Charles-Sotelo J, G\u00f3mez-Mancilla JC, Villendas-Rey Y. ROPM: an algorithm for computing typical testors based on recursive reductions of the basic matrix. IEEE Access. 2021;9:128220\u201332. https:\/\/doi.org\/10.1109\/ACCESS.2021.3112385.","journal-title":"IEEE Access"},{"key":"4197_CR14","doi-asserted-by":"publisher","first-page":"622","DOI":"10.1007\/s10489-014-0606-1","volume":"42","author":"I Piza-Davila","year":"2014","unstructured":"Piza-Davila I, Sanchez-Diaz G, Aguirre-Salado CA, Lazo-Cortes MS. A parallel hill-climbing algorithm to generate a subset of irreducible testors. Appl Intell. 2014;42:622\u201341. https:\/\/doi.org\/10.1007\/s10489-014-0606-1.","journal-title":"Appl Intell"},{"key":"4197_CR15","doi-asserted-by":"publisher","first-page":"22","DOI":"10.1016\/j.patrec.2017.05.026","volume":"95","author":"I Piza-Davila","year":"2017","unstructured":"Piza-Davila I, Sanchez-Diaz G, Lazo-Cortes MS, Rizo-Dominguez L. A CUDA-based hill-climbing algorithm to find irreducible testors from a training matrix. Pattern Recognit Lett. 2017;95:22\u20138. https:\/\/doi.org\/10.1016\/j.patrec.2017.05.026.","journal-title":"Pattern Recognit Lett"},{"issue":"6","key":"4197_CR16","doi-asserted-by":"publisher","first-page":"4237","DOI":"10.1007\/s10462-020-09952-0","volume":"54","author":"AE Ezugwu","year":"2021","unstructured":"Ezugwu AE, Shukla AK, Nath R, Akinyelu AA, Agushaka JO, Chiroma H, Muhuri PK. Metaheuristics: a comprehensive overview and classification along with bibliometric analysis. Artif Intell Rev. 2021;54(6):4237\u2013316. https:\/\/doi.org\/10.1007\/s10462-020-09952-0.","journal-title":"Artif Intell Rev"},{"issue":"1","key":"4197_CR17","doi-asserted-by":"publisher","first-page":"25","DOI":"10.3390\/engproc2023059238","volume":"59","author":"V Tomar","year":"2023","unstructured":"Tomar V, Bansal M, Singh P. Metaheuristic algorithms for optimization: a brief review. Eng Proc. 2023;59(1):25. https:\/\/doi.org\/10.3390\/engproc2023059238.","journal-title":"Eng Proc"},{"issue":"13","key":"4197_CR18","doi-asserted-by":"publisher","first-page":"2232","DOI":"10.1016\/j.ins.2009.03.004","volume":"179","author":"E Rashedi","year":"2009","unstructured":"Rashedi E, Nezamabadi-Pour H, Saryazdi S. GSA: a gravitational search algorithm. Inf Sci. 2009;179(13):2232\u201348. https:\/\/doi.org\/10.1016\/j.ins.2009.03.004.","journal-title":"Inf Sci"},{"key":"4197_CR19","doi-asserted-by":"publisher","DOI":"10.1016\/j.rineng.2024.102313","volume":"22","author":"T Song","year":"2024","unstructured":"Song T. Optimization technology of hydroelectric power plant unit speed control based on the constriction coefficient-based particle swarm gravitational search algorithm fusion model. Results Eng. 2024;22: 102313.","journal-title":"Results Eng"},{"key":"4197_CR20","doi-asserted-by":"publisher","first-page":"107846","DOI":"10.1016\/j.engappai.2024.107846","volume":"131","author":"Y Xiao","year":"2024","unstructured":"Xiao Y, Li H-B, Zhang Y-P. DBGSA: a novel data adaptive Bregman clustering algorithm. Eng Appl Artif Intell. 2024;131:107846.","journal-title":"Eng Appl Artif Intell"},{"issue":"2","key":"4197_CR21","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1007\/s10044-025-01446-5","volume":"28","author":"M Li","year":"2025","unstructured":"Li M, Jin C, Cai Y, Deng S, Wang L. MSGGSA: a multi-strategy-guided gravitational search algorithm for gene selection in cancer classification. Pattern Anal Appl. 2025;28(2):63.","journal-title":"Pattern Anal Appl"},{"key":"4197_CR22","doi-asserted-by":"publisher","DOI":"10.3390\/electronics13030540","author":"L Xu","year":"2024","unstructured":"Xu L, Liu Y, Fan B, Xu X, Mei Y, Feng W. An improved gravitational search algorithm for task offloading in a mobile edge computing network with task priority. Electronics. 2024. https:\/\/doi.org\/10.3390\/electronics13030540.","journal-title":"Electronics"},{"key":"4197_CR23","doi-asserted-by":"publisher","first-page":"103993","DOI":"10.1016\/j.rineng.2025.103993","volume":"25","author":"KP Sharma","year":"2025","unstructured":"Sharma KP, Lal G, Shukla M, Yadav ABJ, Juneja B, Jagtap J, Singh A, Bhowmik A, Santhosh AJ. Quantum behaved binary gravitational search algorithm with random forest for twitter spammer detection. Results Eng. 2025;25:103993. https:\/\/doi.org\/10.1016\/j.rineng.2025.103993.","journal-title":"Results Eng"},{"issue":"14","key":"4197_CR24","doi-asserted-by":"publisher","first-page":"25","DOI":"10.3390\/app14146081","volume":"14","author":"E Kocyigit","year":"2024","unstructured":"Kocyigit E, Korkmaz M, Sahingoz OK, Diri B. Enhanced feature selection using genetic algorithm for machine-learning-based phishing URL detection. Appl Sci. 2024;14(14):25. https:\/\/doi.org\/10.3390\/app14146081.","journal-title":"Appl Sci"},{"issue":"2","key":"4197_CR25","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1162\/EVCO_a_00130","volume":"23","author":"F Chicano","year":"2015","unstructured":"Chicano F, Sutton AM, Whitley LD, Alba E. Fitness probability distribution of bit-flip mutation. Evol Comput. 2015;23(2):217\u201348. https:\/\/doi.org\/10.1162\/EVCO_a_00130.","journal-title":"Evol Comput"},{"key":"4197_CR26","unstructured":"Kelly M, Longjohn R, Nottingham K. The UCI machine learning repository. https:\/\/archive.ics.uci.edu"},{"key":"4197_CR27","unstructured":"Frank E, Hall MA, Witten IH. The WEKA workbench. Online appendix for data mining: practical machine learning tools and techniques, 2nd edn. Morgan Kaufmann, Burlington (2016)"},{"key":"4197_CR28","doi-asserted-by":"publisher","unstructured":"Davis J, Goadrich M. The relationship between precision recall and roc curves. In: Proceedings of the 23rd international conference on machine learning, ICML 06. Lecture notes computer science 4756. p. 223\u201340. ACM, New York (2006). https:\/\/doi.org\/10.1145\/1143844.1143874","DOI":"10.1145\/1143844.1143874"}],"container-title":["SN Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s42979-025-04197-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s42979-025-04197-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s42979-025-04197-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,9,7]],"date-time":"2025-09-07T09:54:30Z","timestamp":1757238870000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s42979-025-04197-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,7,15]]},"references-count":28,"journal-issue":{"issue":"6","published-online":{"date-parts":[[2025,8]]}},"alternative-id":["4197"],"URL":"https:\/\/doi.org\/10.1007\/s42979-025-04197-6","relation":{},"ISSN":["2661-8907"],"issn-type":[{"type":"electronic","value":"2661-8907"}],"subject":[],"published":{"date-parts":[[2025,7,15]]},"assertion":[{"value":"21 August 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"6 July 2025","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"15 July 2025","order":3,"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 known competing financial interests or personal relationships that could have appeared to influence the work reported in this paper.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}},{"value":"Not applicable.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Consent to participate"}},{"value":"All authors have reviewed and approved the final manuscript for publication.","order":4,"name":"Ethics","group":{"name":"EthicsHeading","label":"Consent for publication"}},{"value":"Not applicable.","order":5,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethics approval"}}],"article-number":"647"}}