Learning Bayesian network classifiers: Searching in a space of partially directed acyclic graphs
From MaRDI portal
Publication:1778146
DOI10.1007/s10994-005-0473-4zbMath1101.68710OpenAlexW2170666417MaRDI QIDQ1778146
Javier G. Castellano, Silvia Acid, Luis M. Campos
Publication date: 17 June 2005
Published in: Machine Learning (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10994-005-0473-4
classificationBayesian networkslearning algorithmsdirected acyclic graphsscoring functionspartially directed acyclic graphs
Related Items (7)
Efficient score-based Markov blanket discovery ⋮ Score-based methods for learning Markov boundaries by searching in constrained spaces ⋮ Learning Bayesian network classifiers by risk minimization ⋮ Unsupervised training of Bayesian networks for data clustering ⋮ Imprecise probability models for learning multinomial distributions from data. Applications to learning credal networks ⋮ Discretization for Naive-Bayes learning: managing discretization bias and variance ⋮ Discrete Bayesian Network Classifiers
Uses Software
Cites Work
- Wrappers for feature subset selection
- Causation, prediction, and search
- A Bayesian method for the induction of probabilistic networks from data
- On the optimality of the simple Bayesian classifier under zero-one loss
- Bayesian network classifiers
- Learning Bayesian networks from data: An information-theory based approach
- A new approach for learning belief networks using independence criteria
- Learning Bayesian networks: The combination of knowledge and statistical data
- 10.1162/153244302760200696
- Approximating discrete probability distributions with dependence trees
- A hybrid methodology for learning belief networks: BENEDICT
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Learning Bayesian network classifiers: Searching in a space of partially directed acyclic graphs
