{"id":"https://openalex.org/W7162080608","doi":"https://doi.org/10.19153/cleiej.29.2.6","title":"Assessing the Effectiveness of a Genetic Programming Algorithm in Supervised Classification Tasks","display_name":"Assessing the Effectiveness of a Genetic Programming Algorithm in Supervised Classification Tasks","publication_year":2026,"publication_date":"2026-05-22","ids":{"openalex":"https://openalex.org/W7162080608","doi":"https://doi.org/10.19153/cleiej.29.2.6"},"language":"en","primary_location":{"id":"doi:10.19153/cleiej.29.2.6","is_oa":true,"landing_page_url":"https://doi.org/10.19153/cleiej.29.2.6","pdf_url":null,"source":{"id":"https://openalex.org/S164249298","display_name":"CLEI electronic journal","issn_l":"0717-5000","issn":["0717-5000"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310315484","host_organization_name":"Latin American Center for Computer Studies","host_organization_lineage":["https://openalex.org/P4310315484"],"host_organization_lineage_names":["Latin American Center for Computer Studies"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"CLEI Electronic Journal","raw_type":"journal-article"},"type":"article","indexed_in":["crossref","doaj"],"open_access":{"is_oa":true,"oa_status":"diamond","oa_url":"https://doi.org/10.19153/cleiej.29.2.6","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5136811540","display_name":"Wilson Soto","orcid":null},"institutions":[{"id":"https://openalex.org/I53276908","display_name":"Marymount University","ror":"https://ror.org/0008kv292","country_code":"US","type":"education","lineage":["https://openalex.org/I53276908"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Wilson Soto","raw_affiliation_strings":["Professor"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Professor","institution_ids":["https://openalex.org/I53276908"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5114205889","display_name":"Daniel Soto","orcid":"https://orcid.org/0000-0001-9388-827X"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Daniel Soto","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.81821062,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"29","issue":"2","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.987500011920929,"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.987500011920929,"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/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.007699999958276749,"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.001500000013038516,"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/genetic-programming","display_name":"Genetic programming","score":0.6079999804496765},{"id":"https://openalex.org/keywords/fitness-function","display_name":"Fitness function","score":0.5378999710083008},{"id":"https://openalex.org/keywords/benchmark","display_name":"Benchmark (surveying)","score":0.5281000137329102},{"id":"https://openalex.org/keywords/particle-swarm-optimization","display_name":"Particle swarm optimization","score":0.49889999628067017},{"id":"https://openalex.org/keywords/support-vector-machine","display_name":"Support vector machine","score":0.49160000681877136},{"id":"https://openalex.org/keywords/genetic-algorithm","display_name":"Genetic algorithm","score":0.4722000062465668},{"id":"https://openalex.org/keywords/directed-acyclic-graph","display_name":"Directed acyclic graph","score":0.4713999927043915},{"id":"https://openalex.org/keywords/class","display_name":"Class (philosophy)","score":0.4648999869823456},{"id":"https://openalex.org/keywords/evolutionary-algorithm","display_name":"Evolutionary algorithm","score":0.4325000047683716}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6633999943733215},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.6373000144958496},{"id":"https://openalex.org/C119857082","wikidata":"https://www.wikidata.org/wiki/Q2539","display_name":"Machine learning","level":1,"score":0.6288999915122986},{"id":"https://openalex.org/C110332635","wikidata":"https://www.wikidata.org/wiki/Q629498","display_name":"Genetic programming","level":2,"score":0.6079999804496765},{"id":"https://openalex.org/C176066374","wikidata":"https://www.wikidata.org/wiki/Q629118","display_name":"Fitness function","level":3,"score":0.5378999710083008},{"id":"https://openalex.org/C185798385","wikidata":"https://www.wikidata.org/wiki/Q1161707","display_name":"Benchmark (surveying)","level":2,"score":0.5281000137329102},{"id":"https://openalex.org/C85617194","wikidata":"https://www.wikidata.org/wiki/Q2072794","display_name":"Particle swarm optimization","level":2,"score":0.49889999628067017},{"id":"https://openalex.org/C12267149","wikidata":"https://www.wikidata.org/wiki/Q282453","display_name":"Support vector machine","level":2,"score":0.49160000681877136},{"id":"https://openalex.org/C8880873","wikidata":"https://www.wikidata.org/wiki/Q187787","display_name":"Genetic algorithm","level":2,"score":0.4722000062465668},{"id":"https://openalex.org/C74197172","wikidata":"https://www.wikidata.org/wiki/Q1195339","display_name":"Directed acyclic graph","level":2,"score":0.4713999927043915},{"id":"https://openalex.org/C2777212361","wikidata":"https://www.wikidata.org/wiki/Q5127848","display_name":"Class (philosophy)","level":2,"score":0.4648999869823456},{"id":"https://openalex.org/C159149176","wikidata":"https://www.wikidata.org/wiki/Q14489129","display_name":"Evolutionary algorithm","level":2,"score":0.4325000047683716},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4203999936580658},{"id":"https://openalex.org/C136389625","wikidata":"https://www.wikidata.org/wiki/Q334384","display_name":"Supervised learning","level":3,"score":0.32829999923706055},{"id":"https://openalex.org/C105902424","wikidata":"https://www.wikidata.org/wiki/Q1197129","display_name":"Evolutionary computation","level":2,"score":0.328000009059906},{"id":"https://openalex.org/C2780980858","wikidata":"https://www.wikidata.org/wiki/Q110022","display_name":"Dual (grammatical number)","level":2,"score":0.3093999922275543},{"id":"https://openalex.org/C124101348","wikidata":"https://www.wikidata.org/wiki/Q172491","display_name":"Data mining","level":1,"score":0.30790001153945923},{"id":"https://openalex.org/C121835503","wikidata":"https://www.wikidata.org/wiki/Q2596288","display_name":"Evolutionary programming","level":3,"score":0.3068999946117401},{"id":"https://openalex.org/C16910744","wikidata":"https://www.wikidata.org/wiki/Q7705759","display_name":"Test data","level":2,"score":0.2989000082015991},{"id":"https://openalex.org/C123860398","wikidata":"https://www.wikidata.org/wiki/Q6934605","display_name":"Multiclass classification","level":3,"score":0.298799991607666},{"id":"https://openalex.org/C14036430","wikidata":"https://www.wikidata.org/wiki/Q3736076","display_name":"Function (biology)","level":2,"score":0.2955999970436096},{"id":"https://openalex.org/C184497298","wikidata":"https://www.wikidata.org/wiki/Q7229773","display_name":"Population-based incremental learning","level":3,"score":0.29350000619888306},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.2736999988555908},{"id":"https://openalex.org/C110083411","wikidata":"https://www.wikidata.org/wiki/Q1744628","display_name":"Statistical classification","level":2,"score":0.2694999873638153},{"id":"https://openalex.org/C5536111","wikidata":"https://www.wikidata.org/wiki/Q5193250","display_name":"Cultural algorithm","level":4,"score":0.2669000029563904},{"id":"https://openalex.org/C34872919","wikidata":"https://www.wikidata.org/wiki/Q7092302","display_name":"One-class classification","level":3,"score":0.25369998812675476},{"id":"https://openalex.org/C37404715","wikidata":"https://www.wikidata.org/wiki/Q380679","display_name":"Dynamic programming","level":2,"score":0.25040000677108765}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.19153/cleiej.29.2.6","is_oa":true,"landing_page_url":"https://doi.org/10.19153/cleiej.29.2.6","pdf_url":null,"source":{"id":"https://openalex.org/S164249298","display_name":"CLEI electronic journal","issn_l":"0717-5000","issn":["0717-5000"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310315484","host_organization_name":"Latin American Center for Computer Studies","host_organization_lineage":["https://openalex.org/P4310315484"],"host_organization_lineage_names":["Latin American Center for Computer Studies"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"CLEI Electronic Journal","raw_type":"journal-article"},{"id":"pmh:oai:doaj.org/article:24d1350636c440479d3a08487aca0d77","is_oa":false,"landing_page_url":"https://doaj.org/article/24d1350636c440479d3a08487aca0d77","pdf_url":null,"source":{"id":"https://openalex.org/S4306401280","display_name":"DOAJ (DOAJ: Directory of Open Access Journals)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"CLEI Electronic Journal, Vol 29, Iss 2 (2026)","raw_type":"article"}],"best_oa_location":{"id":"doi:10.19153/cleiej.29.2.6","is_oa":true,"landing_page_url":"https://doi.org/10.19153/cleiej.29.2.6","pdf_url":null,"source":{"id":"https://openalex.org/S164249298","display_name":"CLEI electronic journal","issn_l":"0717-5000","issn":["0717-5000"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310315484","host_organization_name":"Latin American Center for Computer Studies","host_organization_lineage":["https://openalex.org/P4310315484"],"host_organization_lineage_names":["Latin American Center for Computer Studies"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"CLEI Electronic Journal","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"Evolutionary":[0],"Algorithms":[1],"(EAs)":[2],"are":[3],"population-based,":[4],"stochastic":[5],"search":[6],"algorithms":[7],"that":[8,58],"emulate":[9],"natural":[10],"evolution.":[11,53],"Over":[12],"the":[13,95,105,113],"years,":[14],"EAs":[15],"have":[16],"been":[17],"successfully":[18],"applied":[19],"to":[20,85],"numerous":[21],"classification":[22],"problems.":[23],"This":[24],"paper":[25],"proposes":[26],"an":[27,150],"enhanced":[28,144],"evolutionary":[29],"algorithm":[30,39,145],"for":[31,81],"synthesizing":[32],"classifiers":[33,158],"in":[34,42,118],"supervised":[35],"data":[36],"scenarios.":[37],"The":[38,143],"is":[40],"rooted":[41],"Genetic":[43,70],"Programming":[44],"(GP),":[45],"a":[46,69,76,98],"form":[47],"of":[48,65,92,109,115,152],"optimization":[49],"inspired":[50],"by":[51,68],"biological":[52],"GP":[54],"evolves":[55],"computer":[56],"programs":[57],"perform":[59],"specific":[60],"tasks,":[61],"represented":[62],"as":[63,130],"sets":[64],"genes":[66],"manipulated":[67],"Algorithm":[71],"(GA).":[72],"Our":[73],"approach":[74,96,123],"generates":[75],"Directed":[77],"Acyclic":[78],"Graph":[79],"(DAG)":[80],"each":[82,87],"training":[83],"class":[84,89],"align":[86],"test":[88,110],"with":[90,102],"one":[91],"them.":[93],"Additionally,":[94],"incorporates":[97],"fitness":[99],"evaluation":[100,107],"function":[101],"dual":[103],"objectives:":[104],"cumulative":[106],"values":[108],"samples":[111],"and":[112,138],"count":[114],"prediction":[116],"errors":[117],"classes.":[119],"We":[120],"benchmark":[121],"our":[122],"against":[124],"established":[125],"machine":[126],"learning":[127],"methods":[128],"such":[129],"Support":[131],"Vector":[132],"Machine":[133],"(SVM),":[134],"K-Nearest":[135],"Neighbor":[136],"(K-NN),":[137],"Particle":[139],"Swarm":[140],"Optimization":[141],"(PSO).":[142],"demonstrates":[146],"competitive":[147],"performance,":[148],"achieving":[149],"accuracy":[151],"over":[153],"70%":[154],"when":[155],"evaluating":[156],"evolving":[157],"across":[159],"twelve":[160],"public":[161],"UCI":[162],"datasets.":[163]},"counts_by_year":[],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2026-05-23T00:00:00"}