Growing Self Organizing Map with an Imposed Binary Search Tree for Discovering Temporal Input Patterns
Matharage, Sumith, Gunasinghe, Upuli and Alahakoon, Damminda 2009, Growing Self Organizing Map with an Imposed Binary Search Tree for Discovering Temporal Input Patterns, in Proceedings of the Fourth International Conference on Industrial and Information Systems (ICIIS); IEEE 2009, IEEE, Washington, DC, pp. 222-226, doi: 10.1109/ICIINFS.2009.5429862.
In this paper the Binary Search Tree Imposed Growing Self Organizing Map (BSTGSOM) is presented as an extended version of the Growing Self Organizing Map (GSOM), which has proven advantages in knowledge discovery applications. A Binary Search Tree imposed on the GSOM is mainly used to investigate the dynamic perspectives of the GSOM based on the inputs and these generated temporal patterns are stored to further analyze the behavior of the GSOM based on the input sequence. Also, the performance advantages are discussed and compared with that of the original GSOM.
Notes
This material is presented to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders. All persons copying this information are expected to adhere to the terms and constraints invoked by each author's copyright. In most cases, these works may not be reposted without the explicit permission of the copyright holder.
Unless expressly stated otherwise, the copyright for items in DRO is owned by the author, with all rights reserved.
Every reasonable effort has been made to ensure that permission has been obtained for items included in DRO.
If you believe that your rights have been infringed by this repository, please contact drosupport@deakin.edu.au.
Every reasonable effort has been made to ensure that permission has been obtained for items included in DRO. If you believe that your rights have been infringed by this repository, please contact drosupport@deakin.edu.au.