Learning and development in Kohonen-style self organising maps.
This thesis presents a biologically inspired model of learning and development. This model decomposes the lifetime of a single learning system into a number of stages, analogous to the infant, juvenile, adolescent and adult stages of development in a biological system. This model is then applied to...
| Main Author: | |
|---|---|
| Format: | Thesis |
| Language: | English |
| Published: |
Curtin University
2001
|
| Subjects: | |
| Online Access: | http://hdl.handle.net/20.500.11937/162 |
| _version_ | 1848743301040046080 |
|---|---|
| author | Keith-Magee, Russell |
| author_facet | Keith-Magee, Russell |
| author_sort | Keith-Magee, Russell |
| building | Curtin Institutional Repository |
| collection | Online Access |
| description | This thesis presents a biologically inspired model of learning and development. This model decomposes the lifetime of a single learning system into a number of stages, analogous to the infant, juvenile, adolescent and adult stages of development in a biological system. This model is then applied to Kohonen's SOM algorithm.In order to better understand the operation of Kohonen's SOM algorithm, a theoretical analysis of self-organisation is performed. This analysis establishes the role played by lateral connections in organisation, and the significance of the Laplacian lateral connections common to many SOM architectures.This analysis of neighbourhood interactions is then used to develop three key variations on Kohonen's SOM algorithm. Firstly, a new scheme for parameter decay, known as Butterworth Step Decay, is presented. This decay scheme provides training times comparable to the best training times possible using traditional linear decay, but precludes the need for a priori knowledge of likely training times. In addition, this decay scheme allows Kohonen's SOM to learn in a continuous manner.Secondly, a method is presented for establishing core knowledge in the fundamental representation of a SOM. This technique is known as Syllabus Presentation. This technique involves using a selected training syllabus to reinforce knowledge known to be significant. A method for developing a training syllabus, known as Percept Masking, is also presented.Thirdly, a method is presented for preventing the loss of trained representations in a continuously learning SOM. This technique, known as Arbor Pruning, involves restricting the weight update process to prevent the loss of significant representations. This technique can be used if the data domain varies within a known set of dimensions. However, it cannot be used to control forgetfulness if dimensions are added to or removed from the data domain. |
| first_indexed | 2025-11-14T05:43:23Z |
| format | Thesis |
| id | curtin-20.500.11937-162 |
| institution | Curtin University Malaysia |
| institution_category | Local University |
| language | English |
| last_indexed | 2025-11-14T05:43:23Z |
| publishDate | 2001 |
| publisher | Curtin University |
| recordtype | eprints |
| repository_type | Digital Repository |
| spelling | curtin-20.500.11937-1622017-02-20T06:40:17Z Learning and development in Kohonen-style self organising maps. Keith-Magee, Russell Kohonen's Self-Organising Map algorithm learning models development models This thesis presents a biologically inspired model of learning and development. This model decomposes the lifetime of a single learning system into a number of stages, analogous to the infant, juvenile, adolescent and adult stages of development in a biological system. This model is then applied to Kohonen's SOM algorithm.In order to better understand the operation of Kohonen's SOM algorithm, a theoretical analysis of self-organisation is performed. This analysis establishes the role played by lateral connections in organisation, and the significance of the Laplacian lateral connections common to many SOM architectures.This analysis of neighbourhood interactions is then used to develop three key variations on Kohonen's SOM algorithm. Firstly, a new scheme for parameter decay, known as Butterworth Step Decay, is presented. This decay scheme provides training times comparable to the best training times possible using traditional linear decay, but precludes the need for a priori knowledge of likely training times. In addition, this decay scheme allows Kohonen's SOM to learn in a continuous manner.Secondly, a method is presented for establishing core knowledge in the fundamental representation of a SOM. This technique is known as Syllabus Presentation. This technique involves using a selected training syllabus to reinforce knowledge known to be significant. A method for developing a training syllabus, known as Percept Masking, is also presented.Thirdly, a method is presented for preventing the loss of trained representations in a continuously learning SOM. This technique, known as Arbor Pruning, involves restricting the weight update process to prevent the loss of significant representations. This technique can be used if the data domain varies within a known set of dimensions. However, it cannot be used to control forgetfulness if dimensions are added to or removed from the data domain. 2001 Thesis http://hdl.handle.net/20.500.11937/162 en Curtin University fulltext |
| spellingShingle | Kohonen's Self-Organising Map algorithm learning models development models Keith-Magee, Russell Learning and development in Kohonen-style self organising maps. |
| title | Learning and development in Kohonen-style self organising maps. |
| title_full | Learning and development in Kohonen-style self organising maps. |
| title_fullStr | Learning and development in Kohonen-style self organising maps. |
| title_full_unstemmed | Learning and development in Kohonen-style self organising maps. |
| title_short | Learning and development in Kohonen-style self organising maps. |
| title_sort | learning and development in kohonen-style self organising maps. |
| topic | Kohonen's Self-Organising Map algorithm learning models development models |
| url | http://hdl.handle.net/20.500.11937/162 |