Efficient unsupervised training algorithm for self-organizing networks
Abstract
We develop a very efficient training algorithm for self-organizing networks (SON) which have run times that are linear with both the number of desired output vectors and training set vectors, respectively. The algorithm is very efficient compared with older ones which have run-times that are quadratic (~N2) with the number of desired output vectors. Run-times for both cases were predicted from models derived from the algorithms and were also confirmed by actual programs.
Downloads
Published
Issue
Section
License
By submitting their manuscript to the Samahang Pisika ng Pilipinas (SPP) for consideration, the Authors warrant that their work is original, does not infringe on existing copyrights, and is not under active consideration for publication elsewhere.
Upon acceptance of their manuscript, the Authors further agree to grant SPP the non-exclusive, worldwide, and royalty-free rights to record, edit, copy, reproduce, publish, distribute, and use all or part of the manuscript for any purpose, in any media now existing or developed in the future, either individually or as part of a collection.
All other associated economic and moral rights as granted by the Intellectual Property Code of the Philippines are maintained by the Authors.
