Swann, A. and Allinson, N. (1998) Fast committee learning: preliminary results. Electronics Letters, 34 (14). pp. 1408-1410. ISSN 1013-5194
Full content URL: http://dx.doi.org/10.1049/el:19981000
| Documents |
| ||||
![[img]](http://eprints.lincoln.ac.uk/style/images/fileicons/application_pdf.png) |
PDF
00706104.pdf - Whole Document Restricted to Repository staff only 456kB |
| Item Type: | Article |
|---|---|
| Item Status: | Live Archive |
Abstract
Fast committee leaming can, to some extent, achieve the
generalisation advantages of a committee of neural networks,
without the need for independent leaming of the committee
members. This is achieved by selecting committee members from time-slices of the learning trajectory of one neural nctwork.
| Additional Information: | Fast committee leaming can, to some extent, achieve the generalisation advantages of a committee of neural networks, without the need for independent leaming of the committee members. This is achieved by selecting committee members from time-slices of the learning trajectory of one neural nctwork. |
|---|---|
| Keywords: | algorithm, neural networks, fast committee learning, learning trajectory |
| Subjects: | G Mathematical and Computer Sciences > G730 Neural Computing |
| Divisions: | College of Science > School of Computer Science |
| ID Code: | 5090 |
| Deposited On: | 23 Apr 2012 11:08 |
Repository Staff Only: item control page