The DOI matches its Crossref record; 9 of the 9 references it cites were found in a registry or an index.
Learning in feedforward layered networks: the tiling algorithm
Open accessAbstract
The authors propose a new algorithm which builds a feedforward layered network in order to learn any Boolean function of N Boolean units. The number of layers and the number of hidden units in each layer are not prescribed in advance: they are outputs of the algorithm. It is an algorithm for growth of the network, which adds layers, and units inside a layer, at will until convergence. The convergence is guaranteed and numerical tests of this strategy look promising.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Learning internal representations by error propagation
RUMELHART, D. E., HINTON, G. E., & WILLIAMS, R. J. (1988) · Readings in Cognitive Science · doi:10.1016/b978-1-4832-1446-7.50035-2 · Cited by 3,002
Beyond Regression : "New Tools for Prediction and Analysis in the Behavioral Sciences
Werbos, P. J. (1974) · Medical Entomology and Zoology · Cited by 2,789
Mullin, A. A., & Rosenblatt, F. (1963) · The American Mathematical Monthly · doi:10.2307/2312103 · Cited by 2,209
Parallel Networks that Learn to Pronounce English Text
B, T. J. S. A. (1987) · Cited by 1,514
Monte Carlo Methods in Statistical Physics
(1979) · Topics in Current Physics · doi:10.1007/978-3-642-96483-1 · Cited by 1,219
Monte Carlo Methods in Statistical Physics
(1986) · Topics in Current Physics · doi:10.1007/978-3-642-82803-4 · Cited by 1,058
Learning algorithms with optimal stability in neural networks
Krauth, W., & Mezard, M. (1987) · Journal of Physics A: Mathematical and General · doi:10.1088/0305-4470/20/11/013 · Cited by 415
Self-citationLarge Automatic Learning, Rule Extraction, and Generalization.
Denker, J. S., Schwartz, D., Wittner, B. S., Solla, S. A., Howard, R. E., Jackel, L. D., & Hopfield, J. J. (1987) · Complex Systems · Cited by 248
Exhaustive Thermodynamical Analysis of Boolean Learning Networks
Carnevali, P., & Patarnello, S. (1987) · Europhysics Letters (EPL) · doi:10.1209/0295-5075/4/10/020 · Cited by 99
Cited by
Data mining: concepts and techniques
(2012) · Choice Reviews Online · doi:10.5860/choice.49-3305 · Cited by 28,531
Elements of Artificial Neural Networks
Mehrotra, K., Mohan, C., & Ranka, S. (1996) · The MIT Press eBooks · doi:10.7551/mitpress/2687.001.0001 · Cited by 912
Single-layer learning revisited: a stepwise procedure for building and training a neural network
Knerr, S., Personnaz, L., & Dreyfus, G. (1990) · Neurocomputing · doi:10.1007/978-3-642-76153-9_5 · Cited by 828
Perceptron-based learning algorithms
Gallant, S. I. (1990) · IEEE Transactions on Neural Networks · doi:10.1109/72.80230 · Cited by 558
The statistical mechanics of learning a rule
Watkin, T. L. H., Rau, A., & Biehl, M. (1993) · Reviews of Modern Physics · doi:10.1103/revmodphys.65.499 · Cited by 471
Metadata
- Authors
- Mezard, M., & Nadal, J.-P.
- Venue
- Journal of Physics A: Mathematical and General
- Publisher
- IOP Publishing
- Published
- 1989-06-21
- Volume
- 22
- Issue
- 12
- Pages
- 2191-2203
- ISSN
- 0305-4470 (ISSN-L)
- 1361-6447
- OpenAlex
- W2009784977
- Cited by
- 426
- References
- 9
- FWCI
- 30.65
- Type
- journal article
- Language
- en
- Open access
- bronze
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Learning in feedforward layered networks: the tiling algorithm. https://app.cochat.ai/papers/10.1088/0305-4470/22/12/019
- The paper
- Mezard, M., & Nadal, J.-P. (1989). Learning in feedforward layered networks: the tiling algorithm. Journal of Physics A: Mathematical and General. https://doi.org/10.1088/0305-4470/22/12/019
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.