Following general arguments on approximation Bayesian discriminant functions by neural networks, rigorously proved is that a three layered neural network, having rather a small number of hidden layer units, can approximate the Bayesian discriminant function for the two category classification if the log ratio of the a posteriori probability is a polynomial. The accuracy of approximation is measured by the Kullback- Leibler information. An extension to the multi-category case is also discussed.
CITATION STYLE
Ito, Y., & Srinivasan, C. (2001). Approximation of Bayesian discriminant function by neural networks in terms of Kullback-Leibler information. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 2130, pp. 135–140). Springer Verlag. https://doi.org/10.1007/3-540-44668-0_19
Mendeley helps you to discover research relevant for your work.