Sparse kernel subspace method for classifying and representing patterns from data with complex structure

DOI10.1080/03610918.2019.1620271MaRDI QIDQ5082767zbMATH OpenOpenAlexFDO

Authors Heewon Park, Sadanori Konishi

Publication date 21 June 2022

Published in Communications in Statistics. Simulation and Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1080/03610918.2019.1620271

zbMATH Keywords

sparse PCAnonlinear transformationsubspace methodCLAFIC methodL1-type regularization

Mathematics Subject Classification ID

Factor analysis and principal components; correspondence analysis (62H25) Classification and discrimination; cluster analysis (statistical aspects) (62H30)

Recommendations

• On using prototype reduction schemes to optimize kernel-based nonlinear subspace methods.
• scientific article; zbMATH DE number 1954137
• Advances in Neural Networks – ISNN 2005
• Nyström-based approximate kernel subspace learning
• Feature space locality constraint for kernel based nonlinear discriminant analysis

Cites work

• scientific article; zbMATH DE number 2118472 (Why is no real title available?)
• scientific article; zbMATH DE number 6303738 (Why is no real title available?)
• scientific article; zbMATH DE number 3327941 (Why is no real title available?)
• A comparative analysis of kernel subspace target detectors for hyperspectral imagery
• Kernel methods in machine learning
• Regularization and Variable Selection Via the Elastic Net

Cited in

(2)

• scientific article; zbMATH DE number 1954137 (Why is no real title available?)
• Nonlinear skeletons of data sets and applications -- methods based on subspace clustering

Describes a project that uses

Uses Software

• Kernlab

This page was built for publication: Sparse kernel subspace method for classifying and representing patterns from data with complex structure

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5082767)