Publication: Algorithms for obtaining parsimonious higher order neurons
Institution Authors
Authors
Journal Title
Journal ISSN
Volume Title
Type
Conference paper
Access
info:eu-repo/semantics/restrictedAccess
Publication Status
Published
Abstract
Most neurons in the central nervous system exhibit all-or-none firing behavior. This makes Boolean Functions (BFs) tractable candidates for representing computations performed by neurons, especially at finer time scales, even though BFs may fail to capture some of the richness of neuronal computations such as temporal dynamics. One biologically plausible way to realize BFs is to compute a weighted sum of products of inputs and pass it through a heaviside step function. This representation is called a Higher Order Neuron (HON). A HON can trivially represent any n-variable BF with 2n product terms. There have been several algorithms proposed for obtaining representations with fewer product terms. In this work, we propose improvements over previous algorithms for obtaining parsimonious HON representations and present numerical comparisons. In particular, we improve the algorithm proposed by Sezener and Oztop [1] and cut down its time complexity drastically, and develop a novel hybrid algorithm by combining metaheuristic search and the deterministic algorithm of Oztop.
Date
2017
Publisher
Springer International Publishing
Description
Due to copyright restrictions, the access to the full text of this article is only available via subscription.