Sequential Search for Decremental Edition
暂无分享,去创建一个
The edition process is an important task in supervised classification because it helps to reduce the size of the training sample. On the other hand, Instance-Based classifiers store all the training set indiscriminately, which in almost all times, contains useless or harmful objects, for the classification process. Therefore it is important to delete unnecessary objects to increase both classification speed and accuracy. In this paper, we propose an edition method based on sequential search and we present an empirical comparison between it and some other decremental edition methods.
[1] G. Gates,et al. The reduced nearest neighbor rule (Corresp.) , 1972, IEEE Trans. Inf. Theory.
[2] G. Gates. The Reduced Nearest Neighbor Rule , 1998 .
[3] Tony R. Martinez,et al. Reduction Techniques for Instance-Based Learning Algorithms , 2000, Machine Learning.
[4] Dennis L. Wilson,et al. Asymptotic Properties of Nearest Neighbor Rules Using Edited Data , 1972, IEEE Trans. Syst. Man Cybern..
[5] Catherine Blake,et al. UCI Repository of machine learning databases , 1998 .