Text

Intrinsic Grassmann Averages for Online Linear, Robust and Nonlinear Subspace Learning

Principal component analysis (PCA) and Kernel principal component analysis (KPCA) are fundamental methods in machine learning for dimensionality reduction. The former is a technique for finding this approximation in finite dimensions and the latter is often in an infinite dimensional reproducing Kernel Hilbert-space (RKHS). In this paper, we present a geometric framework for computing the principal linear subspaces in both (finite and infinite) situations as well as for the robust PCA case, that amounts to computing the intrinsic average on the space of all subspaces: the Grassmann manifold. Points on this manifold are defined as the subspaces spanned by K -tuples of observations. The intrinsic Grassmann average of these subspaces are shown to coincide with the principal components of the observations when they are drawn from a Gaussian distribution. We show similar results in the RKHS case and provide an efficient algorithm for computing the projection onto the this average subspace. The result is a method akin to KPCA which is substantially faster. Further, we present a novel online version of the KPCA using our geometric framework. Competitive performance of all our algorithms are demonstrated on a variety of real and synthetic data sets.

Ketersediaan

Informasi Detail

Judul Seri

IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE; Vol.43 No.11 November 2021

No. Panggil

-

Penerbit

: .,

Deskripsi Fisik

p. 3904-3917

Bahasa

English

ISBN/ISSN

-

Klasifikasi

NONE

Tipe Isi

-

Tipe Media

-

Tipe Pembawa

-

Edisi

-

Subjek

PCA
ROBUST
GRASSMAN MANIFOLD
FRECHET MEAN
ONLINE SUBSPACE LEARNING
KERNEL PCA
FRECHET MEDIAN

Info Detail Spesifik

10.1109/TPAMI.2020.2992392

Pernyataan Tanggungjawab

Rudrasis Chakraborty, Liu Yang, Soren Hauberg, Baba C. Vemuri

Versi lain/terkait

Lampiran Berkas

Komentar