This paper considers the use of Order Statistics (OS) in the theory of Pattern Recognition (PR). The pioneering work on using OS for classification was presented in [1] for the Uniform distribution, where it was shown that optimal PR can be achieved in a counter-intuitive manner, diametrically opposed to the Bayesian paradigm, i.e., by comparing the testing sample to a few samples distant from the mean - which is distinct from the optimal Bayesian paradigm. In [2], we showed that the results could be extended for a few symmetric distributions within the exponential family. In this paper, we attempt to extend these results significantly by considering asymmetric distributions within the exponential family, for some of which even the closed form expressions of the cumulative distribution functions are not available. These distributions include the Rayleigh, Gamma and certain Beta distributions. As in [1] and [2], the new scheme, referred to as Classification by Moments of Order Statistics (CMOS), attains an accuracy very close to the optimal Bayes' bound, as has been shown both theoretically and by rigorous experimental testing.

Additional Metadata
Keywords Classification using Order Statistics (OS), Moments of OS
Persistent URL dx.doi.org/10.1007/978-3-642-40261-6_44
Series Lecture Notes in Computer Science
Citation
Thomas, A. (Anu), & Oommen, J. (2013). On achieving near-optimal "anti-Bayesian" order statistics-based classification for asymmetric exponential distributions. In Lecture Notes in Computer Science. doi:10.1007/978-3-642-40261-6_44