Bounds for Bayesian network classifiers with reduced precision parameters

Sebastian Tschiatschek, Carlos Eduardo Cancino-Chacón, Franz Pernkopf

Abstract

Bayesian network classifiers are probabilistic classifiers achieving good classification rates in various applications. These classifiers consist of a directed acyclic graph and a set of conditional probability densities, which in case of discrete-valued nodes can be represented by conditional probability tables. In this paper, we investigate the effect of quantizing these conditional probabilities. We derive worst-case and best-case bounds on the classification rate using interval arithmetic. Furthermore, we determine performance bounds that hold with a user specified confidence using quantization theory. Our results emphasize that only small bit-widths are necessary to achieve good classification rates.
BibTeX
@inproceedings{tschiatschek2013bounds,
  author = {Sebastian Tschiatschek and Carlos Eduardo Cancino-Chacón and Franz Pernkopf},
  title = {{Bounds for Bayesian network classifiers with reduced precision parameters}},
  booktitle = {IEEE International Conference on Acoustics, Speech and Signal Processing},
  year = {2013},
  doi = {10.1109/icassp.2013.6638280},
}

Loading related content...

Figure