乐胖代购免代理版

{"id":"https://openalex.org/W178780724","doi":"https://doi.org/10.1016/j.scient.2013.02.027","title":"Effective pruning strategies for branch and bound Bayesian networks structure learning from data","display_name":"Effective pruning strategies for branch and bound Bayesian networks structure learning from data","publication_year":2013,"publication_date":"2013-06-01","ids":{"openalex":"https://openalex.org/W178780724","doi":"https://doi.org/10.1016/j.scient.2013.02.027","mag":"178780724"},"language":"en","primary_location":{"is_oa":false,"landing_page_url":"https://www.sciencedirect.com/science/article/pii/S1026309813000333","pdf_url":null,"source":{"id":"https://openalex.org/S2498435459","display_name":"Scientia Iranica","issn_l":"1026-3098","issn":["1026-3098","2345-3605"],"is_oa":true,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319005","host_organization_name":"Sharif University of Technology","host_organization_lineage":["https://openalex.org/P4310319005"],"host_organization_lineage_names":["Sharif University of Technology"],"type":"journal"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false},"type":"article","type_crossref":"journal-article","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/A5029551608","display_name":"Kobra Etminani","orcid":"https://orcid.org/0000-0003-2006-6229"},"institutions":[{"id":"https://openalex.org/I86958956","display_name":"Ferdowsi University of Mashhad","ror":"https://ror.org/00g6ka752","country_code":"IR","type":"education","lineage":["https://openalex.org/I86958956"]}],"countries":["IR"],"is_corresponding":false,"raw_author_name":"Kobra Etminani","raw_affiliation_strings":["Dept of Computer Engineering, Ferdowsi University of Mashhad, Iran"],"affiliations":[{"raw_affiliation_string":"Dept of Computer Engineering, Ferdowsi University of Mashhad, Iran","institution_ids":["https://openalex.org/I86958956"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5000670364","display_name":"Mahmoud Naghibzadeh","orcid":null},"institutions":[{"id":"https://openalex.org/I86958956","display_name":"Ferdowsi University of Mashhad","ror":"https://ror.org/00g6ka752","country_code":"IR","type":"education","lineage":["https://openalex.org/I86958956"]}],"countries":["IR"],"is_corresponding":false,"raw_author_name":"Mahmoud Naghibzadeh","raw_affiliation_strings":["Dept of Computer Engineering, Ferdowsi University of Mashhad, Iran"],"affiliations":[{"raw_affiliation_string":"Dept of Computer Engineering, Ferdowsi University of Mashhad, Iran","institution_ids":["https://openalex.org/I86958956"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5111483730","display_name":"Amir Reza Razavi","orcid":null},"institutions":[{"id":"https://openalex.org/I165560825","display_name":"Mashhad University of Medical Sciences","ror":"https://ror.org/04sfka033","country_code":"IR","type":"education","lineage":["https://openalex.org/I165560825"]}],"countries":["IR"],"is_corresponding":false,"raw_author_name":"Amir Reza Razavi","raw_affiliation_strings":["Department of Medical Informatics, Mashhad University of Medical Sciences, Iran"],"affiliations":[{"raw_affiliation_string":"Department of Medical Informatics, Mashhad University of Medical Sciences, Iran","institution_ids":["https://openalex.org/I165560825"]}]}],"institution_assertions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":true,"fulltext_origin":"ngrams","cited_by_count":3,"citation_normalized_percentile":{"value":0.67129,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":76,"max":78},"biblio":{"volume":"20","issue":"3","first_page":"682","last_page":"694"},"is_retracted":false,"is_paratext":false,"primary_topic":{"id":"https://openalex.org/T11303","display_name":"Bayesian Modeling and Causal Inference","score":0.9999,"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.9999,"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/T10050","display_name":"Multi-Criteria Decision Making","score":0.989,"subfield":{"id":"https://openalex.org/subfields/1803","display_name":"Management Science and Operations Research"},"field":{"id":"https://openalex.org/fields/18","display_name":"Decision Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},{"id":"https://openalex.org/T12535","display_name":"Machine Learning and Data Classification","score":0.9542,"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/pruning","display_name":"Pruning","score":0.8057487},{"id":"https://openalex.org/keywords/branch-and-bound","display_name":"Branch and bound","score":0.65650815},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.57592016}],"concepts":[{"id":"https://openalex.org/C108010975","wikidata":"https://www.wikidata.org/wiki/Q500094","display_name":"Pruning","level":2,"score":0.8057487},{"id":"https://openalex.org/C93693863","wikidata":"https://www.wikidata.org/wiki/Q897659","display_name":"Branch and bound","level":2,"score":0.65650815},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.59368795},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.57592016},{"id":"https://openalex.org/C14036430","wikidata":"https://www.wikidata.org/wiki/Q3736076","display_name":"Function (biology)","level":2,"score":0.57550275},{"id":"https://openalex.org/C33724603","wikidata":"https://www.wikidata.org/wiki/Q812540","display_name":"Bayesian network","level":2,"score":0.5569322},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.540359},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.48596108},{"id":"https://openalex.org/C107673813","wikidata":"https://www.wikidata.org/wiki/Q812534","display_name":"Bayesian probability","level":2,"score":0.46756965},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.37512687},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.32301235},{"id":"https://openalex.org/C119857082","wikidata":"https://www.wikidata.org/wiki/Q2539","display_name":"Machine learning","level":1,"score":0.30784023},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.29410428},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.07439396},{"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/C78458016","wikidata":"https://www.wikidata.org/wiki/Q840400","display_name":"Evolutionary biology","level":1,"score":0.0},{"id":"https://openalex.org/C6557445","wikidata":"https://www.wikidata.org/wiki/Q173113","display_name":"Agronomy","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":1,"locations":[{"is_oa":false,"landing_page_url":"https://www.sciencedirect.com/science/article/pii/S1026309813000333","pdf_url":null,"source":{"id":"https://openalex.org/S2498435459","display_name":"Scientia Iranica","issn_l":"1026-3098","issn":["1026-3098","2345-3605"],"is_oa":true,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319005","host_organization_name":"Sharif University of Technology","host_organization_lineage":["https://openalex.org/P4310319005"],"host_organization_lineage_names":["Sharif University of Technology"],"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":33,"referenced_works":["https://openalex.org/W1528905581","https://openalex.org/W1530476443","https://openalex.org/W1530964327","https://openalex.org/W1593793857","https://openalex.org/W168332103","https://openalex.org/W1789238264","https://openalex.org/W1817561967","https://openalex.org/W1970687027","https://openalex.org/W1975062332","https://openalex.org/W1982634635","https://openalex.org/W1994853484","https://openalex.org/W2008906462","https://openalex.org/W2023003462","https://openalex.org/W2038374320","https://openalex.org/W2044758663","https://openalex.org/W2069033123","https://openalex.org/W2074299640","https://openalex.org/W2091364465","https://openalex.org/W2102022980","https://openalex.org/W2111574971","https://openalex.org/W2113078405","https://openalex.org/W2137587467","https://openalex.org/W2142635246","https://openalex.org/W2144731007","https://openalex.org/W2156094048","https://openalex.org/W2169152096","https://openalex.org/W2170112109","https://openalex.org/W2172238468","https://openalex.org/W2223868250","https://openalex.org/W2249676289","https://openalex.org/W2339500526","https://openalex.org/W2611370172","https://openalex.org/W3133236490"],"related_works":["https://openalex.org/W3177307174","https://openalex.org/W3090460193","https://openalex.org/W3013686927","https://openalex.org/W2982485277","https://openalex.org/W2974234031","https://openalex.org/W2964821717","https://openalex.org/W2951673861","https://openalex.org/W2949622632","https://openalex.org/W2949401830","https://openalex.org/W2949234610","https://openalex.org/W2808378693","https://openalex.org/W2794874231","https://openalex.org/W2587993011","https://openalex.org/W2561206449","https://openalex.org/W2407793835","https://openalex.org/W2261376402","https://openalex.org/W2260734088","https://openalex.org/W2251464800","https://openalex.org/W2165085685","https://openalex.org/W2097249131"],"abstract_inverted_index":{"Abstract":[0],"In":[3,125],"this":[4,88,126],"paper,":[5],"designing":[6],"a":[7,13,31,46,128,155],"Bayesian":[8],"network":[9,47,150],"structure":[10,151],"to":[11,29,50,86,101,115,145,154,184],"maximize":[12],"score":[14,157],"function":[15,26],"based":[16],"on":[17,210],"learning":[18],"from":[19],"data":[20],"strategy":[21],"is":[22,27,48,106,114,140,143,160,167,214],"studied.":[23],"The":[24,108,206,221],"scoring":[25],"considered":[28],"be":[30,51],"decomposable":[32],"one":[33],"such":[34,45,74],"as":[35,61,75],"BDeu,":[36],"BIC,":[37],"BD,":[38],"BDe":[39],"or":[40,97],"AIC.":[41],"Optimal":[42],"design":[43],"of":[44,64,110,188,202,208,238,241],"known":[49],"an":[52,103,161],"NP-hard":[53],"problem":[54],"and":[55,79,81,131,138,194,235,244],"the":[56,62,69,98,111,117,147,172,186,192,200,217,231,236,242],"solution":[57,105,174],"becomes":[58],"rapidly":[59],"infeasible":[60],"number":[63,187,237],"variables":[65],"(i.e.,":[66],"nodes":[67,189,240],"in":[68,191,226,230],"network)":[70],"increases.":[71],"Several":[72,179],"methods":[73],"hill-climbing,":[76],"dynamic":[77],"programming,":[78],"branch":[80,130,193,243],"bound":[82,132,195,245],"techniques":[83,92],"are":[84,182],"proposed":[85,141,183],"tackle":[87],"problem.":[89],"However,":[90],"these":[91,203],"either":[93],"produce":[94,102],"sub-optimal":[95],"solutions":[96,113],"time":[99,119],"required":[100,232],"optimal":[104,149],"unacceptable.":[107],"challenge":[109],"latter":[112],"reduce":[116,185],"computation":[118],"necessary":[120],"for":[121],"large-size":[122],"problems.":[123],"study,":[127],"new":[129],"method":[133],"called":[134],"PBB":[135],"(pruned":[136],"brand":[137],"bound)":[139],"which":[142],"expected":[144],"find":[146],"globally":[148],"with":[152,216],"respect":[153],"given":[156],"function.":[158],"It":[159],"any-time":[162],"method,":[163],"i.e.,":[164],"if":[165],"it":[166,170],"externally":[168],"stopped,":[169],"gives":[171],"best":[173],"found":[175],"until":[176],"that":[177],"time.":[178],"pruning":[180,204],"strategies":[181],"created":[190,239],"tree.":[196,246],"Practical":[197],"experiments":[198],"show":[199,223],"effectiveness":[201],"strategies.":[205],"performance":[207],"PBB,":[209],"several":[211],"common":[212],"datasets,":[213],"compared":[215],"latest":[218],"state-of-the-art":[219],"methods.":[220],"results":[222],"its":[224],"superiority":[225],"many":[227],"aspects,":[228],"especially,":[229],"running":[233],"time,":[234]},"cited_by_api_url":"https://api.openalex.org/works?filter=cites:W178780724","counts_by_year":[{"year":2021,"cited_by_count":1},{"year":2017,"cited_by_count":2}],"updated_date":"2024-12-20T12:58:03.873631","created_date":"2016-06-24"}