Ling, Wing-Kuen, Ho, Charlotte Yuk-Fan, Lam, Hak-Keung and Nasir, Muhammad (2007) Boundedness of weighted coefficients of perceptron learning algorithm and global convergence of fixed point and limit cycle behaviors. In: International Symposium on Nonlinear Science and Application, June 2007, Shanghai.
| Documents |
| ||||
![[img]](http://eprints.lincoln.ac.uk/style/images/fileicons/application_pdf.png) |
PDF
conference_chao_perceptron.pdf - Whole Document Restricted to Repository staff only 147kB |
| Item Type: | Conference or Workshop contribution (Paper) |
|---|---|
| Item Status: | Live Archive |
Abstract
In this paper, a condition for the boundedness of weighted coefficients of the perceptron with arbitrary initial weights and an arbitrary set of bounded training feature vectors is given and proved. Based on this derived condition, conditions for the global convergence of the output of the perceptron with a set of nonlinearly separable bounded training feature vectors to limit cycles are given and proved, and the maximum number of updates of the weighted coefficients of the perceptron before the output of the perceptron reaches the limit cycles is given. Finally, the perceptron with periodically time varying weighted coefficients is investigated. An optimization approach is proposed for the design of this perceptron. Numerical computer simulation results show that the perceptron with periodically time varying weighted coefficients could achieve better recognition performances compared to that with only one set of weighted coefficients.
| Additional Information: | In this paper, a condition for the boundedness of weighted coefficients of the perceptron with arbitrary initial weights and an arbitrary set of bounded training feature vectors is given and proved. Based on this derived condition, conditions for the global convergence of the output of the perceptron with a set of nonlinearly separable bounded training feature vectors to limit cycles are given and proved, and the maximum number of updates of the weighted coefficients of the perceptron before the output of the perceptron reaches the limit cycles is given. Finally, the perceptron with periodically time varying weighted coefficients is investigated. An optimization approach is proposed for the design of this perceptron. Numerical computer simulation results show that the perceptron with periodically time varying weighted coefficients could achieve better recognition performances compared to that with only one set of weighted coefficients. |
|---|---|
| Keywords: | Perceptron learning algorithm, boundedness, fixed point, limit cycle, global convergence |
| Subjects: | H Engineering > H310 Dynamics |
| Divisions: | College of Science > School of Engineering |
| ID Code: | 3094 |
| Deposited On: | 06 Aug 2010 12:49 |
Repository Staff Only: item control page