Please use this identifier to cite or link to this item:
|Title:||Fast algorithms for minor component analysis|
|Source:||Bartelmaos, S.,Abed-Meraim, K.,Attallah, S. (2005). Fast algorithms for minor component analysis. IEEE Workshop on Statistical Signal Processing Proceedings 2005 : 239-243. ScholarBank@NUS Repository.|
|Abstract:||In this paper, we propose new adaptive algorithms for the extraction and tracking of the least (minor) eigenvectors of a positive Hermitian covariance matrix. The proposed algorithms are said fast in the sense that their computational cost is of order O(np) flops per iteration where n is the size of the observation vector and p < n is the number of minor eigenvectors we need to estimate. Two classes of algorithms are considered: namely the PASTd (Projection Approximation Subspace Tracking with deflation) that is derived using projection approximation in conjunction with power iteration and the Oja that uses stochastic gradient technique. Using appropriate fast orthogonalization techniques we introduce for each class new fast algorithms that extract the minor eigenvectors and guarantee the orthogonality of the weight matrix at each iteration. ©2005 IEEE.|
|Source Title:||IEEE Workshop on Statistical Signal Processing Proceedings|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on Dec 9, 2017
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.