Parameterized Complexity Results for Exact Bayesian Network Structure Learning
Bayesian network structure learning is the notoriously difficult problem of discovering a Bayesian network that optimally represents a given set of training data. In this paper we study the computational worst-case complexity of exact Bayesian network structure learning under graph theoretic restric...
Uloženo v:
| Vydáno v: | The Journal of artificial intelligence research Ročník 46; s. 263 - 302 |
|---|---|
| Hlavní autoři: | , |
| Médium: | Journal Article |
| Jazyk: | angličtina |
| Vydáno: |
San Francisco
AI Access Foundation
01.01.2013
|
| Témata: | |
| ISSN: | 1076-9757, 1076-9757, 1943-5037 |
| On-line přístup: | Získat plný text |
| Tagy: |
Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
|
| Abstract | Bayesian network structure learning is the notoriously difficult problem of discovering a Bayesian network that optimally represents a given set of training data. In this paper we study the computational worst-case complexity of exact Bayesian network structure learning under graph theoretic restrictions on the (directed) super-structure. The super-structure is an undirected graph that contains as subgraphs the skeletons of solution networks. We introduce the directed super-structure as a natural generalization of its undirected counterpart. Our results apply to several variants of score-based Bayesian network structure learning where the score of a network decomposes into local scores of its nodes.
Results: We show that exact Bayesian network structure learning can be carried out in non-uniform polynomial time if the super-structure has bounded treewidth, and in linear time if in addition the super-structure has bounded maximum degree. Furthermore, we show that if the directed super-structure is acyclic, then exact Bayesian network structure learning can be carried out in quadratic time. We complement these positive results with a number of hardness results. We show that both restrictions (treewidth and degree) are essential and cannot be dropped without loosing uniform polynomial time tractability (subject to a complexity-theoretic assumption). Similarly, exact Bayesian network structure learning remains NP-hard for "almost acyclic" directed super-structures. Furthermore, we show that the restrictions remain essential if we do not search for a globally optimal network but aim to improve a given network by means of at most k arc additions, arc deletions, or arc reversals (k-neighborhood local search). |
|---|---|
| AbstractList | Bayesian network structure learning is the notoriously difficult problem of discovering a Bayesian network that optimally represents a given set of training data. In this paper we study the computational worst-case complexity of exact Bayesian network structure learning under graph theoretic restrictions on the (directed) super-structure. The super-structure is an undirected graph that contains as subgraphs the skeletons of solution networks. We introduce the directed super-structure as a natural generalization of its undirected counterpart. Our results apply to several variants of score-based Bayesian network structure learning where the score of a network decomposes into local scores of its nodes.
Results: We show that exact Bayesian network structure learning can be carried out in non-uniform polynomial time if the super-structure has bounded treewidth, and in linear time if in addition the super-structure has bounded maximum degree. Furthermore, we show that if the directed super-structure is acyclic, then exact Bayesian network structure learning can be carried out in quadratic time. We complement these positive results with a number of hardness results. We show that both restrictions (treewidth and degree) are essential and cannot be dropped without loosing uniform polynomial time tractability (subject to a complexity-theoretic assumption). Similarly, exact Bayesian network structure learning remains NP-hard for "almost acyclic" directed super-structures. Furthermore, we show that the restrictions remain essential if we do not search for a globally optimal network but aim to improve a given network by means of at most k arc additions, arc deletions, or arc reversals (k-neighborhood local search). Bayesian network structure learning is the notoriously difficult problem of discovering a Bayesian network that optimally represents a given set of training data. In this paper we study the computational worst-case complexity of exact Bayesian network structure learning under graph theoretic restrictions on the (directed) super-structure. The super-structure is an undirected graph that contains as subgraphs the skeletons of solution networks. We introduce the directed super-structure as a natural generalization of its undirected counterpart. Our results apply to several variants of score-based Bayesian network structure learning where the score of a network decomposes into local scores of its nodes. Results: We show that exact Bayesian network structure learning can be carried out in non-uniform polynomial time if the super-structure has bounded treewidth, and in linear time if in addition the super-structure has bounded maximum degree. Furthermore, we show that if the directed super-structure is acyclic, then exact Bayesian network structure learning can be carried out in quadratic time. We complement these positive results with a number of hardness results. We show that both restrictions (treewidth and degree) are essential and cannot be dropped without loosing uniform polynomial time tractability (subject to a complexity-theoretic assumption). Similarly, exact Bayesian network structure learning remains NP-hard for "almost acyclic" directed super-structures. Furthermore, we show that the restrictions remain essential if we do not search for a globally optimal network but aim to improve a given network by means of at most k arc additions, arc deletions, or arc reversals (k-neighborhood local search). |
| Author | Ordyniak, S. Szeider, S. |
| Author_xml | – sequence: 1 givenname: S. surname: Ordyniak fullname: Ordyniak, S. – sequence: 2 givenname: S. surname: Szeider fullname: Szeider, S. |
| BookMark | eNptkEtPwkAUhScGEwFd-A8mceWiMM-2s1SCj4Sg8bFuhnJrBksH70wj-OstwYUxru5ZfOfc5BuQXuMbIOScsxFPuRyvrMORzJQ6In3OsjQxmc56v_IJGYSwYowbJfI-mT9atGuIgO4LlnTi15sati7u6BOEto6BVh7pdGvLSK_tDoKzDZ1D_PT4Tp8jtmVsEegMLDaueTslx5WtA5z93CF5vZm-TO6S2cPt_eRqlpTCiJjIqtJWS6mZyrhUyshKq2UuU8PMQvMqzTgYU1oBHJTpUMF1mi_yUstMsMVSDsnFYXeD_qOFEIuVb7HpXhZCa8WZZkZ31PhAlehDQKiK0kUbnW8iWlcXnBV7acVeWrGX1jUu_zQ26NYWd_-w33U6bwo |
| CitedBy_id | crossref_primary_10_1002_adts_202200330 crossref_primary_10_7717_peerj_cs_122 crossref_primary_10_1109_TPAMI_2024_3435503 crossref_primary_10_1002_aidi_202500033 crossref_primary_10_1002_stc_2912 crossref_primary_10_1007_s00453_024_01241_4 crossref_primary_10_3390_s19204400 crossref_primary_10_1016_j_jcss_2014_04_010 crossref_primary_10_1016_j_artint_2024_104241 crossref_primary_10_1016_j_tcs_2015_05_012 |
| ContentType | Journal Article |
| Copyright | 2013. Notwithstanding the ProQuest Terms and Conditions, you may use this content in accordance with the associated terms available at https://www.jair.org/index.php/jair/about |
| Copyright_xml | – notice: 2013. Notwithstanding the ProQuest Terms and Conditions, you may use this content in accordance with the associated terms available at https://www.jair.org/index.php/jair/about |
| DBID | AAYXX CITATION 8FE 8FG ABUWG AFKRA ARAPS AZQEC BENPR BGLVJ CCPQU DWQXO GNUQQ HCIFZ JQ2 K7- P62 PHGZM PHGZT PIMPY PKEHL PQEST PQGLB PQQKQ PQUKI PRINS |
| DOI | 10.1613/jair.3744 |
| DatabaseName | CrossRef ProQuest SciTech Collection ProQuest Technology Collection ProQuest Central (Alumni) ProQuest Central UK/Ireland Advanced Technologies & Computer Science Collection ProQuest Central Essentials ProQuest Central (subscription) Technology Collection ProQuest One Community College ProQuest Central ProQuest Central Student SciTech Premium Collection ProQuest Computer Science Collection Computer Science Database ProQuest Advanced Technologies & Aerospace Collection ProQuest Central Premium ProQuest One Academic Publicly Available Content Database ProQuest One Academic Middle East (New) ProQuest One Academic Eastern Edition (DO NOT USE) ProQuest One Applied & Life Sciences ProQuest One Academic (retired) ProQuest One Academic UKI Edition ProQuest Central China |
| DatabaseTitle | CrossRef Publicly Available Content Database Advanced Technologies & Aerospace Collection Computer Science Database ProQuest Central Student Technology Collection ProQuest One Academic Middle East (New) ProQuest Advanced Technologies & Aerospace Collection ProQuest Central Essentials ProQuest Computer Science Collection ProQuest One Academic Eastern Edition ProQuest Central (Alumni Edition) SciTech Premium Collection ProQuest One Community College ProQuest Technology Collection ProQuest SciTech Collection ProQuest Central China ProQuest Central ProQuest One Applied & Life Sciences ProQuest One Academic UKI Edition ProQuest Central Korea ProQuest Central (New) ProQuest One Academic ProQuest One Academic (New) |
| DatabaseTitleList | CrossRef Publicly Available Content Database |
| Database_xml | – sequence: 1 dbid: PIMPY name: Publicly Available Content Database url: http://search.proquest.com/publiccontent sourceTypes: Aggregation Database |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Computer Science |
| EISSN | 1076-9757 1943-5037 |
| EndPage | 302 |
| ExternalDocumentID | 10_1613_jair_3744 |
| GroupedDBID | .DC 29J 2WC 5GY 5VS AAKMM AAKPC AALFJ AAYFX AAYXX ACGFO ACM ADBBV ADBSK AEFXT AEJOY AENEX AFFHD AFKRA AFWXC AKRVB ALMA_UNASSIGNED_HOLDINGS ARAPS BCNDV BENPR BGLVJ CCPQU CITATION E3Z EBS EJD F5P FRJ FRP GROUPED_DOAJ GUFHI HCIFZ K7- KQ8 LHSKQ LPJ OK1 OVT P2P PHGZM PHGZT PIMPY PQGLB RNS TR2 XSB 8FE 8FG ABUWG AZQEC DWQXO GNUQQ JQ2 P62 PKEHL PQEST PQQKQ PQUKI PRINS |
| ID | FETCH-LOGICAL-c292t-3ff5a5335047134493f54d836909b51f671e99ca2e1e495a521568b8c53720bd3 |
| IEDL.DBID | K7- |
| ISICitedReferencesCount | 39 |
| ISICitedReferencesURI | http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000315862100001&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| ISSN | 1076-9757 |
| IngestDate | Fri Jul 25 09:08:53 EDT 2025 Sat Nov 29 05:27:05 EST 2025 Tue Nov 18 21:14:55 EST 2025 |
| IsDoiOpenAccess | true |
| IsOpenAccess | true |
| IsPeerReviewed | true |
| IsScholarly | true |
| Language | English |
| LinkModel | DirectLink |
| MergedId | FETCHMERGED-LOGICAL-c292t-3ff5a5335047134493f54d836909b51f671e99ca2e1e495a521568b8c53720bd3 |
| Notes | ObjectType-Article-1 SourceType-Scholarly Journals-1 ObjectType-Feature-2 content type line 14 |
| OpenAccessLink | https://www.proquest.com/docview/2554105095?pq-origsite=%requestingapplication% |
| PQID | 2554105095 |
| PQPubID | 5160723 |
| PageCount | 40 |
| ParticipantIDs | proquest_journals_2554105095 crossref_citationtrail_10_1613_jair_3744 crossref_primary_10_1613_jair_3744 |
| PublicationCentury | 2000 |
| PublicationDate | 2013-01-01 |
| PublicationDateYYYYMMDD | 2013-01-01 |
| PublicationDate_xml | – month: 01 year: 2013 text: 2013-01-01 day: 01 |
| PublicationDecade | 2010 |
| PublicationPlace | San Francisco |
| PublicationPlace_xml | – name: San Francisco |
| PublicationTitle | The Journal of artificial intelligence research |
| PublicationYear | 2013 |
| Publisher | AI Access Foundation |
| Publisher_xml | – name: AI Access Foundation |
| SSID | ssj0019428 |
| Score | 2.274091 |
| Snippet | Bayesian network structure learning is the notoriously difficult problem of discovering a Bayesian network that optimally represents a given set of training... |
| SourceID | proquest crossref |
| SourceType | Aggregation Database Enrichment Source Index Database |
| StartPage | 263 |
| SubjectTerms | Artificial intelligence Bayesian analysis Complexity Constrictions Graph theory Machine learning Optimization Polynomials |
| Title | Parameterized Complexity Results for Exact Bayesian Network Structure Learning |
| URI | https://www.proquest.com/docview/2554105095 |
| Volume | 46 |
| WOSCitedRecordID | wos000315862100001&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| hasFullText | 1 |
| inHoldings | 1 |
| isFullTextHit | |
| isPrint | |
| journalDatabaseRights | – providerCode: PRVAON databaseName: DOAJ Directory of Open Access Journals customDbUrl: eissn: 1076-9757 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0019428 issn: 1076-9757 databaseCode: DOA dateStart: 19930101 isFulltext: true titleUrlDefault: https://www.doaj.org/ providerName: Directory of Open Access Journals – providerCode: PRVPQU databaseName: ProQuest Central customDbUrl: eissn: 1076-9757 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0019428 issn: 1076-9757 databaseCode: BENPR dateStart: 19930101 isFulltext: true titleUrlDefault: https://www.proquest.com/central providerName: ProQuest – providerCode: PRVPQU databaseName: ProQuest Computer Science Database (NC LIVE) customDbUrl: eissn: 1076-9757 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0019428 issn: 1076-9757 databaseCode: K7- dateStart: 19930101 isFulltext: true titleUrlDefault: http://search.proquest.com/compscijour providerName: ProQuest – providerCode: PRVPQU databaseName: Publicly Available Content Database customDbUrl: eissn: 1076-9757 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0019428 issn: 1076-9757 databaseCode: PIMPY dateStart: 19930101 isFulltext: true titleUrlDefault: http://search.proquest.com/publiccontent providerName: ProQuest |
| link | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwpV1LS8QwEA6-Dl58i88liAcvUZtH05xEZUUPlrIq6KkkaSory65uq6i_3kw3uyKIF69tDmEmmVdmvg-hfZcw7bMKQyLHJOEuccTQghPhTAkAcYxa05BNyDRN7u9VFgpuVWirHNvExlAXAws18iMf-kJHoo8ITp5fCLBGwetqoNCYRrMR9UYYHmUlmbwiKE5Ho3AyJkoKGZCFvAc7etLd4SGTnP_0Rz_NceNjLhb_u7sltBCiS3w6Og7LaMr1V9DimLkBh4u8itJMQ1MW4DR_ugLDAgDGrD9wx1WvvbrCPpbF7Xdta3ymPxxMWuJ01DGObxrI2dehwwGc9XEN3V20b88vSWBWIJYqWhNWlkL7QE8cc5gl5YqVghcJ86myMiIqYxk5paymLnI-g9Lex4s4MYkVQGpjCraOZvqDvttA2Eds8XHhFc1LyxNaGqqkoY5rGQtDmdpEB2P55jbAjgP7RS-H9MOrIgdV5KCKTbQ3Wfo8wtr4bdHOWAN5uG5V_i3-rb9_b6N52vBZQA1lB814gbldNGff6m41bKHZs3aadVpNYt5qzpL_ll1dZw9fVLnSWw |
| linkProvider | ProQuest |
| linkToHtml | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMw1V1LT9VAFD5BJNGNKEpEEScGEzcj3Hl0OgtDECGQiw1RTNiVmekpgZAL3Bb1-qP4jczpA0Ji3LFw3UmTznd6HjPnfB_AMqbSxarC8wFKwxWmyL0oFNfoSyKIkyL4RmzCZFl6cGD3puCqn4WhtsreJzaOujgLdEa-ElNf6kiMGcHa-QUn1Si6Xe0lNFqzGOLkVyzZqk87XyK-74XY2tzf2OadqgAPwoqay7LULiY5elXRHKWystSqSGUsE63XgzIxA7Q2OIEDjNWDi_FNJ6lPgyZBF1_I-N4H8FDJ1NB_NTT85tbCKtGO3pmEW6NNx2QUI-bKiTsef5RGqbvx7677b2La1uz_thtP4UmXPbP11tyfwRSO5mC2V6ZgnaN6Dtmeo6Yz4qH-gwWjBUT8WU_YN6wuT-uKxVydbf52oWaf3QRpkpRlbUc8-95Q6l6OkXXks0cv4Me9fNU8TI_ORvgSWMxIk9UiGrIqg0pF6YU1XqByJtFeSLsAH3o889DRqpO6x2lO5VWEPifoc4J-Ad7dLD1vuUT-tmixRzzv3EmV38L96t-P38Kj7f2vu_nuTjZ8DY9Fo91B50WLMB03D9_ATPhZH1fjpcZyGRzet3FcA5PNJxM |
| openUrl | ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=Parameterized+Complexity+Results+for+Exact+Bayesian+Network+Structure+Learning&rft.jtitle=The+Journal+of+artificial+intelligence+research&rft.au=Ordyniak%2C+S&rft.au=Szeider%2C+S&rft.date=2013-01-01&rft.pub=AI+Access+Foundation&rft.issn=1076-9757&rft.eissn=1943-5037&rft.volume=46&rft.spage=263&rft_id=info:doi/10.1613%2Fjair.3744 |
| thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=1076-9757&client=summon |
| thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=1076-9757&client=summon |
| thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=1076-9757&client=summon |