Fast principal component analysis using fixed-point algorithm
No Thumbnail Available
File version
Author(s)
Sharma, Alok
Pahwal, Kuldip K
Pahwal, Kuldip K
Griffith University Author(s)
Primary Supervisor
Other Supervisors
Editor(s)
Date
2007
Size
File type(s)
Location
License
Abstract
In this paper we present an efficient way of computing principal component analysis (PCA). The algorithm finds the desired number of leading eigenvectors with a computational cost that is much less than that from the eigenvalue decomposition (EVD) based PCA method. The mean squared error generated by the proposed method is very similar to the EVD based PCA method.
Journal Title
Pattern Recognition Letters
Conference Title
Book Title
Edition
Volume
28
Issue
Thesis Type
Degree Program
School
Patent number
Funder(s)
Grant identifier(s)
Rights Statement
Rights Statement
Item Access Status
Note
Access the data
Related item(s)
Subject
Cognitive and computational psychology