The Nearest Neighbor Classification Rule with a Reject Option

IEEE Transactions on Systems Science and Cybernetics

Volumn 6, Issue 3, 1970, Pages 179-185

  Hellman, Martin E ^a  

^a MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

IESCA; M O; PATTERN RECOGNITION SYSTEMS;

EID: 0014818402     PISSN: 05361567     EISSN: 21682887     Source Type: Journal    
DOI: 10.1109/TSSC.1970.300339     Document Type: Article

References (10)

1. T. M. Cover and P. E. Hart, “Nearest neighbor pattern classification,” IEEE Trans. Information Theory, vol. IT-13, pp. 21-27, January 1967.
2. C. K. Chow, “An optimum character recognition system using decision functions,” IRE Trans. Electronic Computers, vol. EC-6, pp. 247-254, December 1957.
3. “On optimum recognition error and reject trade-off,” IEEE Trans. Information Theory, vol. IT-16, pp. 41-36, January 1970.
4. S. Gass, Linear Programming, 2nd ed. New York: McGraw-Hill, 1964.
5. E. Fix and J. L. Hodges, Jr., “Discriminatory analysis, non-parametric discrimination,” USAF School of Aviation Medicine, Randolph Field, Tex., Contract AF41(128)-31, Project 21-49-004, Rept. 4, February 1951.
6. “Discriminatory analysis: small sample performance,” USAF School of Aviation Medicine, Randolph Field, Tex., Project 21-49-004, Rept. 11, August 1952.
7. D. O. Loftsgaarden and C. P. Quesenberry, “A nonparametric estimate of a multivariate density function,” Ann. Math. Stat., vol. 36, pp. 1049-1051, 1965.
8. E. Patrick and F. Fischer, “A generalization of the k-nearest neighbor rule,” presented at the 1969 Internatl. Conf. Artificial Intelligence.
9. D. W. Peterson, “Some convergence properties of a nearest neighbor decision rule,” IEEE Trans. Information Theory, vol. IT-16, pp. 26-31, January 1970.
10. G. Dantzig, Linear Programming and Extensions. Princeton, N.J.: Princeton University Press, 1963.