2015
DOI: 10.1016/j.asoc.2015.06.062
|View full text |Cite
|
Sign up to set email alerts
|

A sequential learning algorithm for a spiking neural classifier

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1

Citation Types

0
4
0

Year Published

2016
2016
2020
2020

Publication Types

Select...
5
2

Relationship

0
7

Authors

Journals

citations
Cited by 13 publications
(4 citation statements)
references
References 50 publications
(80 reference statements)
0
4
0
Order By: Relevance
“…If ( t ≠ c t or E t ≥ β a ) and  c (x t ) ≤ β c , then allocate a new hidden neurons in the cognitive component. The width and center of newly added hidden neuron are determined based on the intra and inter class distances of nearest neurons using (18), (19), (20) and (21). The…”
Section: B Neuron Growth Strategymentioning
confidence: 99%
“…If ( t ≠ c t or E t ≥ β a ) and  c (x t ) ≤ β c , then allocate a new hidden neurons in the cognitive component. The width and center of newly added hidden neuron are determined based on the intra and inter class distances of nearest neurons using (18), (19), (20) and (21). The…”
Section: B Neuron Growth Strategymentioning
confidence: 99%
“…Broadly, the existing spiking neural network learning algorithms for pattern classification problems can be classified into three major categories, namely, the gradient-descent based learning algorithms [4,14], the rank order based learning algorithms [19,10,37,8,18] and the Spike Timing Dependent Plasticity (STDP) [23,7] based algorithms [25,30,35,34].…”
Section: Related Workmentioning
confidence: 99%
“…Rank order coding [28] is another coding strategy that encodes information using the order of the spikes. Due to the ability of rank order coding for faster information transmission [33] several learning algorithms have been developed for SNNs using rank order coding [19,9,10]. It is a non-local encoding technique, but it allows the network to learn the knowledge present in the spike patterns in one-shot.…”
Section: Related Workmentioning
confidence: 99%
“…The important challenge that still needs to be addressed is the feasibility in hardware implementation of these algorithms into algorithms, circuits, devices and systems, based on the nature of the primary contribution. The reader can view this figure in the supplementary material (Additional file 1) provided with the manuscript to click on the hyperlinks and navigate to the corresponding reference in the bibliography section [141][142][143][144][145][146][147] and approaches, that is eventually critical for realizing practical applications, such as on embedded platforms. The storage and computational capacity available on such platforms is limited, hence the algorithms need to have a low computational complexity, that translates to low-power requirements in hardware.…”
Section: Algorithmsmentioning
confidence: 99%