Classification with NormalBoost

Abstract

This paper presents a new boosting algorithm called NormalBoost which is capable of classifying a multi-dimensional binary class dataset. It adaptively combines several weak classifiers to form a strong classifier. Unlike many boosting algorithms which have high computation and memory complexities, NormalBoost is capable of classification with low complexity. Since NormalBoost assumes the dataset to be continuous, it is also noise resistant because it only deals with the means and standard deviations of each dimension. Experiments conducted to evaluate its performance shows that NormalBoost performs almost the same as AdaBoost in the classification rate. However, NormalBoost performs 189 times faster than AdaBoost and employs a very little amount of memory when a dataset of 2 million samples with 50 dimensions is invoked.

Keywords

• pattern recognition
• classification
• binary classifiers
• boosting