Pattern recognition by means of disjoint principal components models
From MaRDI portal
Publication:1229763
DOI10.1016/0031-3203(76)90014-5zbMath0336.68040OpenAlexW2063145959MaRDI QIDQ1229763
Publication date: 1976
Published in: Pattern Recognition (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0031-3203(76)90014-5
Related Items (14)
Consensus analysis of multiple classifiers using non-repetitive variables: diagnostic application to microarray gene expression data ⋮ Handwritten digit classification using higher order singular value decomposition ⋮ Projection-pursuit approach to robust linear discriminant analysis ⋮ Distance preserving linear feature selection ⋮ Robust classification for skewed data ⋮ Prediction for regularized clusterwise multiblock regression ⋮ PCA and PLS with very large data sets ⋮ Partial least squares classification for high dimensional data using the PCOUT algorithm ⋮ Learning distance to subspace for the nearest subspace methods in high-dimensional data classification ⋮ Cross-validation methods in principal component analysis: a comparison ⋮ Robust data imputation ⋮ Unnamed Item ⋮ On the orthogonal distance to class subspaces for high-dimensional data classification ⋮ A Simple Regularization Procedure for Discriminant Analysis
Uses Software
Cites Work
- Matrix eigensystem routines - EISPACK guide
- Discriminatory Analysis. Nonparametric Discrimination: Consistency Properties
- An Optimal Set of Discriminant Vectors
- Typicality, Diversity, and Feature Pattern of an Ensemble
- Patterns in pattern recognition: 1968-1974
- Application of the Karhunen-Loève Expansion to Feature Selection and Ordering
- Inference in an Authorship Problem
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Pattern recognition by means of disjoint principal components models
