Sciweavers

287 search results - page 8 / 58
» Optimal Solutions for Sparse Principal Component Analysis
Sort
View
CSDA
2004
105views more  CSDA 2004»
14 years 9 months ago
Computational aspects of algorithms for variable selection in the context of principal components
Variable selection consists in identifying a k-subset of a set of original variables that is optimal for a given criterion of adequate approximation to the whole data set. Several...
Jorge Cadima, J. Orestes Cerdeira, Manuel Minhoto
IJCNN
2006
IEEE
15 years 3 months ago
Nonlinear principal component analysis of noisy data
With very noisy data, having plentiful samples eliminates overfitting in nonlinear regression, but not in nonlinear principal component analysis (NLPCA). To overcome this problem...
William W. Hsieh
PR
2006
115views more  PR 2006»
14 years 9 months ago
Diagonal principal component analysis for face recognition
In this paper, a novel subspace method called diagonal principal component analysis (DiaPCA) is proposed for face recognition. In contrast to standard PCA, DiaPCA directly seeks t...
Daoqiang Zhang, Zhi-Hua Zhou, Songcan Chen
ICML
2004
IEEE
15 years 10 months ago
K-means clustering via principal component analysis
Principal component analysis (PCA) is a widely used statistical technique for unsupervised dimension reduction. K-means clustering is a commonly used data clustering for unsupervi...
Chris H. Q. Ding, Xiaofeng He
67
Voted
NPL
2008
63views more  NPL 2008»
14 years 9 months ago
New Routes from Minimal Approximation Error to Principal Components
We introduce two new methods of deriving the classical PCA in the framework of minimizing the mean square error upon performing a lower-dimensional approximation of the data. These...
Abhilash Alexander Miranda, Yann-Aël Le Borgn...