deflation Method for Penalized Matrix Decomposition Sparse PCA
In the penalized matrix decomposition proposed by Witten, Tibshirani and Hastie<ref name="WTH2009">Daniela M. Witten, Robert Tibshirani, and Trevor Hastie. (2009) "A penalized matrix decomposition, with applications to sparse principal components and canonical correlation analysis". Biostatistics, 10(3):515–534.</ref>, after the penalized vectors [math]\displaystyle{ \,\textbf{v}_k }[/math] and [math]\displaystyle{ \,\textbf{u}_k }[/math] and the constant [math]\displaystyle{ \,d_k }[/math] have been determined, the data matrix [math]\displaystyle{ \,\textbf{X}^k }[/math] is deflated using the following formula:
The penalized matrix decomposition can be used to obtain a version of sparse PCA. In this case,
and
Then,
So if [math]\displaystyle{ \| \textbf{v}_k \|_2 = 1 }[/math] then the deflation method begin used for the penalized sparse PCA is the projection deflation method.
References
<references/>