Neural Networks for Pattern Classification and Universal Approximation

Universal Approximation;Pattern Classification;Neural Networks

Liao, Yi ; Shu-Cherng Fang, Committee Chair,Henry L. W. Nuttle, Committee Co-Chair,Yuan-Shin Lee, Committee Member,Jesus Rodriguez, Committee Member,Liao, Yi ; Shu-Cherng Fang ; Committee Chair ; Henry L. W. Nuttle ; Committee Co-Chair ; Yuan-Shin Lee ; Committee Member ; Jesus Rodriguez ; Committee Member

University:North Carolina State University

关键词: Universal Approximation;    Pattern Classification;    Neural Networks;   

Others  :  https://repository.lib.ncsu.edu/bitstream/handle/1840.16/3946/etd.pdf?sequence=1&isAllowed=y

美国|英语

来源: null

【 摘 要 】

This dissertation studies neural networks for pattern classification and universal approximation. The objective is to develope a new neural network model for pattern classification, and relax the conditions for Radial-Basis Function networks to be universal approximators. First, the problem of pattern classification is introduced, which is followed by a brief introduction of three popular nonlinear classification techniques, that is, Multi-Layer Perceptrons (MLP), Radial-Basis Function (RBF) networks, and Support Vector Machines (SVM). Then, based on the basic concepts of MLP, RBF and SVM, a new neural network model with bounded weights is proposed, and some experimental results are reported. Later, the problem of universal approximation by neural networks is introduced, and the researches on ridge activation functions and radial-basis activation functions are reviewed. Then, the relaxed conditions for RBF networks to be universal approximators are presented. We show that RVF networks can uniformly approximate any continuous function on a compact set provided that the radial basis activation function is continuous almost every where, locally essentially bounded, and not a polynomial. Some experimental results are reported to illustrate our findings. The dissertation ends with the conclusion and future research.