跳到主要导航 跳到搜索 跳到主要内容

R1-PCA: Rotational invariant L1-norm principal component analysis for robust subspace factorization

  • Chris Ding*
  • , Ding Zhou
  • , Xiaofeng He
  • , Hongyuan Zha
  • *此作品的通讯作者
  • Lawrence Berkeley National Laboratory
  • Pennsylvania State University

科研成果: 书/报告/会议事项章节会议稿件同行评审

摘要

Principal component analysis (PCA) minimizes the sum of squared errors (L2-norm) and is sensitive to the presence of outliers. We propose a rotational invariant Li-norm PCA (R1-PCA). R1-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 L1-norm PCA. A new subspace iteration algorithm is given to compute R1-PCA efficiently. Experiments on several real-life datasets show R1-PCA can effectively handle outliers. We extend R1-norm to K-means clustering and show that L1-norm K-means leads to poor results while R 1-K-means outperforms standard K-means.

源语言英语
主期刊名ACM International Conference Proceeding Series - Proceedings of the 23rd International Conference on Machine Learning, ICML 2006
281-288
页数8
DOI
出版状态已出版 - 2006
已对外发布
活动23rd International Conference on Machine Learning, ICML 2006 - Pittsburgh, PA, 美国
期限: 25 6月 200629 6月 2006

丛书

姓名ACM International Conference Proceeding Series
148

会议

会议23rd International Conference on Machine Learning, ICML 2006
国家/地区美国
Pittsburgh, PA
时期25/06/0629/06/06

学术指纹

探究 'R1-PCA: Rotational invariant L1-norm principal component analysis for robust subspace factorization' 的科研主题。它们共同构成独一无二的学术指纹。

引用此