Assessing robustness of classification using an angular breakdown point (Q1990584)
From MaRDI portal
| This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Assessing robustness of classification using an angular breakdown point |
scientific article; zbMATH DE number 6965691
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Assessing robustness of classification using an angular breakdown point |
scientific article; zbMATH DE number 6965691 |
Statements
Assessing robustness of classification using an angular breakdown point (English)
0 references
25 October 2018
0 references
Classification's reliability is in the heart of the state of the art of machine learning methods. A novel measure of global reliability is proposed using population and sample angular breakdown points considering the difference between estimates with and without outliers. First, the authors consider linear learning with both bounded and unbounded loss functions, and the theoretical properties of an angular breakdown point for binary classification are studied. Next, an angular breakdown point for binary kernel learning (RKHS) with bounded or unbounded loss functions is considered. The efficiency of the proposed angular breakdown criterion is demonstrated on two datasets including a diagnostic breast cancer dataset.
0 references
breakdown point
0 references
classification
0 references
loss function
0 references
reproducing kernel Hilbert spaces
0 references
robustness
0 references
0 references
0 references
0 references
0 references