A new method of optimizing prototypes for nearest neighbor classifiers using a multi-layer network
暂无分享,去创建一个
[1] Chin-Liang Chang,et al. Finding Prototypes For Nearest Neighbor Classifiers , 1974, IEEE Transactions on Computers.
[2] Hong Yan,et al. Prototype optimization for nearest neighbor classifiers using a two-layer perceptron , 1993, Pattern Recognit..
[3] Keinosuke Fukunaga,et al. A Branch and Bound Algorithm for Computing k-Nearest Neighbors , 1975, IEEE Transactions on Computers.
[4] Peter E. Hart,et al. Nearest neighbor pattern classification , 1967, IEEE Trans. Inf. Theory.
[5] Thomas P. Yunck,et al. A Technique to Identify Nearest Neighbors , 1976, IEEE Transactions on Systems, Man, and Cybernetics.
[6] E. Ruiz. An algorithm for finding nearest neighbours in (approximately) constant average time , 1986 .
[7] Peter E. Hart,et al. The condensed nearest neighbor rule (Corresp.) , 1968, IEEE Trans. Inf. Theory.
[8] Teuvo Kohonen,et al. The self-organizing map , 1990 .
[9] Hugh B. Woodruff,et al. An algorithm for a selective nearest neighbor decision rule (Corresp.) , 1975, IEEE Trans. Inf. Theory.
[10] Hong Yan,et al. Handwritten digit recognition using an optimized nearest neighbor classifier , 1994, Pattern Recognit. Lett..
[11] Luisa Micó,et al. A new version of the nearest-neighbour approximating and eliminating search algorithm (AESA) with linear preprocessing time and memory requirements , 1994, Pattern Recognit. Lett..