Open AccessSpiking neural network approaches PCA with metaheuristics
Author(s) -
EnríquezGaytán J.,
GómezCastañeda F.,
FloresNava L.M.,
MorenoCadenas J.A.
Publication year - 2020
Publication title -
electronics letters
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.375
H-Index - 146
eISSN - 1350-911X
pISSN - 0013-5194
DOI - 10.1049/el.2020.0283
Subject(s) - principal component analysis , computer science , spiking neural network , artificial neural network , artificial intelligence , dimensionality reduction , pattern recognition (psychology) , benchmarking , benchmark (surveying) , algorithm , geodesy , marketing , business , geography
This Letter presents meaningful results that demonstrate the reduction of dimensionality by spiking neural networks (SNNs) on benchmarking data. This experimental scheme includes metaheuristics, namely, the artificial bee colony algorithm (ABC algorithm) for finding optimal conductance values in the SNNs. Therefore, the objective function in the used ABC algorithm leads the SNNs to compute the principal component analysis (PCA), efficiently. The eigendecomposition of the information drawn by the SNNs in the training phase is the base of the formulated objective function. In these experiments, the Izhikevich model represents the spiking neurons, which have biological plausibility with parameters for reproducing a uniform firing rate. The visualisation of clusters in the 3D PCA space, whose sample values are compared with the PCA function in Matlab, is also shown; this comparison demonstrates an acceptable error in the MSE sense.