{"id":"https://openalex.org/W2170674160","doi":"https://doi.org/10.1109/tevc.2009.2040019","title":"Analysis of Computational Time of Simple Estimation of Distribution Algorithms","display_name":"Analysis of Computational Time of Simple Estimation of Distribution Algorithms","publication_year":2010,"publication_date":"2010-02-01","ids":{"openalex":"https://openalex.org/W2170674160","doi":"https://doi.org/10.1109/tevc.2009.2040019","mag":"2170674160"},"language":"en","primary_location":{"id":"doi:10.1109/tevc.2009.2040019","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tevc.2009.2040019","pdf_url":null,"source":{"id":"https://openalex.org/S93787993","display_name":"IEEE Transactions on Evolutionary Computation","issn_l":"1089-778X","issn":["1089-778X","1941-0026"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Transactions on Evolutionary Computation","raw_type":"journal-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/A5102935603","display_name":"Tianshi Chen","orcid":"https://orcid.org/0000-0001-8655-2655"},"institutions":[{"id":"https://openalex.org/I126520041","display_name":"University of Science and Technology of China","ror":"https://ror.org/04c4dkn09","country_code":"CN","type":"education","lineage":["https://openalex.org/I126520041","https://openalex.org/I19820366"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Tianshi Chen","raw_affiliation_strings":["Nature Inspired Computation and Applications Laboratory, School of Computer Science and Technology, University of Science and Technology, Hefei, Anhui, China"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Nature Inspired Computation and Applications Laboratory, School of Computer Science and Technology, University of Science and Technology, Hefei, Anhui, China","institution_ids":["https://openalex.org/I126520041"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5021254405","display_name":"Ke Tang","orcid":"https://orcid.org/0000-0002-6236-2002"},"institutions":[{"id":"https://openalex.org/I126520041","display_name":"University of Science and Technology of China","ror":"https://ror.org/04c4dkn09","country_code":"CN","type":"education","lineage":["https://openalex.org/I126520041","https://openalex.org/I19820366"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Ke Tang","raw_affiliation_strings":["Nature Inspired Computation and Applications Laboratory, School of Computer Science and Technology, University of Science and Technology, Hefei, Anhui, China"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Nature Inspired Computation and Applications Laboratory, School of Computer Science and Technology, University of Science and Technology, Hefei, Anhui, China","institution_ids":["https://openalex.org/I126520041"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5036617460","display_name":"Guoliang Chen","orcid":null},"institutions":[{"id":"https://openalex.org/I126520041","display_name":"University of Science and Technology of China","ror":"https://ror.org/04c4dkn09","country_code":"CN","type":"education","lineage":["https://openalex.org/I126520041","https://openalex.org/I19820366"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Guoliang Chen","raw_affiliation_strings":["Nature Inspired Computation and Applications Laboratory, School of Computer Science and Technology, University of Science and Technology, Hefei, Anhui, China"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Nature Inspired Computation and Applications Laboratory, School of Computer Science and Technology, University of Science and Technology, Hefei, Anhui, China","institution_ids":["https://openalex.org/I126520041"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5100635494","display_name":"Xin Yao","orcid":"https://orcid.org/0000-0001-8837-4442"},"institutions":[{"id":"https://openalex.org/I126520041","display_name":"University of Science and Technology of China","ror":"https://ror.org/04c4dkn09","country_code":"CN","type":"education","lineage":["https://openalex.org/I126520041","https://openalex.org/I19820366"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Xin Yao","raw_affiliation_strings":["Center of Excellence of Research in Computational Intelligence and Applications, School of Computer Science, University of Binningham, Birmingham, UK","Nature Inspired Computation and Applications Laboratory, School of Computer Science and Technology, University of Science and Technology, Hefei, Anhui, China"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Center of Excellence of Research in Computational Intelligence and Applications, School of Computer Science, University of Binningham, Birmingham, UK","institution_ids":[]},{"raw_affiliation_string":"Nature Inspired Computation and Applications Laboratory, School of Computer Science and Technology, University of Science and Technology, Hefei, Anhui, China","institution_ids":["https://openalex.org/I126520041"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I126520041"],"apc_list":null,"apc_paid":null,"fwci":10.7242,"has_fulltext":false,"cited_by_count":96,"citation_normalized_percentile":{"value":0.98333287,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":99},"biblio":{"volume":"14","issue":"1","first_page":"1","last_page":"22"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11303","display_name":"Bayesian Modeling and Causal Inference","score":0.9972000122070312,"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/T11303","display_name":"Bayesian Modeling and Causal Inference","score":0.9972000122070312,"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/T11106","display_name":"Data Management and Algorithms","score":0.9923999905586243,"subfield":{"id":"https://openalex.org/subfields/1711","display_name":"Signal Processing"},"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.9889000058174133,"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/edas","display_name":"EDAS","score":0.9536826014518738},{"id":"https://openalex.org/keywords/estimation-of-distribution-algorithm","display_name":"Estimation of distribution algorithm","score":0.7643906474113464},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.6529363393783569},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.6190294027328491},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6138753294944763},{"id":"https://openalex.org/keywords/evolutionary-computation","display_name":"Evolutionary computation","score":0.5053544640541077},{"id":"https://openalex.org/keywords/optimization-problem","display_name":"Optimization problem","score":0.494961678981781},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.4160008132457733},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3434576392173767},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.3320554792881012}],"concepts":[{"id":"https://openalex.org/C49284225","wikidata":"https://www.wikidata.org/wiki/Q5322829","display_name":"EDAS","level":3,"score":0.9536826014518738},{"id":"https://openalex.org/C162500139","wikidata":"https://www.wikidata.org/wiki/Q2835887","display_name":"Estimation of distribution algorithm","level":2,"score":0.7643906474113464},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.6529363393783569},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6190294027328491},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6138753294944763},{"id":"https://openalex.org/C105902424","wikidata":"https://www.wikidata.org/wiki/Q1197129","display_name":"Evolutionary computation","level":2,"score":0.5053544640541077},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.494961678981781},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.4160008132457733},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3434576392173767},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3320554792881012}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1109/tevc.2009.2040019","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tevc.2009.2040019","pdf_url":null,"source":{"id":"https://openalex.org/S93787993","display_name":"IEEE Transactions on Evolutionary Computation","issn_l":"1089-778X","issn":["1089-778X","1941-0026"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Transactions on Evolutionary Computation","raw_type":"journal-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.155.3353","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.155.3353","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cs.bham.ac.uk/~xin/papers/ChenTangChenYaoTEVC2010.pdf","raw_type":"text"},{"id":"pmh:oai:pure.atira.dk:openaire_cris_publications/64c8ca20-bf5d-4d61-83c7-1fd6f6c0ea65","is_oa":false,"landing_page_url":"https://research.birmingham.ac.uk/en/publications/64c8ca20-bf5d-4d61-83c7-1fd6f6c0ea65","pdf_url":null,"source":{"id":"https://openalex.org/S4306402634","display_name":"University of Birmingham Research Portal (University of Birmingham)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I79619799","host_organization_name":"University of Birmingham","host_organization_lineage":["https://openalex.org/I79619799"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Chen, T, Tang, K, Chen, G & Yao, X 2010, 'Analysis of Computational Time of Simple Estimation of Distribution Algorithms', IEEE Transactions on Evolutionary Computation, vol. 14, no. 1, pp. 1-22. https://doi.org/10.1109/TEVC.2009.2040019","raw_type":"article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":51,"referenced_works":["https://openalex.org/W45836896","https://openalex.org/W76645758","https://openalex.org/W203696055","https://openalex.org/W237826247","https://openalex.org/W1479911746","https://openalex.org/W1483527176","https://openalex.org/W1524657756","https://openalex.org/W1529196205","https://openalex.org/W1534834901","https://openalex.org/W1540706608","https://openalex.org/W1560047216","https://openalex.org/W1581232621","https://openalex.org/W1692958259","https://openalex.org/W1801849579","https://openalex.org/W1970101133","https://openalex.org/W1971459440","https://openalex.org/W1981482533","https://openalex.org/W1990799344","https://openalex.org/W2027945080","https://openalex.org/W2036854326","https://openalex.org/W2053135339","https://openalex.org/W2057757994","https://openalex.org/W2084149434","https://openalex.org/W2096393236","https://openalex.org/W2097724176","https://openalex.org/W2099934773","https://openalex.org/W2103012681","https://openalex.org/W2108288996","https://openalex.org/W2110667749","https://openalex.org/W2111471293","https://openalex.org/W2116832689","https://openalex.org/W2120176508","https://openalex.org/W2122833562","https://openalex.org/W2125296193","https://openalex.org/W2139015486","https://openalex.org/W2140438336","https://openalex.org/W2152325608","https://openalex.org/W2152631195","https://openalex.org/W2156622046","https://openalex.org/W2165220807","https://openalex.org/W2295428206","https://openalex.org/W2547292717","https://openalex.org/W3145128584","https://openalex.org/W4206316875","https://openalex.org/W4231916799","https://openalex.org/W4233413206","https://openalex.org/W4285719527","https://openalex.org/W4372046852","https://openalex.org/W6608293291","https://openalex.org/W6631258426","https://openalex.org/W6676695801"],"related_works":["https://openalex.org/W1982259447","https://openalex.org/W1058439126","https://openalex.org/W1503012231","https://openalex.org/W2360241151","https://openalex.org/W2496664933","https://openalex.org/W2547072840","https://openalex.org/W1544849317","https://openalex.org/W2124261928","https://openalex.org/W3149308343","https://openalex.org/W1591657267"],"abstract_inverted_index":{"Estimation":[0],"of":[1,31,60,75,105,109,132,146,165,172,222,238],"distribution":[2,83],"algorithms":[3],"(EDAs)":[4],"are":[5,159,195],"widely":[6],"used":[7],"in":[8,17,33,86,215,234],"stochastic":[9],"optimization.":[10],"Impressive":[11],"experimental":[12],"results":[13,166],"have":[14],"been":[15,24],"reported":[16],"the":[18,28,36,58,61,71,80,101,129,142,168,181,205,212,219,236,246,252],"literature.":[19],"However,":[20],"little":[21],"work":[22],"has":[23],"done":[25],"on":[26,113,167,174],"analyzing":[27,141],"computation":[29],"time":[30,73,103,144,171],"EDAs":[32,45,93],"relation":[34],"to":[35,88,99,125,140,161,217],"problem":[37,63,110,126,186,224,228,254],"size.":[38],"It":[39],"is":[40,116,202,209],"still":[41],"unclear":[42],"how":[43,98],"well":[44],"(with":[46],"a":[47,76,122,137,163,175,227],"finite":[48],"population":[49],"size":[50],"larger":[51],"than":[52],"two)":[53],"will":[54],"scale":[55],"up":[56],"when":[57],"dimension":[59],"optimization":[62],"(problem":[64],"size)":[65],"goes":[66],"up.":[67],"This":[68],"paper":[69],"studies":[70],"computational":[72,102,143],"complexity":[74,104,145],"simple":[77],"EDA,":[78],"i.e.,":[79,180],"univariate":[81],"marginal":[82],"algorithm":[84],"(UMDA),":[85],"order":[87,216],"gain":[89],"more":[90],"insight":[91],"into":[92],"complexity.":[94],"First,":[95],"we":[96,120,135,158,232],"discuss":[97,233],"measure":[100],"EDAs.":[106,133],"A":[107],"classification":[108],"hardness":[111,127],"based":[112],"our":[114,197],"discussions":[115],"then":[117],"given.":[118],"Second,":[119],"prove":[121,243],"theorem":[123],"related":[124],"and":[128,152,184],"probability":[130],"conditions":[131],"Third,":[134],"propose":[136],"novel":[138],"approach":[139],"UMDA":[147,173,247],"using":[148],"discrete":[149],"dynamic":[150],"systems":[151],"Chernoff":[153],"bounds.":[154],"Following":[155],"this":[156],"approach,":[157],"able":[160],"derive":[162],"number":[164],"first":[169],"hitting":[170],"well-known":[176],"unimodal":[177],"pseudo-boolean":[178],"function,":[179],"LeadingOnes":[182,201],"problem,":[183],"another":[185],"derived":[187],"from":[188],"LeadingOnes,":[189],"named":[190],"BVLeadingOnes.":[191],"Although":[192],"both":[193],"problems":[194],"unimodal,":[196],"analysis":[198],"shows":[199],"that":[200,245],"easy":[203],"for":[204,211,230],"UMDA,":[206,231],"while":[207],"BVLeadingOnes":[208,253],"hard":[210,229],"UMDA.":[213],"Finally,":[214],"address":[218],"key":[220],"issue":[221],"what":[223],"characteristics":[225],"make":[226],"depth":[235],"idea":[237],"\u00bfmargins\u00bf":[239],"(or":[240],"relaxation).":[241],"We":[242],"theoretically":[244],"with":[248],"margins":[249],"can":[250],"solve":[251],"efficiently.":[255]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":4},{"year":2024,"cited_by_count":6},{"year":2023,"cited_by_count":5},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":6},{"year":2020,"cited_by_count":3},{"year":2019,"cited_by_count":6},{"year":2018,"cited_by_count":8},{"year":2017,"cited_by_count":7},{"year":2016,"cited_by_count":7},{"year":2015,"cited_by_count":8},{"year":2014,"cited_by_count":9},{"year":2013,"cited_by_count":6},{"year":2012,"cited_by_count":10}],"updated_date":"2026-06-26T08:34:08.712188","created_date":"2025-10-10T00:00:00"}