On the Relationship Between Dependence Tree Classification Error and Bayes Error Rate

2007 ◽  
Vol 29 (10) ◽  
pp. 1866-1868 ◽  
Author(s):  
Kiran S. Balagani ◽  
Vir V. Phoha
Author(s):  
HEE-JOONG KANG ◽  
SEONG-WHAN LEE

In order to raise a class discrimination power by the combination of multiple classifiers, the upper bound of Bayes error rate which is bounded by the conditional entropy of a class and decisions should be minimized. Based on the minimization of the upper bound of the Bayes error rate, Wang and Wong proposed only a tree dependence approximation scheme of a high-dimensional probability distribution composed of a class and patterns. This paper extends such a tree dependence approximation scheme to higher order dependency for improving the classification performance and thus optimally approximates the high-dimensional probability distribution with a product of low-dimensional distributions. And then, a new combination method by the proposed approximation scheme is presented and evaluated with classifiers recognizing unconstrained handwritten numerals.


Informatica ◽  
2011 ◽  
Vol 22 (3) ◽  
pp. 371-381 ◽  
Author(s):  
Kęstutis Dučinskas ◽  
Lijana Stabingienė

Sign in / Sign up

Export Citation Format

Share Document