{"id":"https://openalex.org/W2117199576","doi":"https://doi.org/10.1145/1569901.1570055","title":"Binary encoding for prototype tree of probabilistic model building GP","display_name":"Binary encoding for prototype tree of probabilistic model building GP","publication_year":2009,"publication_date":"2009-07-08","ids":{"openalex":"https://openalex.org/W2117199576","doi":"https://doi.org/10.1145/1569901.1570055","mag":"2117199576"},"language":"en","primary_location":{"id":"doi:10.1145/1569901.1570055","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1569901.1570055","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 11th Annual conference on Genetic and evolutionary computation","raw_type":"proceedings-article"},"type":"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/A5020123456","display_name":"Toshihiko Yanase","orcid":"https://orcid.org/0000-0003-2971-9943"},"institutions":[{"id":"https://openalex.org/I74801974","display_name":"The University of Tokyo","ror":"https://ror.org/057zh3y96","country_code":"JP","type":"education","lineage":["https://openalex.org/I74801974"]}],"countries":["JP"],"is_corresponding":true,"raw_author_name":"Toshihiko Yanase","raw_affiliation_strings":["The University of Tokyo, Tokyo, Japan"],"affiliations":[{"raw_affiliation_string":"The University of Tokyo, Tokyo, Japan","institution_ids":["https://openalex.org/I74801974"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5046323117","display_name":"Yoshihiko Hasegawa","orcid":"https://orcid.org/0000-0001-7109-0611"},"institutions":[{"id":"https://openalex.org/I74801974","display_name":"The University of Tokyo","ror":"https://ror.org/057zh3y96","country_code":"JP","type":"education","lineage":["https://openalex.org/I74801974"]}],"countries":["JP"],"is_corresponding":false,"raw_author_name":"Yoshihiko Hasegawa","raw_affiliation_strings":["The University of Tokyo, Chiba, Japan","The University of Tokyo, Chiba, Japan#TAB#"],"affiliations":[{"raw_affiliation_string":"The University of Tokyo, Chiba, Japan","institution_ids":["https://openalex.org/I74801974"]},{"raw_affiliation_string":"The University of Tokyo, Chiba, Japan#TAB#","institution_ids":["https://openalex.org/I74801974"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5102742376","display_name":"Hitoshi Iba","orcid":"https://orcid.org/0000-0003-1607-1690"},"institutions":[{"id":"https://openalex.org/I74801974","display_name":"The University of Tokyo","ror":"https://ror.org/057zh3y96","country_code":"JP","type":"education","lineage":["https://openalex.org/I74801974"]}],"countries":["JP"],"is_corresponding":false,"raw_author_name":"Hitoshi Iba","raw_affiliation_strings":["The University of Tokyo, Tokyo, Japan"],"affiliations":[{"raw_affiliation_string":"The University of Tokyo, Tokyo, Japan","institution_ids":["https://openalex.org/I74801974"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5020123456"],"corresponding_institution_ids":["https://openalex.org/I74801974"],"apc_list":null,"apc_paid":null,"fwci":1.3086,"has_fulltext":false,"cited_by_count":7,"citation_normalized_percentile":{"value":0.8462459,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":null,"issue":null,"first_page":"1147","last_page":"1154"},"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.9979000091552734,"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.9714999794960022,"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/probabilistic-logic","display_name":"Probabilistic logic","score":0.6579596400260925},{"id":"https://openalex.org/keywords/optimal-binary-search-tree","display_name":"Optimal binary search tree","score":0.6575291752815247},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6487327814102173},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.6095143556594849},{"id":"https://openalex.org/keywords/binary-tree","display_name":"Binary tree","score":0.5978096723556519},{"id":"https://openalex.org/keywords/fitness-function","display_name":"Fitness function","score":0.5837737321853638},{"id":"https://openalex.org/keywords/tree-traversal","display_name":"Tree traversal","score":0.5756893157958984},{"id":"https://openalex.org/keywords/genetic-programming","display_name":"Genetic programming","score":0.5354858040809631},{"id":"https://openalex.org/keywords/node","display_name":"Node (physics)","score":0.5002601146697998},{"id":"https://openalex.org/keywords/search-tree","display_name":"Search tree","score":0.47781044244766235},{"id":"https://openalex.org/keywords/encoding","display_name":"Encoding (memory)","score":0.46152180433273315},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.45871666073799133},{"id":"https://openalex.org/keywords/k-ary-tree","display_name":"K-ary tree","score":0.45751187205314636},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4515003263950348},{"id":"https://openalex.org/keywords/self-balancing-binary-search-tree","display_name":"Self-balancing binary search tree","score":0.4168434739112854},{"id":"https://openalex.org/keywords/genetic-algorithm","display_name":"Genetic algorithm","score":0.38854214549064636},{"id":"https://openalex.org/keywords/search-algorithm","display_name":"Search algorithm","score":0.354790598154068},{"id":"https://openalex.org/keywords/tree-structure","display_name":"Tree structure","score":0.2730550169944763},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.2708021402359009},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.19469374418258667},{"id":"https://openalex.org/keywords/machine-learning","display_name":"Machine learning","score":0.16063949465751648},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.11574366688728333}],"concepts":[{"id":"https://openalex.org/C49937458","wikidata":"https://www.wikidata.org/wiki/Q2599292","display_name":"Probabilistic logic","level":2,"score":0.6579596400260925},{"id":"https://openalex.org/C27628562","wikidata":"https://www.wikidata.org/wiki/Q17154715","display_name":"Optimal binary search tree","level":5,"score":0.6575291752815247},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6487327814102173},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.6095143556594849},{"id":"https://openalex.org/C197855036","wikidata":"https://www.wikidata.org/wiki/Q380172","display_name":"Binary tree","level":2,"score":0.5978096723556519},{"id":"https://openalex.org/C176066374","wikidata":"https://www.wikidata.org/wiki/Q629118","display_name":"Fitness function","level":3,"score":0.5837737321853638},{"id":"https://openalex.org/C140745168","wikidata":"https://www.wikidata.org/wiki/Q1210082","display_name":"Tree traversal","level":2,"score":0.5756893157958984},{"id":"https://openalex.org/C110332635","wikidata":"https://www.wikidata.org/wiki/Q629498","display_name":"Genetic programming","level":2,"score":0.5354858040809631},{"id":"https://openalex.org/C62611344","wikidata":"https://www.wikidata.org/wiki/Q1062658","display_name":"Node (physics)","level":2,"score":0.5002601146697998},{"id":"https://openalex.org/C207024777","wikidata":"https://www.wikidata.org/wiki/Q621673","display_name":"Search tree","level":3,"score":0.47781044244766235},{"id":"https://openalex.org/C125411270","wikidata":"https://www.wikidata.org/wiki/Q18653","display_name":"Encoding (memory)","level":2,"score":0.46152180433273315},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.45871666073799133},{"id":"https://openalex.org/C100560664","wikidata":"https://www.wikidata.org/wiki/Q3608019","display_name":"K-ary tree","level":4,"score":0.45751187205314636},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4515003263950348},{"id":"https://openalex.org/C135593954","wikidata":"https://www.wikidata.org/wiki/Q245955","display_name":"Self-balancing binary search tree","level":5,"score":0.4168434739112854},{"id":"https://openalex.org/C8880873","wikidata":"https://www.wikidata.org/wiki/Q187787","display_name":"Genetic algorithm","level":2,"score":0.38854214549064636},{"id":"https://openalex.org/C125583679","wikidata":"https://www.wikidata.org/wiki/Q755673","display_name":"Search algorithm","level":2,"score":0.354790598154068},{"id":"https://openalex.org/C163797641","wikidata":"https://www.wikidata.org/wiki/Q2067937","display_name":"Tree structure","level":3,"score":0.2730550169944763},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2708021402359009},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.19469374418258667},{"id":"https://openalex.org/C119857082","wikidata":"https://www.wikidata.org/wiki/Q2539","display_name":"Machine learning","level":1,"score":0.16063949465751648},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.11574366688728333},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.0},{"id":"https://openalex.org/C66938386","wikidata":"https://www.wikidata.org/wiki/Q633538","display_name":"Structural engineering","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/1569901.1570055","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1569901.1570055","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 11th Annual conference on Genetic and evolutionary computation","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":16,"referenced_works":["https://openalex.org/W43560878","https://openalex.org/W92444230","https://openalex.org/W1522379515","https://openalex.org/W1576818901","https://openalex.org/W1591373774","https://openalex.org/W1595828617","https://openalex.org/W1640641028","https://openalex.org/W1889621155","https://openalex.org/W1947038665","https://openalex.org/W1963882626","https://openalex.org/W2105241511","https://openalex.org/W2107951961","https://openalex.org/W2121429049","https://openalex.org/W2132304387","https://openalex.org/W2134093091","https://openalex.org/W2158824656"],"related_works":["https://openalex.org/W2026697457","https://openalex.org/W4244673516","https://openalex.org/W2022598760","https://openalex.org/W2107381954","https://openalex.org/W2371680642","https://openalex.org/W2382364329","https://openalex.org/W2501849745","https://openalex.org/W2117536196","https://openalex.org/W3169685561","https://openalex.org/W2955615582"],"abstract_inverted_index":{"In":[0,118],"recent":[1],"years,":[2],"program":[3],"evolution":[4],"algorithms":[5],"based":[6,39,43],"on":[7],"the":[8,34,46,52,91,95,103,107,115,143,157,165,170,176,182],"estimation":[9],"of":[10,21,57,78,109,139,175,184],"distribution":[11],"algorithm":[12],"(EDA)":[13],"have":[14],"been":[15],"proposed":[16,177],"to":[17,26,120,136,163],"improve":[18],"search":[19,104,154],"ability":[20],"genetic":[22],"programming":[23],"(GP)":[24],"and":[25,106,156],"overcome":[27],"GP-hard":[28],"problems.":[29],"One":[30],"such":[31],"method":[32,44,151,178],"is":[33,60,146,161,179],"probabilistic":[35,116],"prototype":[36],"tree":[37,48,54,145,160,167],"(PPT)":[38],"algorithm.":[40],"The":[41,173],"PPT":[42],"explores":[45],"optimal":[47],"structure":[49],"by":[50],"using":[51],"full":[53],"whose":[55],"number":[56,77,108],"child":[58,79,100],"nodes":[59,74,83,97,101,141],"maximum":[61],"among":[62],"possible":[63],"trees.":[64],"This":[65],"algorithm,":[66],"however,":[67],"suffers":[68],"from":[69,72],"problems":[70],"arising":[71],"function":[73,82,96,134],"having":[75,98],"different":[76],"nodes.":[80],"These":[81],"cause":[84],"intron":[85],"nodes,":[86],"which":[87],"do":[88],"not":[89],"affect":[90],"fitness":[92],"function.":[93],"Moreover,":[94],"many":[99],"increase":[102],"space":[105],"samples":[110],"necessary":[111],"for":[112,128],"properly":[113],"constructing":[114],"model.":[117],"order":[119],"solve":[121],"this":[122],"problem,":[123],"we":[124,131],"propose":[125],"binary":[126,140,158],"encoding":[127],"PPT.":[129],"Here,":[130],"convert":[132],"each":[133],"node":[135],"a":[137],"subtree":[138],"where":[142],"converted":[144],"correct":[147],"in":[148],"grammar.":[149],"Our":[150],"reduces":[152],"ineffectual":[153],"space,":[155],"encoded":[159],"able":[162],"express":[164],"same":[166],"structures":[168],"as":[169],"original":[171],"method.":[172],"effectiveness":[174],"demonstrated":[180],"through":[181],"use":[183],"two":[185],"computational":[186],"experiments.":[187]},"counts_by_year":[{"year":2020,"cited_by_count":1},{"year":2016,"cited_by_count":1},{"year":2014,"cited_by_count":2},{"year":2012,"cited_by_count":2}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}