Block Principal Component Analysis With Nongreedy ℓ1-Norm Maximization
Lists
Only you see this
Abstract
Block principal component analysis with ℓ <sub xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">1</sub> -norm (BPCA-L1) has demonstrated its effectiveness in a lot of visual classification and data mining tasks. However, the greedy strategy for solving the ℓ <sub xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">1</sub> -norm maximization problem is prone to being struck in local solutions. In this paper, we propose a BPCA with nongreedy ℓ <sub xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">1</sub> -norm maximization, which obtains better solutions than BPCA-L1 with all the projection directions optimized simultaneously. Other than BPCA-L1, the new algorithm has been evaluated against some popular principal component analysis (PCA) algorithms including PCA-L1 and 2-D PCA-L1 on a variety of benchmark data sets. The results demonstrate the effectiveness of the proposed method.
BibTeX
@article{li2016block,
author = {Bing Nan Li and Qiang Yu and Rong Wang and Kui Xiang and Meng Wang and Xuelong Li},
title = {{Block Principal Component Analysis With Nongreedy ℓ1-Norm Maximization}},
journal = {IEEE Trans. Cybernetics},
year = {2016},
doi = {10.1109/tcyb.2015.2479645},
}Loading related content...