Interpretation of Linear Classifiers by Means of Feature Relevance Bounds

Göpfert C, Pfannschmidt L, Göpfert JP, Hammer B (2018)
Neurocomputing 298: 69-79.

Zeitschriftenaufsatz | Veröffentlicht | Englisch
 
Download
OA 862.49 KB
Abstract / Bemerkung
Research on feature relevance and feature selection problems goes back several decades, but the importance of these areas continues to grow as more and more data becomes available, and machine learning methods are used to gain insight and interpret, rather than solely to solve classification or regression problems. Despite the fact that feature relevance is often discussed, it is frequently poorly defined, and the feature selection problems studied are subtly different. Furthermore, the problem of finding all features relevant for a classification problem has only recently started to gain traction, despite its importance for interpretability and integrating expert knowledge. In this paper, we attempt to unify commonly used concepts and to give an overview of the main questions and results. We formalize two interpretations of the all-relevant problem and propose a polynomial method to approximate one of them for the important hypothesis class of linear classifiers, which also enables a distinction between strongly and weakly relevant features.
Stichworte
Feature Relevance; Feature Selection; Interpretability; All-Relevant; Linear Classification
Erscheinungsjahr
2018
Zeitschriftentitel
Neurocomputing
Band
298
Seite(n)
69-79
eISSN
1872-8286
Page URI
https://pub.uni-bielefeld.de/record/2915273

Zitieren

Göpfert C, Pfannschmidt L, Göpfert JP, Hammer B. Interpretation of Linear Classifiers by Means of Feature Relevance Bounds. Neurocomputing. 2018;298:69-79.
Göpfert, C., Pfannschmidt, L., Göpfert, J. P., & Hammer, B. (2018). Interpretation of Linear Classifiers by Means of Feature Relevance Bounds. Neurocomputing, 298, 69-79. doi:10.1016/j.neucom.2017.11.074
Göpfert, C., Pfannschmidt, L., Göpfert, J. P., and Hammer, B. (2018). Interpretation of Linear Classifiers by Means of Feature Relevance Bounds. Neurocomputing 298, 69-79.
Göpfert, C., et al., 2018. Interpretation of Linear Classifiers by Means of Feature Relevance Bounds. Neurocomputing, 298, p 69-79.
C. Göpfert, et al., “Interpretation of Linear Classifiers by Means of Feature Relevance Bounds”, Neurocomputing, vol. 298, 2018, pp. 69-79.
Göpfert, C., Pfannschmidt, L., Göpfert, J.P., Hammer, B.: Interpretation of Linear Classifiers by Means of Feature Relevance Bounds. Neurocomputing. 298, 69-79 (2018).
Göpfert, Christina, Pfannschmidt, Lukas, Göpfert, Jan Philip, and Hammer, Barbara. “Interpretation of Linear Classifiers by Means of Feature Relevance Bounds”. Neurocomputing 298 (2018): 69-79.
Alle Dateien verfügbar unter der/den folgenden Lizenz(en):
Copyright Statement:
This Item is protected by copyright and/or related rights. [...]
Volltext(e)
Access Level
OA Open Access
Zuletzt Hochgeladen
2019-09-06T09:18:54Z
MD5 Prüfsumme
fc2d8467d34a2d03f889c6770a49d97a