title: Discriminant learning analysis.
abstract: Linear discriminant analysis (LDA) as a dimension reduction method is widely used in classification such as face recognition. However, it suffers from the small sample size (SSS) problem when data dimensionality is greater than the sample size, as in images where features are high dimensional and correlated. In this paper, we propose to address the SSS problem in the framework of statistical learning theory. We compute linear discriminants by regularized least squares regression, where the singularity problem is resolved. The resulting discriminants are complete in that they include both regular and irregular information. We show that our proposal and its nonlinear extension belong to the same framework where powerful classifiers such as support vector machines are formulated. In addition, our approach allows us to establish an error bound for LDA. Finally, our experiments validate our theoretical analysis results.
authors.affiliation: Computer Science Department, Montclair State University, Montclair, NJ 07003, USA. peng@pegasus.montclair.edu
authors.forename: Jing
authors.initials: J
authors.lastname: Peng
authors.forename: Peng
authors.initials: P
authors.lastname: Zhang
authors.forename: Norbert
authors.initials: N
authors.lastname: Riedel
mesh_terms: D000465:Algorithms; D001185:Artificial Intelligence; D001699:Biometry / Q000379:methods*; D004193:Discrimination Learning; D005145:Face / Q000033:anatomy & histology*; D006801:Humans; D007089:Image Enhancement / Q000379:methods; D007090:Image Interpretation, Computer-Assisted / Q000379:methods*; D010363:Pattern Recognition, Automated / Q000379:methods*; D015203:Reproducibility of Results; D012680:Sensitivity and Specificity