.png){kind=icon}
Return
Nearest prototype classification of noisy data
.png){kind=icon}
OA
AI
DOI：10.1007/s10462-009-9116-7.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Nearest prototype approaches offer a common way to design classifiers. However, when data is noisy, the success of this sort of classifiers depends on some parameters that the designer needs to tune, as the number of prototypes. In this work, we have made a study of the ENPC technique, based on the nearest prototype approach, in noisy datasets. Previous experimentation of this algorithm had shown that it does not require any parameter tuning to obtain good solutions in problems where class limits are well defined, and data is not noisy. In this work, we show that the algorithm is able to obtain solutions with high classification success even when data is noisy. A comparison with optimal (hand made) solutions and other different classification algorithms demonstrates the good performance of the ENPC algorithm in accuracy and number of prototypes as the noise level increases. We have performed experiments in four different datasets, each of them with different characteristics.
Keywords:
Nearest prototype classification
Evolutionary learning
Machine learning
Journal
IF:
13.9
Papers:
6.1K
Citations:
1.9W
Organization
Cited Papers
ShareSaveShareSaveShareSaveShareSaveQuantitative approach to hückel rule the relations between the cycles of a molecular graph and the thermodynamic stability of a conjugated molecule.png)
Tetrahedron
TetrahedronIF0
PREAI
ShareSaveShareSaveShareSave
View more