.png){kind=icon}
返回
Function Approximation Using Combined Unsupervised and Supervised Learning
.png){kind=icon}
OA
AI
DOI：10.1109/TNNLS.2013.2276044.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Function approximation is one of the core tasks that are solved using neural networks in the context of many engineering problems. However, good approximation results need good sampling of the data space, which usually requires exponentially increasing volume of data as the dimensionality of the data increases. At the same time, often the high-dimensional data is arranged around a much lower dimensional manifold. Here we propose the breaking of the function approximation task for high-dimensional data into two steps: 1) the mapping of the high-dimensional data onto a lower dimensional space corresponding to the manifold on which the data resides and 2) the approximation of the function using the mapped lower dimensional data. We use over-complete self-organizing maps (SOMs) for the mapping through unsupervised learning, and single hidden layer neural networks for the function approximation through supervised learning. We also extend the two-step procedure by considering support vector machines and Bayesian SOMs for the determination of the best parameters for the nonlinear neurons in the hidden layer of the neural networks used for the function approximation. We compare the approximation performance of the proposed neural networks using a set of functions and show that indeed the neural networks using combined unsupervised and supervised learning outperform in most cases the neural networks that learn the function approximation using the original high-dimensional data.
Keyword:
Function approximation
learning
neural network
self-organizing map (SOM)
期刊
IF:
8.9
论文数:
7.5K
被引数:
7.2W
机构
暂无机构信息
引用论文
.png){kind=icon}
分享收藏分享收藏分享收藏分享收藏
查看更多内容