A concise overview of principal support vector machines and its generalization

A concise overview of principal support vector machines and its generalization
Citations

SCOPUS

1

초록

In high-dimensional data analysis, sufficient dimension reduction (SDR) has been considered as an attractive tool for reducing the dimensionality of predictors while preserving regression information. The principal support vector machine (PSVM) (Li et al., 2011) offers a unified approach for both linear and nonlinear SDR. This article comprehensively explores a variety of SDR methods based on the PSVM, which we call principal machines (PM) for SDR. The PM achieves SDR by solving a sequence of convex optimizations akin to popular supervised learning methods, such as the support vector machine, logistic regression, and quantile regression, to name a few. This makes the PM straightforward to handle and extend in both theoretical and computational aspects, as we will see throughout this article.

키워드

sufficient dimension reduction; principal support vector machine; principal machine; M-estimation; convex optimization
제목
A concise overview of principal support vector machines and its generalization
제목 (타언어)
A concise overview of principal support vector machines and its generalization
저자
Shin Jungmin; Shin Seung Jun
DOI
10.29220/CSAM.2024.31.2.235
발행일
2024-04
저널명
Communications for Statistical Applications and Methods
권
31
호
2
페이지
235 ~ 246