arrow
返回

Exactly Robust Kernel Principal Component Analysis

delete2020-03-01
delete37
delete
OA
AI
J
Jicong Fan
T
Tommy W. S. Chow *
DOI:10.1109/TNNLS.2019.2909686delete
delete原文链接
delete分享
delete收藏
查看原文
摘要

摘要

En 中文
Robust principal component analysis (RPCA) can recover low-rank matrices when they are corrupted by sparse noises. In practice, many matrices are, however, of high rank and, hence, cannot be recovered by RPCA. We propose a novel method called robust kernel principal component analysis (RKPCA) to decompose a partially corrupted matrix as a sparse matrix plus a high- or full-rank matrix with low latent dimensionality. RKPCA can be applied to many problems such as noise removal and subspace clustering and is still the only unsupervised nonlinear method robust to sparse noises. Our theoretical analysis shows that, with high probability, RKPCA can provide high recovery accuracy. The optimization of RKPCA involves nonconvex and indifferentiable problems. We propose two nonconvex optimization algorithms for RKPCA. They are alternating direction method of multipliers with backtracking line search and proximal linearized minimization with adaptive step size (AdSS). Comparative studies in noise removal and robust subspace clustering corroborate the effectiveness and the superiority of RKPCA.
Keyword:
Sparse matrices
Principal component analysis
Minimization
Kernel
Matrix decomposition
Feature extraction
Optimization
High rank
kernel
low rank
noise removal
robust principal component analysis (RPCA)
sparse
subspace clustering
AI总结

AI总结

对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。

期刊

IEEE Transactions on Neural Networks and Learning Systems 封面图
IEEE Transactions on Neural Networks and Learning Systems
IF:
8.9
论文数:
7.6K
被引数:
7.2W

机构

C
City University of Hong Kong
学者数:
2.3W
论文数: 3.0W
被引数: 6.1W
引用论文

引用论文

err分享
err收藏
err分享
err收藏
err分享
err收藏
ROBUST SUBSPACE CLUSTERING鲁棒子空间聚类
err2014-04-01
err262
errOAAI
errSoltanolkotabi, Mahdi; Elhamifar, Ehsan; Candes, Emmanuel J.
err分享
err收藏
学者 查看更多内容