Hyperspherical prototypes for pattern classification

International Journal of Pattern Recognition and Artificial Intelligence

Volumn 23, Issue 8, 2009, Pages 1549-1575

  Fayed, Hatem A ^a   Atiya, Amir F ^b   Hashem, Sherif M R ^a  

^a CAIRO UNIVERSITY   (Egypt)

^b CAIRO UNIVERSITY   (Egypt)

Author keywords

Hyperspherical prototypes; Nearest neighbor; Pattern classification

Indexed keywords

NEAREST NEIGHBOR SEARCH; OPTIMIZATION; PATTERN RECOGNITION;

CURSE OF DIMENSIONALITY; HYPERSPHERICAL; K-NEAREST NEIGHBOR METHOD; NEAREST NEIGHBOR METHOD; NEAREST NEIGHBORS; PERFORMANCE ASPECTS; PROTOTYPE CLASSIFICATION; QUADRATIC OPTIMIZATION PROBLEMS;

QUADRATIC PROGRAMMING;

EID: 74549183493     PISSN: 02180014     EISSN: None     Source Type: Journal    
DOI: 10.1142/S0218001409007740     Document Type: Article

References (46)

1. A. Atiya, S. Hashem and H. Fayed, New hyperspheres for pattern classification, Proc. 1st Int. Computer Engineering Conf. (ICENCO-2004), Cairo, Egypt (2004), pp. 258- 263.
2. A. Atiya, S. Hashem and H. Fayed, Pattern classification using a set of compact hyperspheres, Proc. 1st Int. Conf. Neural Info. Proc. ICONIP'06, Hong Kong, Springer- Verlag Berlin, Heidelberg, Lecture Notes in Computer Science, Vol.4223 (2006), pp. 116-123.
3. R. Barandela, F. J. Ferri and J. S. Sanchez, A simple locally adaptive nearest neighbor rule with application to pollution forecasting, Int. J. Patt. Recogn. Artif. Intell. 19(6) (2005) 787-806.
4. M. Bazaraa and C. Shetty, Nonlinear Programming: Theory and Algorithms (John Wiley, New York, 1979).
5. J. L. Bentley, Multidimensional binary search trees used for associative searching, Commun. ACM 18(9) (1975) 509-517.
6. C. L. Blake, E. Keogh and C. J. Merz, UCI repository of machine learning database, University of California, Irvine, Department of Information and Computer Science, 1994. Available: http://www.ics.uci.edu/mlearn.
7. L. Blumenthal and G. Wahlin, On the spherical surface of smallest radius enclosing a bounded subset of N-dimensional Euclidean space, Bull. Amer. Math. Soc. 47 (1941) 771-777.
8. P. Burman, A comparative study of ordinary cross-validation, v-fold cross-validation and repeated learning-testing methods, Biometrika 76 (1989) 503-514.
9. T. M. Cover and P. E. Hart, Nearest neighbor pattern classification, IEEE Trans. Inform. Theor. 13 (1967) 21-27.
10. A. Djouadi and E. Bouktache, A fast algorithm for the nearest-neighbor classifier, IEEE Trans. Patt. Anal. Mach. Intell. 19(3) (1997) 277-282.
11. R. O. Duda, P. E. Hart and D. G. Stork, Pattern Classification, 2nd ed. (John Wiley, New York, 2001).
12. S. A. Dudani, The distance-weighted k-nearest neighbor rule, IEEE Trans. Syst. Man. Cybern. SMC-6(4) (1976) 325-327.
13. H. A. Fayed, S. Hashem and A. F. Atiya, Self-generating prototypes for pattern classification, Patt. Recogn. 40(5) (2007) 1498-1509.
14. K. Fukunaga, Introduction to Statistical Pattern Recognition, 2nd ed. (Academic Press, New York, 1990).
15. K. Fukunaga and P. M. Narendra, A branch and bound algorithm for computing k-nearest neighbors, IEEE Trans. Comp. 24 (1975) 750-753.
16. C. Gagn and M. Parizeau, Coevolution of nearest neighbor classifiers, Int. J. Patt. Recogn. Artif. Intell. 21(5) (2007) 921-946.
17. P. Hart, The condensed nearest neighbor rule, IEEE Trans. Inform. Th. 14 (1968) 515-516.
18. T. Hastie and R. Tibshirani, Discriminant adaptive nearest neighbor classification, IEEE Trans. Patt. Anal. Mach. Intell. 18(6) (1996) 607-616.
19. K. Hattori and M. Takahashi, A new nearest-neighbor rule in the pattern classification problem, Patt. Recogn. 32(3) (1999) 425-432.
20. M. J. Hudak, RCE classifiers: theory and practice, Cybern. Syst. 23 (1992) 483-515.
21. F. John, Extremum problems with inequalities as subsidiary conditions, Appeared in Courant Anniversary Volume, New York (1948), pp. 187-204.
22. L. Kaufman and P. J. Rousseeuw, Finding Groups in Data: An Introduction to Cluster Analysis (John Wiley, 1990).
23. L. G. Khachiyan, Rounding of polytopes in the real number model of computation, Math. Op. Res. 21 (1996) 307-320.
24. T. Kohonen, Self-Organization and Associative Memory, 3rd ed. (Springer-Verlag, Heidelberg, Germany, 1989).
25. M. Kositsky and S. Ullman, Learning class regions by the union of ellipsoids, Proc. 3rd Int. Conf. Pattern Recognition (ICPR) (IEEE Computer Society Press, 1996), pp. 750-757.
26. P. Kumar, J. S. B. Mitchell and E. A. Yildirim, Computing core-sets and approximate smallest enclosing hyperspheres in high dimensions, Proc. ALENEX (2003), pp. 45-55.
27. E. W. Lee and S.-I. Chae, Fast design of reduced-complexity nearest-neighbor classifiers using triangular inequality, IEEE Trans. Patt. Anal. Mach. Intell. 20(5) (1998) 567-571.
28. S. Mehrotra, On the implementation of a primal-dual interior point method, SIAM J. Optimiz. 2(4) (1992) 575-601.
29. D. Michie, D. J. Spiegelhalter and C. C. Taylor, Machine Learning, Neural and Statistical Classification (New York, Ellis NY: Horwood, 1994).
30. S. A. Nene and S. K. Nayar, A simple algorithm for nearest neighbor search in high dimensions, IEEE Trans. Patt. Anal. Mach. Intell. 19(9) (1997) 989-1003.
31. R. Nock, M. Sebban and D. Bernard, A simple locally adaptive nearest neighbor rule with application to pollution forecasting, Int. J. Patt. Recogn. Artif. Intell. 17(8) (2003) 1369-1382.
32. M. J. Post, Minimum spanning ellipsoids, Proc. 16th ACM Symp. Theory of Comput. (1984), pp. 108-116.
33. L. Prechelt, Proben1. A set of neural-network benchmark problems, Univ. Karlsruhe, Germany, 1994, available ftp://ftp.ira.uka.de/pub/neuron/proben1.tar. gz.
34. C. E. Priebe, D. J. Marchette, J. G. DeVinney and D. A. Socolinsky, Classification using class cover catch digraphs, J. Classif. 20(1) (2003) 3-23.
35. X. Qiu and L. Wu, Nearest neighbor discriminant analysis, Int. J. Patt. Recogn. Artif. Intell. 20(8) (2006) 1245-1260.
36. D. Reilly, L. Cooper and C. Elbaum, A neural model for category learning, Biol. Cybern. 45 (1982) 35-41.
37. S. Salzberg, A nearest hyperrectangle learning method, Mach. Learn. 6 (1991) 277-309.
38. B. W. Silverman and D. M. Titterington, Minimum covering ellipses, SIAM J. Sci. Stat. Comput. 1 (1980) 401-409.
39. G. Toussaint, Proximity graphs for nearest neighbor decision rules: recent progress, Proc. 34th Symp. Comput. Stat. INTERFACE, Montreal, Canada (2002), pp. 83-106.
40. N. Tsumura, K. Itoh and Y. Ichioka, Reliable classification by double hyperspheres in pattern vector space, Patt. Recogn. 28 (1995) 1621-1626.
41. S. Volmer, Fast approximate nearest-neighbor queries in metric feature spaces by buoy indexing, Proc. 5th Int. Conf. Visual Information Systems, Hsin Chu, Taiwan (2002), pp. 36-49.
42. E. Welzl, Smallest Enclosing Disks (Balls and Ellipsoids), Lecture Notes in Computer Science, Vol.555 (1991), pp. 359-370.
43. D.L. Wilson, Asymptotic properties of nearest neighbor rules using edited data, IEEE Trans. Sys. Man. Cybern. 2 (1972) 408-421.
44. P. A. Wolfe, Duality theorem for nonlinear programming, Quart. Appl. Math. 19 (1961) 239-244.
45. S. J. Wright, Primal-dual Interior-point Methods (SIAM Publications: Philadelphia, 1997).
46. H. Zhang and G. Sun, Optimal reference subset selection for nearest neighbor classification by tabu search, Patt. Recogn. 35 (2002) 1481-1490.