6533b839fe1ef96bd12a59f8
RESEARCH PRODUCT
Editing prototypes in the finite sample size case using alternative neighborhoods
F.j. FerriJosé Salvador SánchezFiliberto Plasubject
Computer scienceDelaunay triangulationbusiness.industryCentroidMachine learningcomputer.software_genreClass (biology)k-nearest neighbors algorithmSample size determinationPattern recognition (psychology)OutlierArtificial intelligenceData miningbusinesscomputerdescription
The recently introduced concept of Nearest Centroid Neighborhood is applied to discard outliers and prototypes 111 class overlapping regions in order to improve the performance of the Nearest Neighbor rule through an editing procedure, This approach is related to graph based editing algorithms which also define alternative neighborhoods in terms of geornetric relations, Classical editing algorithms are compared to these alternative editing schemes using several synthetic and real data problems. The empirical results show that, the proposed editing algorithm constitutes a good trade-off among performance and computational burden.
| year | journal | country | edition | language |
|---|---|---|---|---|
| 1998-01-01 |