Principal component analysis using QR decomposition

No Thumbnail Available
File version
Author(s)
Sharma, Alok
Paliwal, Kuldip K
Imoto, Seiya
Miyano, Satoru
Griffith University Author(s)
Primary Supervisor
Other Supervisors
Editor(s)
Date
2013
Size
File type(s)
Location
License
Abstract

In this paper we present QR based principal component analysis (PCA) method. Similar to the singular value decomposition (SVD) based PCA method this method is numerically stable. We have carried out analytical comparison as well as numerical comparison (on Matlab software) to investigate the performance (in terms of computational complexity) of our method. The computational complexity of SVD based PCA is around flops (where d is the dimensionality of feature space and n is the number of training feature vectors); whereas the computational complexity of QR based PCA is around TeX flops (where t is the rank of data covariance matrix and h is the dimensionality of reduced feature space). It is observed that the QR based PCA is more efficient in terms of computational complexity.

Journal Title

International Journal of Machine Learning and Cybernetics

Conference Title
Book Title
Edition
Volume

4

Issue

6

Thesis Type
Degree Program
School
Publisher link
Patent number
Funder(s)
Grant identifier(s)
Rights Statement
Rights Statement
Item Access Status
Note
Access the data
Related item(s)
Subject

Pattern Recognition and Data Mining

Artificial Intelligence and Image Processing

Persistent link to this record
Citation
Collections