Authors: Žunić, Joviša 
Affiliations: Mathematical Institute of the Serbian Academy of Sciences and Arts 
Title: On encoding and enumerating threshold functions
Journal: IEEE Transactions on Neural Networks
Volume: 15
Issue: 2
First page: 261
Last page: 267
Issue Date: 1-Jan-2004
Rank: M21a
ISSN: 1045-9227
DOI: 10.1109/TNN.2004.824419
In this paper, we deal with encoding and enumerating threshold functions defined on n-dimensional binary inputs. The paper specifies situations in which the unique characterization of functions from a given class is preserved by usage of an appropriate set of discrete moments. Moreover, sometimes such a characterization (coding) is optimal with respect to the number of necessary bit rate per coded function. By estimating the number of possible values of the discrete moments used, several upper bounds (for different classes of threshold functions) are derived, some of which are better than those previously known.
Keywords: Discrete moments | Encoding | Enumerating | Neural networks | Threshold functions
Publisher: IEEE

Show full item record


checked on Jun 23, 2024

Page view(s)

checked on May 9, 2024

Google ScholarTM




Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.