.png){kind=icon}
Return
A new fast prototype selection method based on clustering
.png){kind=icon}
PRE
AI
DOI：10.1007/s10044-008-0142-x.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
In supervised classification, a training set T is given to a classifier for classifying new prototypes. In practice, not all information in T is useful for classifiers, therefore, it is convenient to discard irrelevant prototypes from T. This process is known as prototype selection, which is an important task for classifiers since through this process the time for classification or training could be reduced. In this work, we propose a new fast prototype selection method for large datasets, based on clustering, which selects border prototypes and some interior prototypes. Experimental results showing the performance of our method and comparing accuracy and runtimes against other prototype selection methods are reported.
Keywords:
Prototype selection
Supervised classification
Instance-based classifiers
Border prototypes
Data reduction
Clustering
Journal
IF:
2
Papers:
1.9K
Citations:
1.9K