Please use this identifier to cite or link to this item:
http://hdl.handle.net/123456789/6326
Title: | Using meta-heuristic algorithm in spiking neural network for pattern recognition tasks |
Authors: | Turkson, Regina Esi Liu, Sichao Baagyere, Edward Y. Eghan, Moses J. |
Keywords: | Spiking neural network Bat algorithm Meta-heuristic Pattern recognition |
Issue Date: | 2019 |
Publisher: | University of Cape Coast |
Abstract: | The Bat Algorithm (BA) is a meta-heuristic algorithm based on echolocation behavior of microbats. The authors propose BA based Spiking Neural Network (SNN) model, where the advantages of BA and efficiency of SNN are exploited for classification tasks using some benchmark datasets. The advantages of the BA have been well exploited in the Artificial Neural Networks (ANN) domain particularly with the adjustment of weights. We therefore, leveraged on the BA as a learning strategy to train an SNN using the Leaky Integrate and Fire (LIF) and Izhikevich models to solve non-linear pattern classification tasks. In order to successfully discriminate between the various classes, the models are trained to fire at the same or similar firing rate for inputs from the same class, and inputs patterns from different classes to also spike or fire at different rate. To justify how efficient and how powerful the proposed model is, only one neuron is used. Finally, the model is tested on different non-linear pattern recognition tasks and comparison is made between our model and other similar existing models and our proposed model outperformed some of the state-of-the-art-models. To the best of our knowledge, this is the first work to implement BA in SNN |
Description: | 7p:, ill. |
URI: | http://hdl.handle.net/123456789/6326 |
ISSN: | 23105496 |
Appears in Collections: | Department of Physics |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
USING META-HEURISTIC ALGORITHM IN SPIKING NEURAL NETWORK.pdf | Article | 3.28 MB | Adobe PDF | View/Open |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.