@inbook {13477,
	title = {Using Feature Hierarchies in Bayesian Network Learning},
	booktitle = {Abstraction, Reformulation, and Approximation},
	series = {Lecture Notes in Computer Science},
	volume = {1864},
	year = {2000},
	month = {2000///},
	pages = {260 - 270},
	publisher = {Springer Berlin / Heidelberg},
	organization = {Springer Berlin / Heidelberg},
	abstract = {In recent years, researchers in statistics and the UAI community have developed an impressive body of theory and algorithmic machinery for learning Bayesian networks from data. Learned Bayesian networks can be used for pattern discovery, prediction, diagnosis, and density estimation tasks. Early pioneering work in this area includes [ 5 , 9 , 10 , 13 ]. The algorithm that has emerged as the current most popular approach is a simple greedy hill-climbing algorithm that searches the space of candidate structures, guided by a network scoring function (either Bayesian or Minimum Description Length (MDL)-based). The search begins with an initial candidate network (typically the empty network, which has no edges), and then considers making small local changes such as adding, deleting, or reversing an edge in the network.},
	isbn = {978-3-540-67839-7},
	url = {http://dx.doi.org/10.1007/3-540-44914-0_16},
	author = {desJardins, Marie and Getoor,Lise and Koller,Daphne},
	editor = {Choueiry,Berthe and Walsh,Toby}
}
