SubXPCA and a generalized feature partitioning approach to principal component analysis

DOI10.1016/J.PATCOG.2007.08.006zbMATH Open1131.68088DBLPjournals/pr/KumarN08OpenAlexW2066700623WikidataQ57703276 ScholiaQ57703276MaRDI QIDQ2469736FDOQ2469736

Kadappagari Vijaya Kumar, Atul Negi

Publication date: 7 February 2008

Published in: Pattern Recognition (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.patcog.2007.08.006

Recommendations

• A theoretical investigation of feature partitioning principal component analysis methods
• Computational and space complexity analysis of SubXPCA
• Supervised principal component analysis: visualization, classification and regression on subspaces and submanifolds
• On incremental and robust subspace learning
• Clustering and feature selection using sparse principal component analysis

zbMATH Keywords

principal component analysisdimensionality reductionfeature partitioningsub-pattern based PCA

Mathematics Subject Classification ID

Pattern recognition, speech recognition (68T10)

Cites Work

• Principal component analysis.
• How many principal components? Stopping rules for determining the number of non-trivial axes revisited
• Numerical recipes in C++. The art of scientific computing
• Title not available (Why is that?)
• Palmprint recognition using eigenpalms features

Cited In (3)

• Computational and space complexity analysis of SubXPCA
• Subspace projection: A unified framework for a class of partition-based dimension reduction techniques
• A theoretical investigation of feature partitioning principal component analysis methods

Uses Software

• UCI-ml
• Yale Face
• CMU PIE
• ORL face

This page was built for publication: SubXPCA and a generalized feature partitioning approach to principal component analysis

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2469736)