z-logo
open-access-imgOpen Access
Making up the shortages of the Bayes classifier by the maximum mutual information classifier
Author(s) -
Lu Chenguang,
Zou Xiaohui,
Wang Wenfeng,
Chen Xiaofeng
Publication year - 2020
Publication title -
the journal of engineering
Language(s) - English
Resource type - Journals
ISSN - 2051-3305
DOI - 10.1049/joe.2019.1157
Subject(s) - classifier (uml) , naive bayes classifier , bayes' theorem , bayes error rate , bayes classifier , bayesian information criterion , mutual information , pattern recognition (psychology) , computer science , correctness , artificial intelligence , posterior probability , mathematics , algorithm , machine learning , bayesian probability , support vector machine
The Bayes classifier is often used because it is simple, and the maximum posterior probability (MPP) criterion it uses is equivalent to the least error rate criterion. However, it has issues in the following circumstances: (i) if information instead of correctness is more important, we should use the maximum likelihood criterion or maximum information criterion, which can reduce the rate of failure to report small probability events. (ii) For unseen instance classifications, the previously optimised classifier cannot be properly used when the probability distribution of true classes is changed. (iii) When classes’ feature distributions instead of transition probability functions (TPFs) are stable, it is improper to train the TPF, such as the logistic function, with parameters. (iv) For multi‐label classifications, it is difficult to optimise a group of TPFs with parameters that the Bayes classifier needs. This study addresses these issues by comparing the MPP criterion with the maximum likelihood criterion and maximum mutual information (MMI) criterion. It suggests using the MMI criterion for most unseen instance classifications. It presents a new iterative algorithm, the channel matching (CM) algorithm, for the MMI classification. It uses two examples to show the advantages of the CM algorithm: fast and reliable.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here