Student or educator? Sign up with your school email and get 6 months of Pro free.
Cited by 912

The DOI matches its Crossref record; 137 of the 137 references it cites were found in a registry or an index.

Elements of Artificial Neural Networks

Mehrotra, Kishan, Mohan, Chilukuri, Ranka, Sanjay·1996·The MIT Press eBooks

Abstract

Elements of Artificial Neural Networks provides a clearly organized general introduction, focusing on a broad range of algorithms, for students and others who want to use neural networks rather than simply study them. The authors, who have been developing and team teaching the material in a one-semester course over the past six years, describe most of the basic neural network models (with several detailed solved examples) and discuss the rationale and advantages of the models, as well as their limitations. The approach is practical and open-minded and requires very little mathematical or technical background. Written from a computer science and statistics point of view, the text stresses links to contiguous fields and can easily serve as a first course for students in economics and management. The opening chapter sets the stage, presenting the basic concepts in a clear and objective way and tackling important—yet rarely addressed—questions related to the use of neural networks in practical situations. Subsequent chapters on supervised learning (single layer and multilayer networks), unsupervised learning, and associative models are structured around classes of problems to which networks can be applied. Applications are discussed along with the algorithms. A separate chapter takes up optimization methods. The most frequently used algorithms, such as backpropagation, are introduced early on, right after perceptrons, so that these can form the basis for initiating course projects. Algorithms published as late as 1995 are also included. All of the algorithms are presented using block-structured pseudo-code, and exercises are provided throughout. Software implementing many commonly used neural network algorithms is available at the book's website. Transparency masters, including abbreviated text and figures for the entire book, are available for instructors using the text. Bradford Books imprint

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.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.7551/mitpress/2687.001.0001

Cites

137 of 137 references verified0 citation errors · 0 not checkable

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.

A few free checks a day · papers already verified open instantly · results are public

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

Show all 137 references

Cited by

See all 912

Metadata

Authors
Mehrotra, K., Mohan, C., & Ranka, S.
Venue
The MIT Press eBooks
Publisher
The MIT Press
Published
1996-10-11
OpenAlex
W2093090592
Cited by
912
References
137
FWCI
3.85
Type
book
Language
en
Open access
closed

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: Elements of Artificial Neural Networks. https://app.cochat.ai/papers/10.7551/mitpress/2687.001.0001
The paper
Mehrotra, K., Mohan, C., & Ranka, S. (1996). Elements of Artificial Neural Networks. The MIT Press eBooks. https://doi.org/10.7551/mitpress/2687.001.0001

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.