Constructing Sparse Kernel Machines Using Attractors

Lee, D; Jung, K-H; Lee, J

doi:10.1109/TNN.2009.2014059

Item

ITEM ACTIONSEXPORT

Add to Basket

Local TagsRelease HistoryDetailsSummary

Released

Journal Article

Constructing Sparse Kernel Machines Using Attractors

MPS-Authors

/persons/resource/persons84040

Lee, D
Department Empirical Inference, Max Planck Institute for Biological Cybernetics, Max Planck Society;
Max Planck Institute for Biological Cybernetics, Max Planck Society;

External Resource

https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=4796253
(Publisher version)

Fulltext (restricted access)

There are currently no full texts shared for your IP range.

Fulltext (public)

There are no public fulltexts stored in PuRe

Supplementary Material (public)

There is no public supplementary material available

Citation

Lee, D., Jung, K.-H., & Lee, J. (2009). Constructing Sparse Kernel Machines Using Attractors. IEEE Transactions on Neural Networks, 20(4), 721-729. doi:10.1109/TNN.2009.2014059.

Cite as: https://hdl.handle.net/11858/00-001M-0000-0013-C51D-1

Abstract

In this brief, a novel method that constructs a sparse kernel machine is proposed. The proposed method generates attractors as sparse solutions from a built-in kernel machine via a dynamical system framework. By readjusting the corresponding coefficients and bias terms, a sparse kernel machine that approximates a conventional kernel machine is constructed. The simulation results show that the constructed sparse kernel machine improves the efficiency of testing phase while maintaining comparable test error.