Learning Bayesian Network Classifiers Searching in a Space of Partially Directed Acyclic Graphs.
There is a commonly held opinion that the algorithms for learning unrestricted types of Bayesian networks, especially those based on the score+search paradigm, are not suitable for building competitive Bayesian network-based classifiers. Several specialized algorithms that carry out the search into...
| Pubblicato in: | Machine learning. 59, 3 (2005). |
|---|---|
| Autore principale: | |
| Natura: | Articolo |
| Lingua: | English |
| Soggetti: |