Boosting in probabilistic neural networks

The basic idea of boosting is to increase the pattern recognition accuracy by combining classifiers which have been derived from differently weighted versions of the original training data. It has been verified in practical experiments that the resulting classification performance can be improved by...

Full description

Saved in:
Bibliographic Details
Main Authors: Grim, J., Pudil, P., Somol, P.
Format: Conference Proceeding
Language:English
Subjects:
Bayesian methods
Boosting
Decision making
Information theory
Intelligent networks
Maximum likelihood estimation
Neural networks
Pattern recognition
Sampling methods
Training data
Online Access:Request full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:The basic idea of boosting is to increase the pattern recognition accuracy by combining classifiers which have been derived from differently weighted versions of the original training data. It has been verified in practical experiments that the resulting classification performance can be improved by increasing the weights of misclassified training samples. However in statistical pattern recognition, the weighted data may influence the form of the estimated conditional distributions and therefore the theoretically achievable classification error could increase. We prove that in case of maximum-likelihood estimation the weighting of discrete data vectors is asymptotically equivalent to multiplication of the estimated discrete conditional distributions by a positive bounded function. Consequently, the Bayesian decision-making is shown to be asymptotically invariant with respect to arbitrary weighting of data provided that (a) the weighting function is defined identically for all classes and (b) the prior probabilities are properly modified.
ISSN:1051-4651
2831-7475
DOI:10.1109/ICPR.2002.1048256