{"id":"https://openalex.org/W2120654202","doi":"https://doi.org/10.1145/2330163.2330276","title":"Tag-based modularity in tree-based genetic programming","display_name":"Tag-based modularity in tree-based genetic programming","publication_year":2012,"publication_date":"2012-07-07","ids":{"openalex":"https://openalex.org/W2120654202","doi":"https://doi.org/10.1145/2330163.2330276","mag":"2120654202"},"language":"en","primary_location":{"id":"doi:10.1145/2330163.2330276","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2330163.2330276","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 14th annual conference on Genetic and evolutionary computation","raw_type":"proceedings-article"},"type":"conference-paper","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/A5044142640","display_name":"Lee Spector","orcid":"https://orcid.org/0000-0001-5299-4797"},"institutions":[{"id":"https://openalex.org/I47631775","display_name":"Hampshire College","ror":"https://ror.org/03pe1mm80","country_code":"US","type":"education","lineage":["https://openalex.org/I47631775"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Lee Spector","raw_affiliation_strings":["Hampshire College, Amherst, MA, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Hampshire College, Amherst, MA, USA","institution_ids":["https://openalex.org/I47631775"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5069859821","display_name":"Kyle Harrington","orcid":"https://orcid.org/0000-0002-7237-1973"},"institutions":[{"id":"https://openalex.org/I6902469","display_name":"Brandeis University","ror":"https://ror.org/05abbep66","country_code":"US","type":"education","lineage":["https://openalex.org/I6902469"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Kyle Harrington","raw_affiliation_strings":["Brandeis University, Waltham, MA, USA","Brandeis University, WALTHAM, MA, USA#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Brandeis University, Waltham, MA, USA","institution_ids":["https://openalex.org/I6902469"]},{"raw_affiliation_string":"Brandeis University, WALTHAM, MA, USA#TAB#","institution_ids":["https://openalex.org/I6902469"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5083108240","display_name":"Thomas Helmuth","orcid":"https://orcid.org/0000-0002-2330-6809"},"institutions":[{"id":"https://openalex.org/I24603500","display_name":"University of Massachusetts Amherst","ror":"https://ror.org/0072zz521","country_code":"US","type":"education","lineage":["https://openalex.org/I24603500"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Thomas Helmuth","raw_affiliation_strings":["University of Massachusetts, Amherst, Amherst, MA, USA","University Of Massachusetts Amherst, Amherst, MA, USA#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Massachusetts, Amherst, Amherst, MA, USA","institution_ids":["https://openalex.org/I24603500"]},{"raw_affiliation_string":"University Of Massachusetts Amherst, Amherst, MA, USA#TAB#","institution_ids":["https://openalex.org/I24603500"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":2.8628,"has_fulltext":false,"cited_by_count":24,"citation_normalized_percentile":{"value":0.921341,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":94,"max":98},"biblio":{"volume":null,"issue":null,"first_page":"815","last_page":"822"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11975","display_name":"Evolutionary Algorithms and Applications","score":1.0,"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":1.0,"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.9937000274658203,"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/T10462","display_name":"Reinforcement Learning in Robotics","score":0.9717000126838684,"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":[{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.8256288766860962},{"id":"https://openalex.org/keywords/genetic-programming","display_name":"Genetic programming","score":0.7589612007141113},{"id":"https://openalex.org/keywords/modular-programming","display_name":"Modular programming","score":0.7179867029190063},{"id":"https://openalex.org/keywords/subroutine","display_name":"Subroutine","score":0.6335251927375793},{"id":"https://openalex.org/keywords/modularity","display_name":"Modularity (biology)","score":0.6324234008789062},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.6104679703712463},{"id":"https://openalex.org/keywords/modular-design","display_name":"Modular design","score":0.563655436038971},{"id":"https://openalex.org/keywords/macro","display_name":"Macro","score":0.546308696269989},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.5241370797157288},{"id":"https://openalex.org/keywords/context","display_name":"Context (archaeology)","score":0.4463549554347992},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.41746699810028076},{"id":"https://openalex.org/keywords/constraint-programming","display_name":"Constraint programming","score":0.41159144043922424},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.23841285705566406},{"id":"https://openalex.org/keywords/stochastic-programming","display_name":"Stochastic programming","score":0.11534863710403442},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.10147720575332642},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.09652885794639587}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8256288766860962},{"id":"https://openalex.org/C110332635","wikidata":"https://www.wikidata.org/wiki/Q629498","display_name":"Genetic programming","level":2,"score":0.7589612007141113},{"id":"https://openalex.org/C88482812","wikidata":"https://www.wikidata.org/wiki/Q6453666","display_name":"Modular programming","level":2,"score":0.7179867029190063},{"id":"https://openalex.org/C96147967","wikidata":"https://www.wikidata.org/wiki/Q190686","display_name":"Subroutine","level":2,"score":0.6335251927375793},{"id":"https://openalex.org/C2779478453","wikidata":"https://www.wikidata.org/wiki/Q6889748","display_name":"Modularity (biology)","level":2,"score":0.6324234008789062},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.6104679703712463},{"id":"https://openalex.org/C101468663","wikidata":"https://www.wikidata.org/wiki/Q1620158","display_name":"Modular design","level":2,"score":0.563655436038971},{"id":"https://openalex.org/C166955791","wikidata":"https://www.wikidata.org/wiki/Q629579","display_name":"Macro","level":2,"score":0.546308696269989},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.5241370797157288},{"id":"https://openalex.org/C2779343474","wikidata":"https://www.wikidata.org/wiki/Q3109175","display_name":"Context (archaeology)","level":2,"score":0.4463549554347992},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.41746699810028076},{"id":"https://openalex.org/C173404611","wikidata":"https://www.wikidata.org/wiki/Q528588","display_name":"Constraint programming","level":3,"score":0.41159144043922424},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.23841285705566406},{"id":"https://openalex.org/C137631369","wikidata":"https://www.wikidata.org/wiki/Q7617831","display_name":"Stochastic programming","level":2,"score":0.11534863710403442},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.10147720575332642},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.09652885794639587},{"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/C151730666","wikidata":"https://www.wikidata.org/wiki/Q7205","display_name":"Paleontology","level":1,"score":0.0},{"id":"https://openalex.org/C54355233","wikidata":"https://www.wikidata.org/wiki/Q7162","display_name":"Genetics","level":1,"score":0.0},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1145/2330163.2330276","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2330163.2330276","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 14th annual conference on Genetic and evolutionary computation","raw_type":"proceedings-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.593.2326","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.593.2326","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://demo.cs.brandeis.edu/papers/spector2012tags.pdf","raw_type":"text"},{"id":"pmh:oai:edoc.mdc-berlin.de:19301","is_oa":false,"landing_page_url":"http://edoc.mdc-berlin.de/19301/","pdf_url":null,"source":{"id":"https://openalex.org/S4306400224","display_name":"MDC Repository (Max-Delbrueck-Center for Molecular Medicine)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I149899117","host_organization_name":"Max Planck Society","host_organization_lineage":["https://openalex.org/I149899117"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Conference or Workshop Item"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"},{"id":"https://openalex.org/F4320310134","display_name":"Brandeis University","ror":"https://ror.org/05abbep66"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":30,"referenced_works":["https://openalex.org/W86586912","https://openalex.org/W146176885","https://openalex.org/W156916704","https://openalex.org/W1503064567","https://openalex.org/W1513108299","https://openalex.org/W1514538606","https://openalex.org/W1516867764","https://openalex.org/W1517016597","https://openalex.org/W1555512498","https://openalex.org/W1576818901","https://openalex.org/W1849579690","https://openalex.org/W1980900887","https://openalex.org/W1990236474","https://openalex.org/W2031616997","https://openalex.org/W2036097287","https://openalex.org/W2044929988","https://openalex.org/W2055289715","https://openalex.org/W2069303594","https://openalex.org/W2133905562","https://openalex.org/W2136414484","https://openalex.org/W2138183589","https://openalex.org/W2154964923","https://openalex.org/W2176907573","https://openalex.org/W2296218809","https://openalex.org/W2800005800","https://openalex.org/W3004042307","https://openalex.org/W4247621061","https://openalex.org/W4250423385","https://openalex.org/W6638998922","https://openalex.org/W7019624651"],"related_works":["https://openalex.org/W2391861012","https://openalex.org/W2488336788","https://openalex.org/W2014236444","https://openalex.org/W131171742","https://openalex.org/W2098356819","https://openalex.org/W2045702160","https://openalex.org/W4253319364","https://openalex.org/W2384184988","https://openalex.org/W2020453843","https://openalex.org/W2170478264"],"abstract_inverted_index":{"Several":[0],"techniques":[1,121],"have":[2,43,122],"been":[3,40,123],"developed":[4],"for":[5,102,117,154],"allowing":[6],"genetic":[7,59,86],"programming":[8,60,87],"systems":[9],"to":[10,42,125],"produce":[11],"programs":[12],"that":[13],"make":[14],"use":[15],"of":[16,35,37,56],"subroutines,":[17],"macros,":[18],"and":[19,32,45,105,108,152],"other":[20,119],"modular":[21],"program":[22],"structures.":[23],"A":[24],"recently":[25],"proposed":[26],"technique,":[27],"based":[28],"on":[29,69,115,136,142],"the":[30,54,57,66,91,113,137,143,149],"\"tagging\"":[31],"tag-based":[33,76],"retrieval":[34],"blocks":[36],"code,":[38],"has":[39],"shown":[41,124],"novel":[44],"desirable":[46],"features,":[47],"but":[48,140],"this":[49,70],"was":[50],"demonstrated":[51],"only":[52],"within":[53],"context":[55],"PushGP":[58],"system.":[61,88],"Following":[62],"a":[63,82],"suggestion":[64],"in":[65,93],"GECCO-2011":[67],"publication":[68],"technique":[71,92,114],"we":[72],"show":[73],"here":[74],"how":[75],"modules":[77],"can":[78],"be":[79,126],"incorporated":[80],"into":[81],"more":[83],"standard":[84],"tree-based":[85],"We":[89,147],"describe":[90],"detail":[94],"along":[95],"with":[96],"some":[97],"possible":[98],"extensions,":[99],"outline":[100],"arguments":[101],"its":[103],"simplicity":[104],"potential":[106],"power,":[107],"present":[109],"results":[110,129,151],"obtained":[111],"using":[112],"problems":[116],"which":[118],"modularization":[120],"useful.":[127],"The":[128],"are":[130,134],"mixed;":[131],"substantial":[132],"benefits":[133],"seen":[135],"lawnmower":[138],"problem":[139],"not":[141],"Boolean":[144],"even-4-parity":[145],"problem.":[146],"discuss":[148],"observed":[150],"directions":[153],"future":[155],"research.":[156]},"counts_by_year":[{"year":2023,"cited_by_count":2},{"year":2021,"cited_by_count":3},{"year":2019,"cited_by_count":2},{"year":2018,"cited_by_count":2},{"year":2017,"cited_by_count":2},{"year":2016,"cited_by_count":2},{"year":2015,"cited_by_count":3},{"year":2014,"cited_by_count":2},{"year":2013,"cited_by_count":2},{"year":2012,"cited_by_count":4}],"updated_date":"2026-07-29T14:22:42.915294","created_date":"2025-10-10T00:00:00"}