Properties and performance of orthogonal neural network in function approximation

✍ Scribed by Chieh F. Sher; Ching-Shiow Tseng; Chen-San Chen

• Publisher: John Wiley and Sons
• Year: 2001
• Tongue: English
• Weight: 216 KB
• Volume: 16
• Category: Article
• ISSN: 0884-8173
• DOI: 10.1002/int.1065

✦ Synopsis

Backpropagation neural network has been applied successfully to solving uncertain problems in many fields. However, unsolved drawbacks still exist such as the problems of local minimum, slow convergence speed, and the determination of initial weights and the number of processing elements. In this paper, we introduce a single-layer orthogonal Ž . neural network ONN that is developed based on orthogonal functions. Since the processing elements are orthogonal to one another and there is no local minimum of the error function, the orthogonal neural network is able to avoid the above problems. Among the five existing orthogonal functions, Legendre polynomials and Chebyshev polynomials of the first kind have the properties of recursion and completeness. They are the most suitable to generate the neural network. Some typical examples are given to show their performance in function approximation. The results show that ONN has excellent convergence performance. Moreover, ONN is capable of approximating the mathematic model of backpropagation neural network. Therefore, it should be able to be applied to various applications that backpropagation neural network is suitable to solve.