Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2506.16013 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866915350718709760 |
|---|---|
| author | Ouermi, Timbwaoga Aime Judicael Li, Jixian Johnson, Chris R. |
| author_facet | Ouermi, Timbwaoga Aime Judicael Li, Jixian Johnson, Chris R. |
| contents | Principal Component Analysis (PCA) is widely used for dimensionality reduction and data analysis. However, PCA results are adversely affected by outliers often observed in real-world data. Existing robust PCA methods are often computationally expensive or exhibit limited robustness. In this work, we introduce a Fast Iterative Robust (FIR) PCA method by efficiently estimating the inliers center location and covariance. Our approach leverages Incremental PCA (IPCA) to iteratively construct a subset of data points that ensures improved location and covariance estimation that effectively mitigates the influence of outliers on PCA projection. We demonstrate that our method achieves competitive accuracy and performance compared to existing robust location and covariance methods while offering improved robustness to outlier contamination. We utilize simulated and real-world datasets to evaluate and demonstrate the efficacy of our approach in identifying and preserving underlying data structures in the presence of contamination. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2506_16013 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | A Fast Iterative Robust Principal Component Analysis Method Ouermi, Timbwaoga Aime Judicael Li, Jixian Johnson, Chris R. Computational Engineering, Finance, and Science Statistics Theory Principal Component Analysis (PCA) is widely used for dimensionality reduction and data analysis. However, PCA results are adversely affected by outliers often observed in real-world data. Existing robust PCA methods are often computationally expensive or exhibit limited robustness. In this work, we introduce a Fast Iterative Robust (FIR) PCA method by efficiently estimating the inliers center location and covariance. Our approach leverages Incremental PCA (IPCA) to iteratively construct a subset of data points that ensures improved location and covariance estimation that effectively mitigates the influence of outliers on PCA projection. We demonstrate that our method achieves competitive accuracy and performance compared to existing robust location and covariance methods while offering improved robustness to outlier contamination. We utilize simulated and real-world datasets to evaluate and demonstrate the efficacy of our approach in identifying and preserving underlying data structures in the presence of contamination. |
| title | A Fast Iterative Robust Principal Component Analysis Method |
| topic | Computational Engineering, Finance, and Science Statistics Theory |
| url | https://arxiv.org/abs/2506.16013 |