{"id":"https://openalex.org/W2182389258","doi":"https://doi.org/10.5555/1953048.2021080","title":"Parallel Algorithm for Learning Optimal Bayesian Network Structure","display_name":"Parallel Algorithm for Learning Optimal Bayesian Network Structure","publication_year":2011,"publication_date":"2011-02-01","ids":{"openalex":"https://openalex.org/W2182389258","doi":"https://doi.org/10.5555/1953048.2021080","mag":"2182389258"},"language":"en","primary_location":{"id":"pmh:oai:CiteSeerX.psu:10.1.1.415.8271","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.415.8271","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://jmlr.org/papers/volume12/tamada11a/tamada11a.pdf","raw_type":"text"},"volume":null,"type":"article","is_traditional":true,"indexed_in":[],"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/A5088441205","display_name":"Yoshinori Tamada","orcid":"https://orcid.org/0000-0003-3483-9712","observed_orcids":["https://orcid.org/0000-0003-3483-9712"]},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Yoshinori Tamada","raw_affiliation_strings":[],"raw_orcid":"https://orcid.org/0000-0003-3483-9712","affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5090788230","display_name":"Seiya Imoto","orcid":"https://orcid.org/0000-0002-2989-308X","observed_orcids":["https://orcid.org/0000-0002-2989-308X"]},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Seiya Imoto","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5088167618","display_name":"Satoru Miyano","orcid":"https://orcid.org/0000-0002-1753-6616","observed_orcids":["https://orcid.org/0000-0002-1753-6616"]},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Satoru Miyano","raw_affiliation_strings":[],"raw_orcid":"https://orcid.org/0000-0002-1753-6616","affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":4.2849,"has_fulltext":false,"cited_by_count":46,"citation_normalized_percentile":{"value":0.94878698,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":88,"max":99},"biblio":{"volume":"12","issue":"73","first_page":"2437","last_page":"2459"},"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.9990000128746033,"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.9990000128746033,"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/T10538","display_name":"Data Mining Algorithms and Applications","score":9.999999747378752e-05,"subfield":{"id":"https://openalex.org/subfields/1710","display_name":"Information Systems"},"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/T10054","display_name":"Parallel Computing and Optimization Techniques","score":9.999999747378752e-05,"subfield":{"id":"https://openalex.org/subfields/1708","display_name":"Hardware and Architecture"},"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/bayesian-network-structure-learning","display_name":"Bayesian network structure learning","score":0.9879999756813049},{"id":"https://openalex.org/keywords/parallel-algorithms","display_name":"parallel algorithms","score":0.7319999933242798},{"id":"https://openalex.org/keywords/dynamic-programming","display_name":"dynamic programming","score":0.875},{"id":"https://openalex.org/keywords/score-based-learning","display_name":"score-based learning","score":0.703000009059906},{"id":"https://openalex.org/keywords/space-complexity","display_name":"space complexity","score":0.5540000200271606},{"id":"https://openalex.org/keywords/space-time-tradeoff","display_name":"space-time tradeoff","score":0.9210000038146973},{"id":"https://openalex.org/keywords/distributed-memory-supercomputers","display_name":"distributed memory supercomputers","score":0.8259999752044678},{"id":"https://openalex.org/keywords/parallel-efficiency","display_name":"parallel efficiency","score":0.7570000290870667}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7229716777801514},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.6892769932746887},{"id":"https://openalex.org/C2780513914","wikidata":"https://www.wikidata.org/wiki/Q18210350","display_name":"Bottleneck","level":2,"score":0.586864173412323},{"id":"https://openalex.org/C2779960059","wikidata":"https://www.wikidata.org/wiki/Q7113681","display_name":"Overhead (engineering)","level":2,"score":0.573976457118988},{"id":"https://openalex.org/C120373497","wikidata":"https://www.wikidata.org/wiki/Q1087987","display_name":"Parallel algorithm","level":2,"score":0.5155901312828064},{"id":"https://openalex.org/C33724603","wikidata":"https://www.wikidata.org/wiki/Q812540","display_name":"Bayesian network","level":2,"score":0.47007447481155396},{"id":"https://openalex.org/C125583679","wikidata":"https://www.wikidata.org/wiki/Q755673","display_name":"Search algorithm","level":2,"score":0.46855172514915466},{"id":"https://openalex.org/C2778572836","wikidata":"https://www.wikidata.org/wiki/Q380933","display_name":"Space (punctuation)","level":2,"score":0.46108075976371765},{"id":"https://openalex.org/C62611344","wikidata":"https://www.wikidata.org/wiki/Q1062658","display_name":"Node (physics)","level":2,"score":0.44187572598457336},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.33385393023490906},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.09799793362617493},{"id":"https://openalex.org/C66938386","wikidata":"https://www.wikidata.org/wiki/Q633538","display_name":"Structural engineering","level":1,"score":0.0},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0},{"id":"https://openalex.org/C149635348","wikidata":"https://www.wikidata.org/wiki/Q193040","display_name":"Embedded system","level":1,"score":0.0},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"pmh:oai:CiteSeerX.psu:10.1.1.415.8271","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.415.8271","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://jmlr.org/papers/volume12/tamada11a/tamada11a.pdf","raw_type":"text"},{"id":"mag:2182389258","doi":null,"is_oa":false,"landing_page_url":"https://jmlr.csail.mit.edu/papers/volume12/tamada11a/tamada11a.pdf","pdf_url":null,"source":{"id":"https://openalex.org/S118988714","display_name":"Journal of Machine Learning Research","issn_l":"1532-4435","issn":["1532-4435","1533-7928"],"is_oa":false,"is_in_doaj":false,"is_core":true,"listed_in":["anvur-class-a","anvur-scientific","ccf-a","cwts-core","dongbi-a","jufo-3","ki-jl-2","norway-2","poland-140","russia-white-list-1","vabb-shw"],"host_organization":"https://openalex.org/P4310315718","host_organization_name":"The MIT Press","host_organization_lineage":["https://openalex.org/P4310315718","https://openalex.org/P4310316440"],"host_organization_lineage_names":["The MIT Press","Massachusetts Institute of Technology"],"type":"journal"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":"Journal of Machine Learning Research","raw_type":null},{"id":"mag:2996787563","doi":"https://doi.org/10.5555/1953048.2021080","is_oa":false,"landing_page_url":"https://dl.acm.org/doi/10.5555/1953048.2021080","pdf_url":null,"source":{"id":"https://openalex.org/S118988714","display_name":"Journal of Machine Learning Research","issn_l":"1532-4435","issn":["1532-4435","1533-7928"],"is_oa":false,"is_in_doaj":false,"is_core":true,"listed_in":["anvur-class-a","anvur-scientific","ccf-a","cwts-core","dongbi-a","jufo-3","ki-jl-2","norway-2","poland-140","russia-white-list-1","vabb-shw"],"host_organization":"https://openalex.org/P4310315718","host_organization_name":"The MIT Press","host_organization_lineage":["https://openalex.org/P4310315718","https://openalex.org/P4310316440"],"host_organization_lineage_names":["The MIT Press","Massachusetts Institute of Technology"],"type":"journal"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":"Journal of Machine Learning Research","raw_type":null}],"best_oa_location":null,"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":12,"referenced_works":["https://openalex.org/W112199310","https://openalex.org/W180848368","https://openalex.org/W1517993545","https://openalex.org/W1789238264","https://openalex.org/W2010288201","https://openalex.org/W2037750941","https://openalex.org/W2090554117","https://openalex.org/W2143451896","https://openalex.org/W2159080219","https://openalex.org/W2165190832","https://openalex.org/W2169152096","https://openalex.org/W2611370172"],"related_works":["https://openalex.org/W2291336311","https://openalex.org/W7099367138","https://openalex.org/W2021368287","https://openalex.org/W2253261419","https://openalex.org/W7033086346","https://openalex.org/W2485657344","https://openalex.org/W2964239418","https://openalex.org/W1789238264","https://openalex.org/W1937181584","https://openalex.org/W1427092484"],"abstract_inverted_index":{"We":[0,182],"present":[1],"a":[2,19,68,82,167,179,189],"parallel":[3,160],"algorithm":[4,15,23,38,61,77,87,95,122,142,156,177],"for":[5,39,65,188],"the":[6,36,40,52,55,60,74,92,107,124,129,174,197],"score-based":[7],"optimal":[8,41,185],"structure":[9,42,186],"search":[10,43,125,187,200],"of":[11,44,51,71,91,138,170],"Bayesian":[12],"networks.":[13],"This":[14,121],"is":[16,32,54,62,116,135,196],"based":[17],"on":[18,145],"dynamic":[20],"programming":[21],"(DP)":[22],"having":[24],"O(n\u00b72":[25],"n)":[26],"time":[27,99,112],"and":[28,58,100,113],"space":[29,101,114,126],"complexity,":[30],"which":[31,195],"known":[33],"to":[34,67,163,173],"be":[35],"fastest":[37],"networks":[45],"with":[46,96,166,178],"n":[47],"nodes.":[48,72],"The":[49,110],"bottleneck":[50],"problem":[53],"memory":[56,147],"requirement,":[57],"therefore,":[59],"currently":[63],"applicable":[64],"up":[66,162],"few":[69],"tens":[70],"While":[73],"recently":[75],"proposed":[76,86],"overcomes":[78],"this":[79,139],"limitation":[80],"by":[81],"space-time":[83],"trade-off,":[84],"our":[85,141,155],"realizes":[88],"direct":[89],"parallelization":[90,168],"original":[93,175],"DP":[94,176],"O(n":[97,117],"\u03c3)":[98],"overhead":[102],"calculations,":[103],"where":[104],"\u03c3>0":[105],"controls":[106],"communication-space":[108],"trade-off.":[109],"overall":[111],"complexity":[115],"\u03c3+1":[118],"2":[119],"n).":[120],"splits":[123],"so":[127],"that":[128,154],"required":[130],"communication":[131],"between":[132],"independent":[133],"calculations":[134],"minimal.":[136],"Because":[137],"advantage,":[140],"can":[143,157],"run":[144,158],"distributed":[146],"supercomputers.":[148],"Through":[149],"computational":[150],"experiments,":[151],"we":[152],"confirmed":[153],"in":[159,202],"using":[161],"256":[164],"processors":[165],"efficiency":[169],"0.74,":[171],"compared":[172],"single":[180],"processor.":[181],"also":[183],"demonstrate":[184],"32-node":[190],"network":[191,199],"without":[192],"any":[193],"constraints,":[194],"largest":[198],"presented":[201],"literature.":[203]},"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":2},{"year":2021,"cited_by_count":3},{"year":2020,"cited_by_count":3},{"year":2019,"cited_by_count":2},{"year":2018,"cited_by_count":3},{"year":2017,"cited_by_count":4},{"year":2016,"cited_by_count":5},{"year":2015,"cited_by_count":5},{"year":2014,"cited_by_count":4},{"year":2013,"cited_by_count":7},{"year":2012,"cited_by_count":4}],"updated_date":"2026-11-07T11:25:07.637180","created_date":"2016-06-24T00:00:00"}