Kernel Additive Principal Components
Additive principal components (APCs for short) are a nonlinear generalization of linear principal components. We focus on smallest APCs to describe additive nonlinear constraints that are approximately satisfied by the data. Thus APCs fit data with implicit equations that treat the variables symmetrically, as opposed to regression analyses which fit data with explicit equations that treat the data asymmetrically by singling out a response variable. We propose a regularized data-analytic procedure for APC estimation using kernel methods. In contrast to existing approaches to APCs that are based on regularization through subspace restriction, kernel methods achieve regularization through shrinkage and therefore grant distinctive flexibility in APC estimation by allowing the use of infinite-dimensional functions spaces for searching APC transformation while retaining computational feasibility. To connect population APCs and kernelized finite-sample APCs, we study kernelized population APCs and their associated eigenproblems, which eventually lead to the establishment of consistency of the estimated APCs. Lastly, we discuss an iterative algorithm for computing kernelized finite-sample APCs.
Code (0)
등록된 구현이 없습니다.
Similar Papers 제목 키워드 기반
Kernel principal component analysis network for image classification
In order to classify the nonlinear feature with linear classifier and improve the classification accuracy, a deep learning network named kernel principal component analysis network (KPCANet) is proposed. First, mapping t…
ClassificationFace RecognitionGeneral Classificationimage-classification+2Diagnosing ADHD from fMRI Scans Using Hidden Markov Models
This paper applies a hidden Markov model to the problem of Attention Deficit Hyperactivity Disorder (ADHD) diagnosis from resting-state functional Magnetic Resonance Image (fMRI) scans of subjects. The proposed model con…
Dimensionality ReductionA Kernel Random Matrix-Based Approach for Sparse PCA
In this paper, we present a random matrix approach to recover sparse principal components from n p-dimensional vectors. Specifically, considering the large dimensional setting where n, p → ∞ with p/n → c ∈ (0, ∞) and und…
Deep Kernel Principal Component Analysis for Multi-level Feature Learning
Principal Component Analysis (PCA) and its nonlinear extension Kernel PCA (KPCA) are widely used across science and industry for data analysis and dimensionality reduction. Modern deep learning tools have achieved great …
Dimensionality ReductionA Generalization of Principal Component Analysis
Conventional principal component analysis (PCA) finds a principal vector that maximizes the sum of second powers of principal components. We consider a generalized PCA that aims at maximizing the sum of an arbitrary conv…