.png){kind=icon}
返回
Nearest prototype classification of noisy data
.png){kind=icon}
OA
AI
DOI：10.1007/s10462-009-9116-7.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
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.
Keyword:
Nearest prototype classification
Evolutionary learning
Machine learning
期刊
IF:
13.9
论文数:
6.1K
被引数:
1.9W
机构
引用论文
分享收藏A review and empirical evaluation of feature weighting methods for a class of lazy learning algorithms一类懒惰学习算法的特征加权方法综述与实证评价
PREAI
分享收藏分享收藏Quantitative 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
分享收藏
查看更多内容