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: | arXiv.org |
|---|---|
| Hlavní autoři: | , |
| Médium: | Paper |
| Jazyk: | angličtina |
| Vydáno: |
Ithaca
Cornell University Library, arXiv.org
04.02.2014
|
| Témata: | |
| ISSN: | 2331-8422 |
| 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). |
| Author | Ordyniak, Sebastian Szeider, Stefan |
| Author_xml | – sequence: 1 givenname: Sebastian surname: Ordyniak fullname: Ordyniak, Sebastian – sequence: 2 givenname: Stefan surname: Szeider fullname: Szeider, Stefan |
| BookMark | eNotzTtPwzAUQGELgUQp3RktMadcvxJnhKgUpKog6F7dJNcoJU2K7UDKrwcJprN954Kddn1HjF0JmGtrDNygH5vPudAg52CMPWETqZRIrJbynM1C2AGATDNpjJqw9TN63FMk33xTzYt-f2hpbOKRv1AY2hi46z1fjFhFfodHCg12fE3xq_fv_DX6oYqDJ74i9F3TvV2yM4dtoNl_p2xzv9gUD8nqaflY3K4SNEIkWWqq0uZCqgwATa4BNUCudOlKqiFPs7JyZZlpJ7VRMsUqJ9I1OmVqJ6hWU3b9xx58_zFQiNtdP_ju97iVYLVQ1iqhfgBqGVI_ |
| ContentType | Paper |
| Copyright | 2014. This work is published under http://arxiv.org/licenses/nonexclusive-distrib/1.0/ (the “License”). Notwithstanding the ProQuest Terms and Conditions, you may use this content in accordance with the terms of the License. |
| Copyright_xml | – notice: 2014. This work is published under http://arxiv.org/licenses/nonexclusive-distrib/1.0/ (the “License”). Notwithstanding the ProQuest Terms and Conditions, you may use this content in accordance with the terms of the License. |
| DBID | 8FE 8FG ABJCF ABUWG AFKRA AZQEC BENPR BGLVJ CCPQU DWQXO HCIFZ L6V M7S PHGZM PHGZT PIMPY PKEHL PQEST PQGLB PQQKQ PQUKI PRINS PTHSS |
| DOI | 10.48550/arxiv.1402.0558 |
| DatabaseName | ProQuest SciTech Collection ProQuest Technology Collection Materials Science & Engineering Collection ProQuest Central (Alumni) ProQuest Central UK/Ireland ProQuest Central Essentials - QC ProQuest Central ProQuest Technology Collection ProQuest One ProQuest Central Korea SciTech Premium Collection ProQuest Engineering Collection Engineering Database ProQuest Central Premium ProQuest One Academic (New) 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 Engineering Collection |
| DatabaseTitle | Publicly Available Content Database Engineering Database Technology Collection ProQuest One Academic Middle East (New) ProQuest Central Essentials 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 Engineering Collection ProQuest One Academic UKI Edition ProQuest Central Korea Materials Science & Engineering Collection ProQuest Central (New) ProQuest One Academic ProQuest One Academic (New) Engineering Collection |
| DatabaseTitleList | Publicly Available Content Database |
| Database_xml | – sequence: 1 dbid: PIMPY name: ProQuest Publicly Available Content Database url: http://search.proquest.com/publiccontent sourceTypes: Aggregation Database |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Physics |
| EISSN | 2331-8422 |
| Genre | Working Paper/Pre-Print |
| GroupedDBID | 8FE 8FG ABJCF ABUWG AFKRA ALMA_UNASSIGNED_HOLDINGS AZQEC BENPR BGLVJ CCPQU DWQXO FRJ HCIFZ L6V M7S M~E PHGZM PHGZT PIMPY PKEHL PQEST PQGLB PQQKQ PQUKI PRINS PTHSS |
| ID | FETCH-LOGICAL-a511-765cb89123700a5940a400934bfbed0967bcfbb74f245326ac9ee4daf35df1ed3 |
| IEDL.DBID | M7S |
| IngestDate | Mon Jun 30 09:21:36 EDT 2025 |
| IsDoiOpenAccess | true |
| IsOpenAccess | true |
| IsPeerReviewed | false |
| IsScholarly | false |
| Language | English |
| LinkModel | DirectLink |
| MergedId | FETCHMERGED-LOGICAL-a511-765cb89123700a5940a400934bfbed0967bcfbb74f245326ac9ee4daf35df1ed3 |
| Notes | SourceType-Working Papers-1 ObjectType-Working Paper/Pre-Print-1 content type line 50 |
| OpenAccessLink | https://www.proquest.com/docview/2084138831?pq-origsite=%requestingapplication% |
| PQID | 2084138831 |
| PQPubID | 2050157 |
| ParticipantIDs | proquest_journals_2084138831 |
| PublicationCentury | 2000 |
| PublicationDate | 20140204 |
| PublicationDateYYYYMMDD | 2014-02-04 |
| PublicationDate_xml | – month: 02 year: 2014 text: 20140204 day: 04 |
| PublicationDecade | 2010 |
| PublicationPlace | Ithaca |
| PublicationPlace_xml | – name: Ithaca |
| PublicationTitle | arXiv.org |
| PublicationYear | 2014 |
| Publisher | Cornell University Library, arXiv.org |
| Publisher_xml | – name: Cornell University Library, arXiv.org |
| SSID | ssj0002672553 |
| Score | 1.5279195 |
| SecondaryResourceType | preprint |
| 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 |
| SourceType | Aggregation Database |
| SubjectTerms | Bayesian analysis Complexity Constrictions Evidence Graph theory Machine learning Optimization Polynomials |
| Title | Parameterized Complexity Results for Exact Bayesian Network Structure Learning |
| URI | https://www.proquest.com/docview/2084138831 |
| hasFullText | 1 |
| inHoldings | 1 |
| isFullTextHit | |
| isPrint | |
| link | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwpV3LSgMxFL1oq-DKNz5qycJtsNMk81gJlRYFHYa2i7oqeUpB2jozLa1fb5JOdSG4cRkGwkySOTn35uRcgFthBJOBpjiJCMGUJgGOFaFYUB6GyhATbnxmn6M0jUejJKsSbkUlq9xiogdqNZMuR26D9NjibRyT4H7-gV3VKHe6WpXQ2IW6c0kIvHRv8J1jaYeRZcxkczrprbvueL6aLC08OJ9OxuJfCOy3ld7hf1_oCOoZn-v8GHb09AT2vZxTFqeQZtyJrpwP86dWyP30zviyXKO-LhbvZYEsV0XdFZcl6vC1djcpUbpRhKOBt5Rd5BpV5qtvZzDsdYcPj7iqnIC5JVA4CpkUcWI3pajV4iyhLU5d6oLamdHKBi2RkEaIiJo2ZZa_cZloTRU3hCkTaEXOoTadTfUFINMOQlfxW7o-EhvLMWOD2oBpIogKKbuExnZ0xtXqL8Y_Q3P19-NrOLAEhHoVNG1AzX6fvoE9uSwnRd6EeqebZv2mn1Tbyp5estcvYLCtEA |
| linkProvider | ProQuest |
| linkToHtml | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMw1V3LTgIxFL1B0OjKd3ygdqHLicy0ncfCmKgQCDghwoId6fRhSAwgAwj-k__o7QC6MHHnwvUkzdzc9vTc9vRcgMvEJFy6mjlRQKnDWOQ6oaLMSZjwfWWo8Rc-s40gjsNOJ2rm4GP1FsbKKleYmAG1Gkh7Ro5Feoh4G4bUvR2-OrZrlL1dXbXQWEyLup6_YcmW3tQeML9Xnlcpt--rzrKrgCOQXDiBz2USRgjYQakkeMRKgtmynuFfa4WEPkikSZKAGY9x5DZCRlozJQzlyrhaURx2DQrIIrwoUwq2vo50PD9Agk4Xl6GZU9i1GM16U0QjawvKefgD8LNdrLL9z-LfgUJTDPVoF3K6vwcbmVhVpvsQN4WVlFmX6XetiIU0a-s5npMnnU5exilBJk7KMyHH5E7MtX0nSuKF3p20MsPcyUiTpbXs8wG0_yKCQ8j3B319BMR4rm_7mUs7RoSVKjdYsrtc04Qqn_FjKK6S0V2u7bT7nYmT3z9fwGa1_djoNmpx_RS2kGqxTO_NipDHWPUZrMvpuJeOzrN5RKD7x3n7BDhdBg0 |
| 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=arXiv.org&rft.au=Ordyniak%2C+Sebastian&rft.au=Szeider%2C+Stefan&rft.date=2014-02-04&rft.pub=Cornell+University+Library%2C+arXiv.org&rft.eissn=2331-8422&rft_id=info:doi/10.48550%2Farxiv.1402.0558 |