Title
A distribution-free geometric upper bound for the probability of error of a minimum distance classifier
Abstract
An upperbound to the probability of error per class in a multivariate pattern classification is derived. The bound, given by P(E|class wi)≤NR2i is derived with minimal assumptions; specifically the mean vectors exist and are distinct and the covariance matrices exist and are non-singular. No other assumptions are made about the nature of the distributions of the classes. In equation (i) N is the number of features in the feature (vector) space and Ri is a measure of the “radial neighbourhood” of a class. An expression for Ri is developed. A comparison to the multivariate Gaussian hypothesis is presented.
Year
DOI
Venue
1978
10.1016/0031-3203(78)90037-7
Pattern Recognition
Keywords
Field
DocType
Distance classifiers,Error bounds,Multivariate distributions,Feature evaluation,Non-parametric statistics,Chebyshev's inequality
Chebyshev's inequality,Combinatorics,Pattern recognition,Upper and lower bounds,Feature evaluation,Nonparametric statistics,Artificial intelligence,Probability of error,Classifier (linguistics),Mathematics
Journal
Volume
Issue
ISSN
10
4
0031-3203
Citations 
PageRank 
References 
3
0.70
0
Authors
2
Name
Order
Citations
PageRank
P.J. van Otterloo130.70
I.T. Young230.70