On Dimensionality, Sample Size, and Classification Error of Nonparametric Linear Classification Algorithms

  • Authors:
  • Š/a&rmacr/nas Raudys

  • Affiliations:
  • Institute of Mathematics and Informatics, Vilnius, Lithuania

  • Venue:
  • IEEE Transactions on Pattern Analysis and Machine Intelligence
  • Year:
  • 1997

Quantified Score

Hi-index 0.15

Visualization

Abstract

This paper compares two nonparametric linear classification algorithms驴the zero empirical error classifier and the maximum margin classifier驴with parametric linear classifiers designed to classify multivariate Gaussian populations [7]. Formulae and a table for the mean expected probability of misclassification MEPN are presented. They show that the classification error is mainly determined by N驴/驴p, a learning-set size/dimensionality ratio. However, the influences of learning-set size on the generalization error of parametric and nonparametric linear classifiers are quite different. Under certain conditions the nonparametric approach allows us to obtain reliable rules, even in cases where the number of features is larger than the number of training vectors.