Efficient learning of bounded-treewidth Bayesian networks from complete and incomplete data sets.
Mauro ScanagattaGiorgio CoraniMarco ZaffalonJaemin YooU KangPublished in: Int. J. Approx. Reason. (2018)
Keyphrases
- efficient learning
- bounded treewidth
- bayesian networks
- incomplete data sets
- incomplete data
- np complete
- missing values
- conjunctive queries
- data sets
- machine learning
- pattern languages
- learning algorithm
- lower bound
- nearest neighbor
- monadic datalog
- database
- membership queries
- boolean functions
- decision problems
- missing data