On Dimensionality, Sample Size, Classification Error, and Complexity of Classification Algorithm in Pattern Recognition

DOI10.1109/TPAMI.1980.4767011zbMath0443.62047OpenAlexW2051885135WikidataQ47296960 ScholiaQ47296960MaRDI QIDQ3886687

Vitalijus Pikelis, Sarunas J. Raudys

Publication date: 1980

Published in: IEEE Transactions on Pattern Analysis and Machine Intelligence (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1109/tpami.1980.4767011

zbMATH Keywords

discriminant function sample size dimensionality misclassification probability classification error complexity of classification algorithm

Mathematics Subject Classification ID

Classification and discrimination; cluster analysis (statistical aspects) (62H30) Point estimation (62F10) Pattern recognition, speech recognition (68T10)

Related Items (13)

Learning algorithms may perform worse with increasing training set size: algorithm-data incompatibility ⋮ On Kolmogorov asymptotics of estimators of the misclassification error rate in linear discriminant analysis ⋮ The Euclidean distance classifier: an alternative to the linear discriminant function ⋮ A fast SVD-hidden-nodes based extreme learning machine for large-scale data analytics ⋮ Exact representation of the second-order moments for resubstitution and leave-one-out error estimation for linear discriminant analysis in the univariate heteroskedastic Gaussian model ⋮ Results in statistical discriminant analysis: A review of the former Soviet Union literature. ⋮ A quadratic classifier for high-dimensional, periodic-measurement pattern-recognition problems ⋮ Problems in pattern classification in high dimensional spaces: Behavior of a class of combined neuro-fuzzy classifiers ⋮ Determination of the optimal number of features for quadratic discriminant analysis via the normal approximation to the discriminant distribution ⋮ Independent rule in classification of multivariate binary data ⋮ A Simple Regularization Procedure for Discriminant Analysis ⋮ The linear and euclidean discriminant functions: a comparison v1a asymptotic expansions and simulation study ⋮ Average classification accuracy over collections of Gaussian problems - common covariance matrix case

This page was built for publication: On Dimensionality, Sample Size, Classification Error, and Complexity of Classification Algorithm in Pattern Recognition