{"id":"https://openalex.org/W3091619638","doi":"https://doi.org/10.3233/ida-194844","title":"An efficient Bayesian network structure learning algorithm using the strategy of two-stage searches","display_name":"An efficient Bayesian network structure learning algorithm using the strategy of two-stage searches","publication_year":2020,"publication_date":"2020-09-30","ids":{"openalex":"https://openalex.org/W3091619638","doi":"https://doi.org/10.3233/ida-194844","mag":"3091619638"},"language":"en","primary_location":{"id":"doi:10.3233/ida-194844","is_oa":false,"landing_page_url":"https://doi.org/10.3233/ida-194844","pdf_url":null,"source":{"id":"https://openalex.org/S2498839158","display_name":"Intelligent Data Analysis","issn_l":"1088-467X","issn":["1088-467X","1571-4128"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310318577","host_organization_name":"IOS Press","host_organization_lineage":["https://openalex.org/P4310318577"],"host_organization_lineage_names":["IOS Press"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Intelligent Data Analysis","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/A5027618460","display_name":"Huiping Guo","orcid":"https://orcid.org/0000-0002-6695-2982"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Huiping Guo","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5100602276","display_name":"Hongru Li","orcid":"https://orcid.org/0000-0003-4700-962X"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Hongru Li","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5100602276"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.948,"has_fulltext":false,"cited_by_count":10,"citation_normalized_percentile":{"value":0.81377774,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":94,"max":98},"biblio":{"volume":"24","issue":"5","first_page":"1087","last_page":"1106"},"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.9994000196456909,"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.9994000196456909,"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/T11063","display_name":"Rough Sets and Fuzzy Logic","score":0.9668999910354614,"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"}},{"id":"https://openalex.org/T13734","display_name":"Advanced Computational Techniques and Applications","score":0.9388999938964844,"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.5813144445419312},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.5572500824928284},{"id":"https://openalex.org/keywords/space","display_name":"Space (punctuation)","score":0.5205194354057312},{"id":"https://openalex.org/keywords/local-search","display_name":"Local search (optimization)","score":0.4937673509120941},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4813828766345978},{"id":"https://openalex.org/keywords/search-algorithm","display_name":"Search algorithm","score":0.4791254997253418},{"id":"https://openalex.org/keywords/incremental-heuristic-search","display_name":"Incremental heuristic search","score":0.47471797466278076},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.4745236933231354},{"id":"https://openalex.org/keywords/bidirectional-search","display_name":"Bidirectional search","score":0.47068125009536743},{"id":"https://openalex.org/keywords/particle-swarm-optimization","display_name":"Particle swarm optimization","score":0.47048071026802063},{"id":"https://openalex.org/keywords/iterative-deepening-depth-first-search","display_name":"Iterative deepening depth-first search","score":0.45570477843284607},{"id":"https://openalex.org/keywords/best-first-search","display_name":"Best-first search","score":0.4556747376918793},{"id":"https://openalex.org/keywords/beam-stack-search","display_name":"Beam stack search","score":0.43553900718688965},{"id":"https://openalex.org/keywords/hybrid-algorithm","display_name":"Hybrid algorithm (constraint satisfaction)","score":0.4354203939437866},{"id":"https://openalex.org/keywords/bayesian-network","display_name":"Bayesian network","score":0.4350975751876831},{"id":"https://openalex.org/keywords/binary-search-algorithm","display_name":"Binary search algorithm","score":0.4195631742477417},{"id":"https://openalex.org/keywords/beam-search","display_name":"Beam search","score":0.4099816381931305},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.3190857768058777},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.31090766191482544}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5813144445419312},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.5572500824928284},{"id":"https://openalex.org/C2778572836","wikidata":"https://www.wikidata.org/wiki/Q380933","display_name":"Space (punctuation)","level":2,"score":0.5205194354057312},{"id":"https://openalex.org/C135320971","wikidata":"https://www.wikidata.org/wiki/Q1868524","display_name":"Local search (optimization)","level":2,"score":0.4937673509120941},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4813828766345978},{"id":"https://openalex.org/C125583679","wikidata":"https://www.wikidata.org/wiki/Q755673","display_name":"Search algorithm","level":2,"score":0.4791254997253418},{"id":"https://openalex.org/C139979381","wikidata":"https://www.wikidata.org/wiki/Q17056021","display_name":"Incremental heuristic search","level":4,"score":0.47471797466278076},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.4745236933231354},{"id":"https://openalex.org/C831591","wikidata":"https://www.wikidata.org/wiki/Q59750","display_name":"Bidirectional search","level":5,"score":0.47068125009536743},{"id":"https://openalex.org/C85617194","wikidata":"https://www.wikidata.org/wiki/Q2072794","display_name":"Particle swarm optimization","level":2,"score":0.47048071026802063},{"id":"https://openalex.org/C14362708","wikidata":"https://www.wikidata.org/wiki/Q1675274","display_name":"Iterative deepening depth-first search","level":5,"score":0.45570477843284607},{"id":"https://openalex.org/C46011968","wikidata":"https://www.wikidata.org/wiki/Q830527","display_name":"Best-first search","level":4,"score":0.4556747376918793},{"id":"https://openalex.org/C194036150","wikidata":"https://www.wikidata.org/wiki/Q4876196","display_name":"Beam stack search","level":5,"score":0.43553900718688965},{"id":"https://openalex.org/C62469222","wikidata":"https://www.wikidata.org/wiki/Q17092103","display_name":"Hybrid algorithm (constraint satisfaction)","level":5,"score":0.4354203939437866},{"id":"https://openalex.org/C33724603","wikidata":"https://www.wikidata.org/wiki/Q812540","display_name":"Bayesian network","level":2,"score":0.4350975751876831},{"id":"https://openalex.org/C121610932","wikidata":"https://www.wikidata.org/wiki/Q243754","display_name":"Binary search algorithm","level":3,"score":0.4195631742477417},{"id":"https://openalex.org/C19889080","wikidata":"https://www.wikidata.org/wiki/Q2835852","display_name":"Beam search","level":3,"score":0.4099816381931305},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.3190857768058777},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.31090766191482544},{"id":"https://openalex.org/C176783269","wikidata":"https://www.wikidata.org/wiki/Q5164378","display_name":"Constraint logic programming","level":4,"score":0.0},{"id":"https://openalex.org/C44616089","wikidata":"https://www.wikidata.org/wiki/Q30158686","display_name":"Constraint satisfaction","level":3,"score":0.0},{"id":"https://openalex.org/C49937458","wikidata":"https://www.wikidata.org/wiki/Q2599292","display_name":"Probabilistic logic","level":2,"score":0.0},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.3233/ida-194844","is_oa":false,"landing_page_url":"https://doi.org/10.3233/ida-194844","pdf_url":null,"source":{"id":"https://openalex.org/S2498839158","display_name":"Intelligent Data Analysis","issn_l":"1088-467X","issn":["1088-467X","1571-4128"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310318577","host_organization_name":"IOS Press","host_organization_lineage":["https://openalex.org/P4310318577"],"host_organization_lineage_names":["IOS Press"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Intelligent Data Analysis","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":49,"referenced_works":["https://openalex.org/W997905730","https://openalex.org/W1530964327","https://openalex.org/W1568153837","https://openalex.org/W1978267297","https://openalex.org/W1983690667","https://openalex.org/W1985026895","https://openalex.org/W2000621750","https://openalex.org/W2003085167","https://openalex.org/W2006027806","https://openalex.org/W2022477168","https://openalex.org/W2056336673","https://openalex.org/W2076753758","https://openalex.org/W2087635140","https://openalex.org/W2134266056","https://openalex.org/W2149350210","https://openalex.org/W2165190832","https://openalex.org/W2165700458","https://openalex.org/W2275033847","https://openalex.org/W2277112320","https://openalex.org/W2288283995","https://openalex.org/W2326006750","https://openalex.org/W2391448458","https://openalex.org/W2397087168","https://openalex.org/W2407951240","https://openalex.org/W2416927453","https://openalex.org/W2534838987","https://openalex.org/W2538899702","https://openalex.org/W2560299269","https://openalex.org/W2564827943","https://openalex.org/W2572054787","https://openalex.org/W2579902536","https://openalex.org/W2605026288","https://openalex.org/W2772871960","https://openalex.org/W2783128662","https://openalex.org/W2803752042","https://openalex.org/W2886516455","https://openalex.org/W2905477753","https://openalex.org/W2979006918","https://openalex.org/W4285719527","https://openalex.org/W6600134738","https://openalex.org/W6600237248","https://openalex.org/W6600474606","https://openalex.org/W6631858845","https://openalex.org/W6634033873","https://openalex.org/W6712054460","https://openalex.org/W6728890196","https://openalex.org/W6736519563","https://openalex.org/W6753475780","https://openalex.org/W6768650569"],"related_works":["https://openalex.org/W58921990","https://openalex.org/W2376570066","https://openalex.org/W2137888986","https://openalex.org/W2224555876","https://openalex.org/W2391773788","https://openalex.org/W2998661990","https://openalex.org/W843542728","https://openalex.org/W4213195198","https://openalex.org/W2582091787","https://openalex.org/W2123063165"],"abstract_inverted_index":{"It":[0],"is":[1,93,150],"important":[2],"for":[3],"Bayesian":[4],"network":[5],"(BN)":[6],"structure":[7,23,71,174],"learning,":[8],"a":[9,19],"NP-problem,":[10],"to":[11,65,76,152,157],"improve":[12],"the":[13,32,69,73,78,96,107,124,154,158,165],"accuracy":[14],"and":[15,38,53,72],"hybrid":[16,29,91],"algorithms":[17,25,30],"are":[18],"kind":[20],"of":[21,34,68,82,98,140,172],"effective":[22],"learning":[24],"at":[26],"present.":[27],"Most":[28],"adopt":[31],"strategy":[33,97],"one":[35,45,54],"heuristic":[36,46,55],"search":[37,47,56,84,109],"can":[39,168],"be":[40],"divided":[41],"into":[42],"two":[43],"groups:":[44],"based":[48,57,111,145],"on":[49,58,112,146],"initial":[50,59],"BN":[51,173],"skeleton":[52],"solutions.":[60],"The":[61],"former":[62],"often":[63],"fails":[64,75],"guarantee":[66],"globality":[67],"optimal":[70,79],"latter":[74],"get":[77],"solution":[80],"because":[81],"large":[83],"space.":[85,160],"In":[86],"this":[87],"paper,":[88],"an":[89,135],"efficient":[90,136],"algorithm":[92,144,167],"proposed":[94,166],"with":[95],"two-stage":[99],"searches.":[100],"For":[101,132],"first-stage":[102],"search,":[103,134],"it":[104],"firstly":[105],"determines":[106],"local":[108,125,155],"space":[110,126,156],"Maximal":[113],"Information":[114],"Coefficient":[115],"by":[116,127],"introducing":[117],"penalty":[118],"factors":[119],"p1,":[120],"p2,":[121],"then":[122],"searches":[123],"Binary":[128],"Particle":[129],"Swarm":[130],"Optimization.":[131],"second-stage":[133],"ADR":[137],"(the":[138],"abbreviation":[139],"Add,":[141],"Delete,":[142],"Reverse)":[143],"three":[147],"basic":[148],"operators":[149],"designed":[151],"extend":[153],"whole":[159],"Experiment":[161],"results":[162],"show":[163],"that":[164],"obtain":[169],"better":[170],"performance":[171],"learning.":[175]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":4},{"year":2022,"cited_by_count":3}],"updated_date":"2026-06-23T06:36:01.041984","created_date":"2025-10-10T00:00:00"}