Learning Bayesian Network Classifiers to Minimize the Class Variable Parameters
Shouta Sugahara, Koya Kato, Maomi Ueno
Abstract
This study proposes and evaluates a novel Bayesian network classifier which can asymptotically estimate the true probability distribution of the class variable with the fewest class variable parameters among all structures for which the class variable has no parent. Moreover, to search for an optimal structure of the proposed classifier, we propose (1) a depth-first search based method and (2) an integer programming based method. The proposed methods are guaranteed to obtain the true probability distribution asymptotically while minimizing the number of class variable parameters. Comparative experiments using benchmark datasets demonstrate the effectiveness of the proposed method.
Ask about this paper
Your agent reads all of it.
Lune indexed this paper to the last equation, along with the top-tier papers that cite it. Ask a question and the answer quotes them.
Related papers
- Optimality of Message-Passing Architectures for Sparse GraphsAseem Baranwal, Kimon Fountoulakis, Aukosh JagannathNeurIPS 2023 · 17 citations
- Integer Programming for Causal Structure Learning in the Presence of Latent VariablesRui Chen, Sanjeeb Dash, Tian GaoICML 2021 · 19 citations
- Exact and Approximate Algorithms for Polytree LearningJuha Harviainen, Frank Sommer, Manuel SorgeICML 2026
- Turbocharging Treewidth-Bounded Bayesian Network Structure LearningVaidyanathan Peruvemba Ramaswamy, Stefan SzeiderAAAI 2021 · 19 citations
- Robust Bayesian Classification Using An Optimistic Score RatioViet Anh Nguyen, Nian Si, Jose H. BlanchetICML 2020 · 15 citations
