Constructing Sparse Kernel Machines Using Attractors

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

doi:10.1109/TNN.2009.2014059

アイテム詳細

登録内容を編集ファイル形式で保存

一時保存へ追加

このアイテムの新しいバージョンが利用可能です:
https://pure.mpg.de/pubman/item/item_1789394_2

詳細要約

公開

学術論文

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;

External Resource

There are no locators available

Fulltext (restricted access)

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

フルテキスト (公開)

公開されているフルテキストはありません

付随資料 (公開)

There is no public supplementary material available

引用

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.

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

要旨

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.