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...

Full beskrivning

Bibliografiska uppgifter

I publikationen:	Machine learning. 59, 3 (2005).
Huvudupphovsman:	Acid, Silvia
Materialtyp:	Artikel
Språk:	English
Ämnen:	Classification. Bayesian networks. Learning algorithms. Scoring functions. Directed acyclic graphs. Partially directed acyclic graphs.