A comparative analysis of structural risk minimization by support vector machines and nearest neighbor rule

Pattern Recognition Letters

Volumn 25, Issue 1, 2004, Pages 63-71

  Karaçal, Bilge ^a   Ramanath, Rajeev ^b   Snyder, Wesley E ^b  

^a UNIVERSITY OF PENNSYLVANIA   (United States)

^b North Carolina State University   (United States)

Author keywords

Kernel operator; Nearest neighbor; Prototype selection; Structural risk minimization; Support vector machines

Indexed keywords

COMPUTATIONAL COMPLEXITY; COSTS; MACHINERY; RISKS;

NEAREST NEIGHBOR (NN) CLASSIFIERS; SUPPORT VECTOR MACHINES (SVM);

PATTERN RECOGNITION;

NEAREST NEIGHBOR ANALYSIS;

EID: 0345376662     PISSN: 01678655     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.patrec.2003.09.002     Document Type: Article

References (23)

1. Bhattacharya, B., Kaller, D., 1998. Reference set thinning for the k-nearest neighbor decision rule. In: Proc. IEEE Internat. Conf. on Pattern Recognition, vol. 1, pp. 238-242
2. Blake, C., Merz, C., 1998. UCI repository of machine learning databases. Available from htt://www.ics.uci.edu/~mlearn/MLRepository.html
3. Cerveron V. Ferri F. Another move towards the minimum consistent subset: A tabu search approach to the condensed nearest neighbor rule IEEE Trans. Systems, Man Cybernet. B 31 3 2001 408-413
4. Chidananda-Gowda K. Krishna G. The condensed nearest neighbor rule using the concept of mutual nearest neighbourhood IEEE Trans. Inform. Theory 25 4 1979 488-490
5. Cortes C. Vapnik V. Support-vector networks Machine Learn. 20 1995 273-297
6. Cover T.M. Hart P.E. Nearest neighbor pattern classification IEEE Trans. Inform. Theory 13 1 1967 21-27
7. Dasarathy B. Minimal consistent set (MCS) identification for optimal nearest neighbor decision systems design IEEE Trans. Systems Man Cybernet. 24 3 1994 511-517
8. Devijver P.A. Kittler J. Pattern Recognition: A Statistical Approach 1982 Prentice Hall London
9. Farach-Colton, M., Indyk, P., 1999. Approximate nearest neighbor algorithms for Hausdorff metrics via embeddings. In: 40th Annual Symposium on Foundations of Computer Science
10. Gates G.W. The reduced nearest neighbor rule IEEE Trans. Inform. Theory 18 3 1972 431-433
11. Hart P.E. The condensed nearest neighbor rule IEEE Trans. Inform. Theory 14 3 1968 515-516
12. Joachims T. Making large-scale svm learning practical Schölkopf B. Burges C. Smola A. Advances in Kernel Methods--Support Vector Learning 1999 MIT Press
13. Karaçal B. Krim A. Fast minimization of the structural risk by nearest neighbor rule IEEE Trans. Neural Networks 14 1 2003 127-137
14. Kuncheva L. Bezdek J. Nearest prototype classification: Clustering, genetic algorithms, or random search? IEEE Trans. Systems Man Cybernet. 28 1 1998 160-164
15. Osuna, E., Freund, R., Girosi, F., 1997. Training support vector machines: An application to face detection. In: Proc. Computer Vision and Pattern Recognition
16. Ritter G. Woodruff H. Lowry S. Isenhour T. An algorithm for a selective nearest neighbor decision rule IEEE Trans. Inform. Theory 21 1975 665-669
17. Schölkopf B. Kernel trick for distances Leen T.K. Dietterich T.G. Tresp V. Advances in Neural Information Processing Systems 13, Papers from Neural Information Processing Systems (NIPS) 2000, Denver, CO, USA 2000 301-307 MIT Press
18. Schölkopf B. Burges C. Smola A. Advances in Kernel Methods: Support Vector Learning 1999 MIT Press Cambridge
19. Tomek I. An experiment with the edited nearest neighbor rule IEEE Trans. Systems Man Cybernet. 6 6 1976 448-452
20. Vapnik V. Statistical learning theory Haykin S. Adaptive and Learning Systems for Signal Processing, Communications, and Control 1998 John Wiley - Sons
21. Vapnik V. Golowich S. Smola A. Support vector method for function approximation, regression estimation, and signal processing Advances in Neural Information Systems vol. 9 1997 MIT Press Cambridge
22. Wilson D.R. Martinez T.R. Reduction techniques for instance-based learning algorithms Machine Learn. 38 3 2000 257-286
23. Yu K. Ji L. Zhang X. Kernel nearest-neighbor algorithm Neural Process. Lett. 15 2 2002 147-156