The minimum number of errors in the N-parity and its solution with an incremental neural network

DOI10.1023/A:1021726007566MaRDI QIDQ1857777zbMATH OpenWikidataFDO

Authors J. Manuel Torres-Moreno, Julio C. Aguilar, Mirta B. Gordon

Publication date 19 February 2003

Published in Neural Processing Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1023/A:1021726007566

zbMATH Keywords

classification tasksminimerrormonoplanparity problemperceptronssupervised learning

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Computing methodologies and applications (68U99)

Recommendations

• N-bit parity neural networks: new solutions based on linear programming
• Minimal feedforward parity networks using threshold gates
• The upper bound of the minimal number of hidden neurons for the parity problem in binary neural networks
• Unifying metric approach to the triple parity.
• scientific article; zbMATH DE number 4074522

Cited in

(3)

• N-bit parity neural networks: new solutions based on linear programming
• Unifying metric approach to the triple parity.
• The upper bound of the minimal number of hidden neurons for the parity problem in binary neural networks

This page was built for publication: The minimum number of errors in the \(N\)-parity and its solution with an incremental neural network

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1857777)