Efficiently explaining decisions of probabilistic RBF classification networks

  • Authors:
  • Marko Robnik-Šikonja;Aristidis Likas;Constantinos Constantinopoulos;Igor Kononenko;Erik Strumbelj

  • Affiliations:
  • University of Ljubljana, Faculty of Computer and Information Science, Ljubljana, Slovenia;University of Ioannina, Department of Computer Science, Ioannina, Greece;Barcelona Media - Centre d'Innovació, Barcelona, Spain;University of Ljubljana, Faculty of Computer and Information Science, Ljubljana, Slovenia;University of Ljubljana, Faculty of Computer and Information Science, Ljubljana, Slovenia

  • Venue:
  • ICANNGA'11 Proceedings of the 10th international conference on Adaptive and natural computing algorithms - Volume Part I
  • Year:
  • 2011

Quantified Score

Hi-index 0.00

Visualization

Abstract

For many important practical applications model transparency is an important requirement. A probabilistic radial basis function (PRBF) network is an effective non-linear classifier, but similarly to most other neural network models it is not straightforward to obtain explanations for its decisions. Recently two general methods for explaining of a model's decisions for individual instances have been introduced which are based on the decomposition of a model's prediction into contributions of each attribute. By exploiting the marginalization property of the Gaussian distribution, we show that PRBF is especially suitable for these explanation techniques. By explaining the PRBF's decisions for new unlabeled cases we demonstrate resulting methods and accompany presentation with visualization technique that works both for single instances as well as for the attributes and their values, thus providing a valuable tool for inspection of the otherwise opaque models.