The upper bound of the minimal number of hidden neurons for the parity problem in binary neural networks (Q439836)

From MaRDI portal
scientific article
Language Label Description Also known as
English
The upper bound of the minimal number of hidden neurons for the parity problem in binary neural networks
scientific article

    Statements

    The upper bound of the minimal number of hidden neurons for the parity problem in binary neural networks (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    17 August 2012
    0 references
    binary neural network
    0 references
    restraining neuron
    0 references
    \(n\)-bit parity problem
    0 references
    Hamming sphere
    0 references
    SP function
    0 references

    Identifiers