Recursive Bayesian Linear Discriminant for Classification

  • Authors:
  • D. Huang;C. Xiang

  • Affiliations:
  • Department of Electrical and Computer Engineering, National University of Singapore, Singapore;Department of Electrical and Computer Engineering, National University of Singapore, Singapore

  • Venue:
  • ISNN '07 Proceedings of the 4th international symposium on Neural Networks: Part II--Advances in Neural Networks
  • Year:
  • 2007

Quantified Score

Hi-index 0.00

Visualization

Abstract

Extracting proper features is crucial to the performance of a pattern recognition system. Since the goal of a pattern recognition system is to recognize a pattern correctly, a natural measure of "goodness" of extracted features is the probability of classification error. However, popular feature extraction techniques like principal component analysis (PCA), Fisher linear discriminant analysis (FLD), and independent component analysis (ICA) extract features that are not directly related to the classification accuracy. In this paper, we present two linear discriminant analysis algorithms (LDA) whose criterion functions are directly based on minimum probability of classification error, or the Bayes error. We term these two linear discriminants as recursive Bayesian linear discriminant I (RBLD-I) and recursive Bayesian linear discriminant II (RBLD-II). Experiments on databases from UCI Machine Learning Repository show that the two novel linear discriminants achieve superior classification performance over recursive FLD (RFLD).