The construction of minimal multilayered perceptrons: A case study for sorting

DOI10.1016/0925-2312(93)90007-PzbMATH Open0782.68097OpenAlexW1990561828MaRDI QIDQ689481FDOQ689481

Authors: P. J. Zwietering, E. Aarts, J. Wessels 

Publication date: 20 December 1993

Published in: Neurocomputing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0925-2312(93)90007-p

Recommendations

• The minimal number of layers of perceptron that sorts
• Minimal perceptrons for memorizing complex patterns
• Capacity of the single-layer perceptron and minimal trajectory training algorithms
• Practical complexity control in multilayer perceptrons
• Minimax classifiers based on neural networks
• A neural sorting network with O(1) time complexity
• Searching for minimal optimal neural networks
• A neural network for the minimum set covering problem
• Bounds on the number of units for computing arbitrary dichotomies by multilayer perceptrons

zbMATH Keywords

sortingfeed-forward neural networksminimal multilayered perceptrons

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Analysis of algorithms and problem complexity (68Q25)

Cited In (4)

• Graph matching by stochastic optimisation applied to the implementation of multilayer perceptrons on transputer networks
• Neurons can sort data efficiently
• A neural sorting network with O(1) time complexity
• Metaheuristics: A bibliography

This page was built for publication: The construction of minimal multilayered perceptrons: A case study for sorting

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