Regaining sparsity in kernel principal components

doi:10.1016/j.neucom.2004.10.115

Regaining sparsity in kernel principal components

2005-08-01

4

PRE

AI

DOI：10.1016/j.neucom.2004.10.115

原文链接

原文求助

摘要

En 中文

Support Vector Machines are supervised regression and classification machines which have the nice property of automatically identifying which of the data points are most important in creating the machine. Kernel Principal Component Analysis (KPCA) is a related technique in that it also relies on linear operations in a feature space but does not have this ability to identify important points. Sparse KPCA goes too far in that it identifies a single data point as most important. We show how, by bagging the data, we may create a compromise which gives us a sparse but not grandmother representation for KPCA. (c) 2005 Elsevier B.V. All rights reserved.

Keyword:

sparseness

kernel methods

Regaining sparsity in kernel principal components

摘要

AI总结

期刊

机构

引用论文