Efficient Learning of Bounded-Treewidth Bayesian Networks from Complete and Incomplete Data Sets.
Mauro ScanagattaGiorgio CoraniMarco ZaffalonJaemin YooU KangPublished in: CoRR (2018)
Keyphrases
- data sets
- efficient learning
- incomplete data sets
- bounded treewidth
- bayesian networks
- incomplete data
- np complete
- boolean functions
- learning algorithm
- membership queries
- feature extraction
- missing values
- relational learning
- database
- feature selection
- pattern languages
- conjunctive queries
- decision problems
- probabilistic model
- lower bound
- computational complexity