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.

Download
OA 862.49 KB
Journal Article | Original Article | Published | English
Abstract
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.
Publishing Year
eISSN
PUB-ID

Cite this

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.
All files available under the following license(s):
Copyright Statement:
This Item is protected by copyright and/or related rights. [...]
Main File(s)
Access Level
OA Open Access
Last Uploaded
2017-12-05T10:11:59Z

This data publication is cited in the following publications:
This publication cites the following data publications:

Export

0 Marked Publications

Open Data PUB

Search this title in

Google Scholar