Case-Based Reasoning for Explaining Probabilistic Machine Learning

  • Olsson T
  • Gillblad D
  • Funk P
  • et al.
N/ACitations
Citations of this article
29Readers
Mendeley users who have this article in their library.

Abstract

This paper describes a generic framework for explaining the prediction of probabilistic machine learning algorithms using cases. The framework consists of two components: a similarity metric between cases that is defined relative to a probability model and an novel case-based approach to justifying the probabilistic prediction by estimating the prediction error using case-based reasoning. As basis for deriving similarity metrics, we define similarity in terms of the principle of interchangeability that two cases are considered similar or identical if two probability distributions, derived from excluding either one or the other case in the case base, are identical. Lastly, we show the applicability of the proposed approach by deriving a metric for linear regression, and apply the proposed approach for explaining predictions of the energy performance of households.

Cite

CITATION STYLE

APA

Olsson, T., Gillblad, D., Funk, P., & Xiong, N. (2014). Case-Based Reasoning for Explaining Probabilistic Machine Learning. International Journal of Computer Science and Information Technology, 6(2), 87–101. https://doi.org/10.5121/ijcsit.2014.6206

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free