Modified minimum classification error learning and its application to neural networks

1Citations
Citations of this article
5Readers
Mendeley users who have this article in their library.

Abstract

A novel method to improve the generalization performance of the Minimum Classification Error (MCE) / Generalized Probabilistic Descent (GPD) learning is proposed. The MCE / GPD learning proposed by Juang and Katagiri in 1992 results in better recognition performance than the maximum-likelihood (ML) based learning in various areas of pattern recognition. Despite its superiority in recognition performance, it still suffers from the problem of “over-fitting” to the training samples as it is with other learning algorithms. In the present study, a regularization technique is employed to the MCE learning to overcome this problem. Feed-forward neural networks are employed as a recognition platform to evaluate the recognition performance of the proposed method. Recognition experiments are conducted on several sorts of datasets.

Cite

CITATION STYLE

APA

Shimodaira, H., Rokui, J., & Nakai, M. (1998). Modified minimum classification error learning and its application to neural networks. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1451, pp. 785–794). Springer Verlag. https://doi.org/10.1007/bfb0033303

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free