Data Science Distinguished Speaker Seminar Series: Anti-Bayesian Statistical Pattern Recognition

Data Science Distinguished Speaker Seminar Series: Anti-Bayesian Statistical Pattern Recognition

Categories: Lectures and Seminars | Intended for , , , , , , ,

Wednesday, September 14, 2016

1:30 PM - 3:30 PM | Add to calendar

5345 Herzberg Laboratories

1125 Colonel By Dr, Ottawa, ON

Contact Information

Jena Lynde-Smith, 613-520-2600 ext.3244, jena.lyndesmith@carleton.ca

Cost

Free

About this Event

Host Organization: The Institute for Data Science
More Information: Please click here for additional details.

ABSTRACT
The gold standard for a classifier is the condition of optimality attained by the Bayesian classifier. Within a Bayesian paradigm, if we are allowed to compare the testing sample with only a single point in the feature space from each class, the optimal Bayesian strategy would be to achieve this based on the (Mahalanobis) distance from the corresponding means. The reader should observe that, in this context, the mean, in one sense, is the most central point in the respective distribution. In this talk, we shall show that we can obtain optimal results by operating in a diametrically opposite way, i.e., a so-called “anti-Bayesian” manner. Indeed, we shall show the completely counter-intuitive result that by working with a very few (sometimes as small as two) points distant from the mean, one can obtain remarkable classification accuracies. Further, if these points are determined by the Quantiles of the distributions, the accuracy of our method, referred to as Classification by Quantile Statistics (CQS), attains the optimal Bayes’ bound! This claim, which is totally counter-intuitive, has been proven for many uni-dimensional, and some multi-dimensional distributions within the exponential family, and the theoretical results have been verified by rigorous experimental testing. They have also been tested on real-life data sets. Apart from the fact that these results are quite fascinating and pioneering in their own right, they also give a theoretical foundation for the families of Prototype Reduction Schemes (PRSs) and Border Identification (BI) algorithms reported in the literature.