{"id":"https://openalex.org/W1963559848","doi":"https://doi.org/10.4018/jaec.2011100101","title":"Recursive Learning of Genetic Algorithms with Task Decomposition and Varied Rule Set","display_name":"Recursive Learning of Genetic Algorithms with Task Decomposition and Varied Rule Set","publication_year":2011,"publication_date":"2011-10-01","ids":{"openalex":"https://openalex.org/W1963559848","doi":"https://doi.org/10.4018/jaec.2011100101","mag":"1963559848"},"language":"en","primary_location":{"is_oa":false,"landing_page_url":"https://doi.org/10.4018/jaec.2011100101","pdf_url":null,"source":{"id":"https://openalex.org/S144758376","display_name":"International Journal of Applied Evolutionary Computation","issn_l":"1942-3594","issn":["1942-3594","1942-3608"],"is_oa":false,"is_in_doaj":false,"is_indexed_in_scopus":false,"is_core":true,"host_organization":"https://openalex.org/P4310320424","host_organization_name":"IGI Global","host_organization_lineage":["https://openalex.org/P4310320424"],"host_organization_lineage_names":["IGI Global"],"type":"journal"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false},"type":"article","type_crossref":"journal-article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5033174228","display_name":"Lei Fang","orcid":"https://orcid.org/0000-0003-2510-1281"},"institutions":[{"id":"https://openalex.org/I69356397","display_name":"Xi\u2019an Jiaotong-Liverpool University","ror":"https://ror.org/03zmrmn05","country_code":"CN","type":"funder","lineage":["https://openalex.org/I69356397"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Lei Fang","raw_affiliation_strings":["Xi\u2019an Jiaotong-Liverpool University, China"],"affiliations":[{"raw_affiliation_string":"Xi\u2019an Jiaotong-Liverpool University, China","institution_ids":["https://openalex.org/I69356397"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5065827089","display_name":"Sheng-Uei Guan","orcid":"https://orcid.org/0000-0002-3968-9752"},"institutions":[{"id":"https://openalex.org/I69356397","display_name":"Xi\u2019an Jiaotong-Liverpool University","ror":"https://ror.org/03zmrmn05","country_code":"CN","type":"funder","lineage":["https://openalex.org/I69356397"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Sheng-Uei Guan","raw_affiliation_strings":["Xi\u2019an Jiaotong-Liverpool University, China"],"affiliations":[{"raw_affiliation_string":"Xi\u2019an Jiaotong-Liverpool University, China","institution_ids":["https://openalex.org/I69356397"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5015072822","display_name":"Haofan Zhang","orcid":null},"institutions":[{"id":"https://openalex.org/I69356397","display_name":"Xi\u2019an Jiaotong-Liverpool University","ror":"https://ror.org/03zmrmn05","country_code":"CN","type":"funder","lineage":["https://openalex.org/I69356397"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Haofan Zhang","raw_affiliation_strings":["Xi\u2019an Jiaotong-Liverpool University, China"],"affiliations":[{"raw_affiliation_string":"Xi\u2019an Jiaotong-Liverpool University, China","institution_ids":["https://openalex.org/I69356397"]}]}],"institution_assertions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":1.897,"has_fulltext":false,"cited_by_count":5,"citation_normalized_percentile":{"value":0.733294,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":80,"max":81},"biblio":{"volume":"2","issue":"4","first_page":"1","last_page":"24"},"is_retracted":false,"is_paratext":false,"primary_topic":{"id":"https://openalex.org/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.9983,"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/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.9983,"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/T11975","display_name":"Evolutionary Algorithms and Applications","score":0.9945,"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/T10320","display_name":"Neural Networks and Applications","score":0.9917,"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"}}],"keywords":[],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6738099},{"id":"https://openalex.org/C95623464","wikidata":"https://www.wikidata.org/wiki/Q1096149","display_name":"Classifier (UML)","level":2,"score":0.6136219},{"id":"https://openalex.org/C124681953","wikidata":"https://www.wikidata.org/wiki/Q339062","display_name":"Decomposition","level":2,"score":0.50045824},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5001862},{"id":"https://openalex.org/C2780451532","wikidata":"https://www.wikidata.org/wiki/Q759676","display_name":"Task (project management)","level":2,"score":0.48456565},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.47190982},{"id":"https://openalex.org/C8880873","wikidata":"https://www.wikidata.org/wiki/Q187787","display_name":"Genetic algorithm","level":2,"score":0.46970436},{"id":"https://openalex.org/C30481170","wikidata":"https://www.wikidata.org/wiki/Q37748","display_name":"Chromosome","level":3,"score":0.44720873},{"id":"https://openalex.org/C177148314","wikidata":"https://www.wikidata.org/wiki/Q170084","display_name":"Generalization","level":2,"score":0.42272294},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.41285145},{"id":"https://openalex.org/C119857082","wikidata":"https://www.wikidata.org/wiki/Q2539","display_name":"Machine learning","level":1,"score":0.315866},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.22128478},{"id":"https://openalex.org/C18903297","wikidata":"https://www.wikidata.org/wiki/Q7150","display_name":"Ecology","level":1,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C55493867","wikidata":"https://www.wikidata.org/wiki/Q7094","display_name":"Biochemistry","level":1,"score":0.0},{"id":"https://openalex.org/C185592680","wikidata":"https://www.wikidata.org/wiki/Q2329","display_name":"Chemistry","level":0,"score":0.0},{"id":"https://openalex.org/C187736073","wikidata":"https://www.wikidata.org/wiki/Q2920921","display_name":"Management","level":1,"score":0.0},{"id":"https://openalex.org/C104317684","wikidata":"https://www.wikidata.org/wiki/Q7187","display_name":"Gene","level":2,"score":0.0},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"is_oa":false,"landing_page_url":"https://doi.org/10.4018/jaec.2011100101","pdf_url":null,"source":{"id":"https://openalex.org/S144758376","display_name":"International Journal of Applied Evolutionary Computation","issn_l":"1942-3594","issn":["1942-3594","1942-3608"],"is_oa":false,"is_in_doaj":false,"is_indexed_in_scopus":false,"is_core":true,"host_organization":"https://openalex.org/P4310320424","host_organization_name":"IGI Global","host_organization_lineage":["https://openalex.org/P4310320424"],"host_organization_lineage_names":["IGI Global"],"type":"journal"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false}],"best_oa_location":null,"sustainable_development_goals":[],"grants":[],"datasets":[],"versions":[],"referenced_works_count":30,"referenced_works":["https://openalex.org/W1507480455","https://openalex.org/W1542723682","https://openalex.org/W1543858068","https://openalex.org/W1592894394","https://openalex.org/W1597717349","https://openalex.org/W1953058028","https://openalex.org/W1979249127","https://openalex.org/W1980498217","https://openalex.org/W1983715910","https://openalex.org/W2000923966","https://openalex.org/W2009603406","https://openalex.org/W2067611782","https://openalex.org/W2089869769","https://openalex.org/W2100211715","https://openalex.org/W2106506049","https://openalex.org/W2115287356","https://openalex.org/W2132046479","https://openalex.org/W2134631822","https://openalex.org/W2135423934","https://openalex.org/W2136141797","https://openalex.org/W2139463648","https://openalex.org/W2142183404","https://openalex.org/W2144630308","https://openalex.org/W2146615496","https://openalex.org/W2148511931","https://openalex.org/W2151163048","https://openalex.org/W2170339732","https://openalex.org/W2189579787","https://openalex.org/W2982720039","https://openalex.org/W4236065546"],"related_works":["https://openalex.org/W43109613","https://openalex.org/W3162204513","https://openalex.org/W3022347918","https://openalex.org/W2995553446","https://openalex.org/W2371138613","https://openalex.org/W2359952343","https://openalex.org/W2239445980","https://openalex.org/W2120455979","https://openalex.org/W2080152487","https://openalex.org/W2048963458"],"abstract_inverted_index":{"Rule-based":[0],"Genetic":[1,140],"Algorithms":[2],"(GAs)":[3],"have":[4,20],"been":[5],"used":[6],"in":[7,50,81],"the":[8,23,31,58,79,88,162,169,191],"application":[9],"of":[10,55,60,139,159,164],"pattern":[11],"classification":[12,32],"(Corcoran":[13],"&":[14],"Sen,":[15],"1994),":[16],"but":[17],"conventional":[18,51,76],"GAs":[19,96,178],"weaknesses.":[21],"First,":[22],"time":[24],"spent":[25],"on":[26,106],"learning":[27],"is":[28,38,64,72,151],"long.":[29],"Moreover,":[30],"accuracy":[33,188],"achieved":[34],"by":[35],"a":[36,61,112,157],"GA":[37,62],"not":[39,73],"satisfactory.":[40],"These":[41],"drawbacks":[42],"are":[43],"due":[44],"to":[45,102,130,167,190],"existing":[46],"undesirable":[47,133],"features":[48,117],"embedded":[49],"GAs.":[52],"The":[53,135],"number":[54],"rules":[56],"within":[57],"chromosome":[59,125],"classifier":[63],"usually":[65],"set":[66],"and":[67,71,120,123,145,153,155,179,186],"fixed":[68],"before":[69],"training":[70,184],"problem-dependent.":[74],"Secondly,":[75],"approaches":[77],"train":[78],"data":[80],"batch":[82],"without":[83],"considering":[84],"whether":[85],"decomposition":[86,122],"solves":[87],"problem.":[89],"Thirdly,":[90],"when":[91],"facing":[92],"large-scale":[93],"real-world":[94],"problems,":[95],"cannot":[97],"utilise":[98],"resources":[99],"efficiently,":[100],"leading":[101],"premature":[103],"convergence.":[104],"Based":[105],"these":[107,132],"observations,":[108],"this":[109],"paper":[110],"develops":[111],"novel":[113],"algorithmic":[114],"framework":[115],"that":[116],"automatic":[118],"domain":[119],"task":[121],"problem-dependent":[124],"length":[126],"(rule":[127],"number)":[128],"selection":[129],"resolve":[131],"features.":[134],"proposed":[136],"Recursive":[137],"Learning":[138],"Algorithm":[141],"with":[142],"Task":[143],"Decomposition":[144],"Varied":[146],"Rule":[147],"Set":[148],"(RLGA)":[149],"method":[150],"recursive":[152],"trains":[154],"evolves":[156],"team":[158],"learners":[160],"using":[161],"concept":[163],"local":[165],"fitness":[166],"decompose":[168],"original":[170],"problem":[171],"into":[172],"sub-problems.":[173],"RLGA":[174],"performs":[175],"better":[176],"than":[177],"other":[180],"related":[181],"solutions":[182],"regarding":[183],"duration":[185],"generalization":[187],"according":[189],"experimental":[192],"results.":[193]},"abstract_inverted_index_v3":null,"cited_by_api_url":"https://api.openalex.org/works?filter=cites:W1963559848","counts_by_year":[{"year":2014,"cited_by_count":2},{"year":2013,"cited_by_count":1},{"year":2012,"cited_by_count":2}],"updated_date":"2025-02-21T08:24:41.344947","created_date":"2016-06-24"}