Abstract
Multi-dimensional Bayesian network classifiers are becoming quite popular for multi-label classification. These models have the advantage of a high expressive power, but may induce a prohibitively high runtime of classification. We argue that the high runtime burden originates from their large treewidth. Thus motivated, we present an algorithm for learning multi-classifiers of small treewidth. Experimental results show that these models have a small runtime of classification, without loosing accuracy compared to unconstrained multi-classifiers.
| Original language | English |
|---|---|
| Title of host publication | ECSQARU 2015: 13th European Conference on Symbolic and Quantitative Approaches to Reasoning with Uncertainty |
| Editors | Sebastien Destercke, Thierry Denoeux |
| Publisher | Springer |
| Pages | 199-209 |
| Number of pages | 11 |
| Volume | 9161 |
| ISBN (Electronic) | 9783319208077 |
| ISBN (Print) | 9783319208060 |
| DOIs | |
| Publication status | Published - 2015 |