Abstract
Principal component analysis (PCA) minimizes the sum of squared errors (L 2-norm) and is sensitive to the presence of outliers. We propose a rotational invariant L 1-norm PCA (R 1-PCA). R 1-PCA is similar to PCA in that (1) it has a unique global solution, (2) the solution are principal eigenvectors of a robust covariance matrix (re-weighted to soften the effects of outliers), (3) the solution is rotational invariant. These properties are not shared by the Li-norm PCA. A new subspace iteration algorithm is given to compute R 1-PCA efficiently. Experiments on several real-life datasets show R 1-PCA can effectively handle outliers. We extend R 1-norm to K-means clustering and show that L 1-norm K-means leads to poor results while R 1-K-means outperforms standard K-means.
| Original language | English |
|---|---|
| Title of host publication | ICML 2006 - Proceedings of the 23rd International Conference on Machine Learning |
| Pages | 281-288 |
| Number of pages | 8 |
| State | Published - 2006 |
| Externally published | Yes |
| Event | ICML 2006: 23rd International Conference on Machine Learning - Pittsburgh, PA, United States Duration: 25 Jun 2006 → 29 Jun 2006 |
Publication series
| Name | ICML 2006 - Proceedings of the 23rd International Conference on Machine Learning |
|---|---|
| Volume | 2006 |
Conference
| Conference | ICML 2006: 23rd International Conference on Machine Learning |
|---|---|
| Country/Territory | United States |
| City | Pittsburgh, PA |
| Period | 25/06/06 → 29/06/06 |
Fingerprint
Dive into the research topics of 'R 1-PCA: Rotational invariant L 1-norm principal component analysis for robust subspace factorization'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver