117 citations · 119 across the 2 of their papers we have counts for
2 papers
cs.LG2013★ 117 cited
On the Sample Complexity of Learning Bayesian Networks
Nir Friedman, Zohar Yakhini
In recent years there has been an increasing interest in learning Bayesian networks from data. One of the most effective methods for learning such networks is based on the minimum…
cs.LG2012★ 2 cited
A Distance-Based Branch and Bound Feature Selection Algorithm
Ari Frank, Dan Geiger, Zohar Yakhini
There is no known efficient method for selecting k Gaussian features from n which achieve the lowest Bayesian classification error. We show an example of how greedy algorithms face…