{"id":"https://openalex.org/W7139082885","doi":"https://doi.org/10.1007/s10710-026-09535-y","title":"SLIM: the non-bloating genetic programming with geometric semantic mutations and meaningful semantic crossover","display_name":"SLIM: the non-bloating genetic programming with geometric semantic mutations and meaningful semantic crossover","publication_year":2026,"publication_date":"2026-03-18","ids":{"openalex":"https://openalex.org/W7139082885","doi":"https://doi.org/10.1007/s10710-026-09535-y"},"language":"en","primary_location":{"id":"doi:10.1007/s10710-026-09535-y","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s10710-026-09535-y","pdf_url":"https://link.springer.com/content/pdf/10.1007/s10710-026-09535-y.pdf","source":{"id":"https://openalex.org/S47930974","display_name":"Genetic Programming and Evolvable Machines","issn_l":"1389-2576","issn":["1389-2576","1573-7632"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Genetic Programming and Evolvable Machines","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"hybrid","oa_url":"https://link.springer.com/content/pdf/10.1007/s10710-026-09535-y.pdf","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5056916227","display_name":"Leonardo Vanneschi","orcid":"https://orcid.org/0000-0003-4732-3328"},"institutions":[{"id":"https://openalex.org/I83558840","display_name":"Universidade Nova de Lisboa","ror":"https://ror.org/02xankh89","country_code":"PT","type":"education","lineage":["https://openalex.org/I83558840"]}],"countries":["PT"],"is_corresponding":true,"raw_author_name":"Leonardo Vanneschi","raw_affiliation_strings":["NOVA Information Management School (NOVA IMS), Universidade Nova de Lisboa, Campus de Campolide, 1070-312, Lisboa, Portugal"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"NOVA Information Management School (NOVA IMS), Universidade Nova de Lisboa, Campus de Campolide, 1070-312, Lisboa, Portugal","institution_ids":["https://openalex.org/I83558840"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5129872980","display_name":"Sofia Pereira","orcid":null},"institutions":[{"id":"https://openalex.org/I83558840","display_name":"Universidade Nova de Lisboa","ror":"https://ror.org/02xankh89","country_code":"PT","type":"education","lineage":["https://openalex.org/I83558840"]}],"countries":["PT"],"is_corresponding":false,"raw_author_name":"Sofia Pereira","raw_affiliation_strings":["NOVA Information Management School (NOVA IMS), Universidade Nova de Lisboa, Campus de Campolide, 1070-312, Lisboa, Portugal"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"NOVA Information Management School (NOVA IMS), Universidade Nova de Lisboa, Campus de Campolide, 1070-312, Lisboa, Portugal","institution_ids":["https://openalex.org/I83558840"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5055529709","display_name":"Davide Farinati","orcid":"https://orcid.org/0000-0003-2925-527X"},"institutions":[{"id":"https://openalex.org/I83558840","display_name":"Universidade Nova de Lisboa","ror":"https://ror.org/02xankh89","country_code":"PT","type":"education","lineage":["https://openalex.org/I83558840"]}],"countries":["PT"],"is_corresponding":false,"raw_author_name":"Davide Farinati","raw_affiliation_strings":["NOVA Information Management School (NOVA IMS), Universidade Nova de Lisboa, Campus de Campolide, 1070-312, Lisboa, Portugal"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"NOVA Information Management School (NOVA IMS), Universidade Nova de Lisboa, Campus de Campolide, 1070-312, Lisboa, Portugal","institution_ids":["https://openalex.org/I83558840"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5056916227"],"corresponding_institution_ids":["https://openalex.org/I83558840"],"apc_list":{"value":2290,"currency":"EUR","value_usd":2890},"apc_paid":{"value":2290,"currency":"EUR","value_usd":2890},"fwci":0.0,"has_fulltext":true,"cited_by_count":0,"citation_normalized_percentile":{"value":0.43802143,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"27","issue":"1","first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11975","display_name":"Evolutionary Algorithms and Applications","score":0.988099992275238,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T11975","display_name":"Evolutionary Algorithms and Applications","score":0.988099992275238,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T12535","display_name":"Machine Learning and Data Classification","score":0.0017000000225380063,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10848","display_name":"Advanced Multi-Objective Optimization Algorithms","score":0.0015999999595806003,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/crossover","display_name":"Crossover","score":0.8496999740600586},{"id":"https://openalex.org/keywords/mutation","display_name":"Mutation","score":0.6115999817848206},{"id":"https://openalex.org/keywords/genetic-programming","display_name":"Genetic programming","score":0.5900999903678894},{"id":"https://openalex.org/keywords/interpretability","display_name":"Interpretability","score":0.5454999804496765},{"id":"https://openalex.org/keywords/feature","display_name":"Feature (linguistics)","score":0.517799973487854},{"id":"https://openalex.org/keywords/simplicity","display_name":"Simplicity","score":0.4959000051021576}],"concepts":[{"id":"https://openalex.org/C122507166","wikidata":"https://www.wikidata.org/wiki/Q628906","display_name":"Crossover","level":2,"score":0.8496999740600586},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7882999777793884},{"id":"https://openalex.org/C501734568","wikidata":"https://www.wikidata.org/wiki/Q42918","display_name":"Mutation","level":3,"score":0.6115999817848206},{"id":"https://openalex.org/C110332635","wikidata":"https://www.wikidata.org/wiki/Q629498","display_name":"Genetic programming","level":2,"score":0.5900999903678894},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.5534999966621399},{"id":"https://openalex.org/C2781067378","wikidata":"https://www.wikidata.org/wiki/Q17027399","display_name":"Interpretability","level":2,"score":0.5454999804496765},{"id":"https://openalex.org/C2776401178","wikidata":"https://www.wikidata.org/wiki/Q12050496","display_name":"Feature (linguistics)","level":2,"score":0.517799973487854},{"id":"https://openalex.org/C2776372474","wikidata":"https://www.wikidata.org/wiki/Q508291","display_name":"Simplicity","level":2,"score":0.4959000051021576},{"id":"https://openalex.org/C184337299","wikidata":"https://www.wikidata.org/wiki/Q1437428","display_name":"Semantics (computer science)","level":2,"score":0.4749999940395355},{"id":"https://openalex.org/C8880873","wikidata":"https://www.wikidata.org/wiki/Q187787","display_name":"Genetic algorithm","level":2,"score":0.4652999937534332},{"id":"https://openalex.org/C127705205","wikidata":"https://www.wikidata.org/wiki/Q5748245","display_name":"Heuristics","level":2,"score":0.43230000138282776},{"id":"https://openalex.org/C119857082","wikidata":"https://www.wikidata.org/wiki/Q2539","display_name":"Machine learning","level":1,"score":0.3991999924182892},{"id":"https://openalex.org/C130318100","wikidata":"https://www.wikidata.org/wiki/Q2268914","display_name":"Semantic similarity","level":2,"score":0.3824000060558319},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.28360000252723694},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.26019999384880066},{"id":"https://openalex.org/C197914299","wikidata":"https://www.wikidata.org/wiki/Q18650","display_name":"Semantic memory","level":3,"score":0.25200000405311584},{"id":"https://openalex.org/C2777303404","wikidata":"https://www.wikidata.org/wiki/Q759757","display_name":"Convergence (economics)","level":2,"score":0.25130000710487366}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1007/s10710-026-09535-y","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s10710-026-09535-y","pdf_url":"https://link.springer.com/content/pdf/10.1007/s10710-026-09535-y.pdf","source":{"id":"https://openalex.org/S47930974","display_name":"Genetic Programming and Evolvable Machines","issn_l":"1389-2576","issn":["1389-2576","1573-7632"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Genetic Programming and Evolvable Machines","raw_type":"journal-article"}],"best_oa_location":{"id":"doi:10.1007/s10710-026-09535-y","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s10710-026-09535-y","pdf_url":"https://link.springer.com/content/pdf/10.1007/s10710-026-09535-y.pdf","source":{"id":"https://openalex.org/S47930974","display_name":"Genetic Programming and Evolvable Machines","issn_l":"1389-2576","issn":["1389-2576","1573-7632"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Genetic Programming and Evolvable Machines","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320323459","display_name":"Universidade Nova de Lisboa","ror":"https://ror.org/02xankh89"},{"id":"https://openalex.org/F4320334779","display_name":"Funda\u00e7\u00e3o para a Ci\u00eancia e a Tecnologia","ror":"https://ror.org/00snfqn58"}],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W7139082885.pdf","grobid_xml":"https://content.openalex.org/works/W7139082885.grobid-xml"},"referenced_works_count":33,"referenced_works":["https://openalex.org/W100376849","https://openalex.org/W102043130","https://openalex.org/W1495796602","https://openalex.org/W1795093649","https://openalex.org/W1969885422","https://openalex.org/W1970404859","https://openalex.org/W1979421549","https://openalex.org/W1980486587","https://openalex.org/W1990012648","https://openalex.org/W1995423934","https://openalex.org/W2011209865","https://openalex.org/W2154876023","https://openalex.org/W2172318997","https://openalex.org/W2516977959","https://openalex.org/W2554602678","https://openalex.org/W2588072912","https://openalex.org/W2727951035","https://openalex.org/W2796481166","https://openalex.org/W2893450111","https://openalex.org/W2972198236","https://openalex.org/W4214856922","https://openalex.org/W4226083102","https://openalex.org/W4280576278","https://openalex.org/W4316015529","https://openalex.org/W4385196262","https://openalex.org/W4385813880","https://openalex.org/W4391654066","https://openalex.org/W4392656251","https://openalex.org/W4395093945","https://openalex.org/W4408012455","https://openalex.org/W4409674077","https://openalex.org/W4412106732","https://openalex.org/W6907785445"],"related_works":[],"abstract_inverted_index":{"Abstract":[0],"The":[1,152],"Semantic":[2,18,161],"Learning":[3,162],"algorithm":[4,163],"based":[5],"on":[6],"Inflate":[7],"and":[8,79,102,167,182,220],"deflate":[9,82],"Mutation":[10],"(SLIM)":[11],"represents":[12],"a":[13,29,80,93,121],"recent":[14],"advancement":[15],"in":[16,104],"Geometric":[17],"Genetic":[19],"Programming":[20],"(GSGP).":[21],"While":[22],"maintaining":[23],"the":[24,40,63,86,107,114,128,145,177],"unique":[25],"feature":[26],"of":[27,42,88,117,138,148,179,188],"generating":[28,43],"unimodal":[30],"error":[31],"surface":[32],"for":[33,49,176,195,216],"all":[34],"supervised":[35],"learning":[36],"tasks,":[37],"SLIM":[38,56,118,181],"has":[39,85],"ability":[41,87,203],"models":[44,209],"that":[45,84,155],"remain":[46],"sufficiently":[47],"compact":[48,208],"human":[50],"interpretation.":[51],"In":[52],"its":[53,192,214],"initial":[54],"definition,":[55],"was":[57],"characterized":[58],"by":[59,119],"two":[60],"mutation":[61,70,83],"operators:":[62],"traditional":[64,129],"geometric":[65,130],"semantic":[66,131],"mutation,":[67],"called":[68],"inflate":[69],"because":[71],"it":[72],"produces":[73],"offspring":[74],"larger":[75],"than":[76,210],"their":[77],"parents,":[78],"new":[81,122],"creating":[89],"smaller":[90],"offspring,":[91],"offering":[92],"novel":[94,153],"approach":[95],"to":[96,127,135,204],"managing":[97],"model":[98,221],"complexity.":[99],"Besides":[100],"deepening":[101],"interpreting":[103],"greater":[105],"depth":[106],"experimental":[108],"results,":[109],"this":[110,149,157],"work":[111],"further":[112,189,212],"enriches":[113],"foundational":[115],"concepts":[116],"integrating":[120],"crossover":[123,158],"operator,":[124],"that,":[125],"contrarily":[126],"crossover,":[132],"is":[133,159],"able":[134],"generate":[136],"individuals":[137],"small":[139],"size.":[140],"Our":[141],"comprehensive":[142],"analysis":[143],"explores":[144],"wider":[146],"implications":[147],"innovative":[150],"operator.":[151],"variant":[154],"integrates":[156],"named":[160],"with":[164],"Inflate/deflate":[165],"Mutations":[166],"MEaningful":[168],"Recombination":[169],"(SLIMMER).":[170],"Experimental":[171],"results":[172],"provide":[173],"strong":[174],"support":[175],"potential":[178],"both":[180],"SLIMMER":[183,199],"as":[184],"effective":[185],"approaches":[186],"worthy":[187],"research.":[190],"As":[191],"name":[193],"suggests,":[194],"some":[196],"test":[197],"cases":[198],"demonstrates":[200],"an":[201],"enhanced":[202],"produce":[205],"even":[206],"more":[207],"SLIM,":[211],"reinforcing":[213],"promise":[215],"applications":[217],"where":[218],"interpretability":[219],"simplicity":[222],"are":[223],"essential.":[224]},"counts_by_year":[],"updated_date":"2026-05-21T06:26:12.895304","created_date":"2026-03-20T00:00:00"}