Multi-classifiers of Small Treewidth

  • A.J. Pastink
  • , L.C. van der Gaag

Research output: Chapter in Book/Report/Conference proceedingConference contributionAcademicpeer-review

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 languageEnglish
Title of host publicationECSQARU 2015: 13th European Conference on Symbolic and Quantitative Approaches to Reasoning with Uncertainty
EditorsSebastien Destercke, Thierry Denoeux
PublisherSpringer
Pages199-209
Number of pages11
Volume9161
ISBN (Electronic)9783319208077
ISBN (Print)9783319208060
DOIs
Publication statusPublished - 2015

Fingerprint

Dive into the research topics of 'Multi-classifiers of Small Treewidth'. Together they form a unique fingerprint.

Cite this