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

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

Learning Understandable Neural Networks With Nonnegative Weight Constraints

Chorowski, Jan, Zurada, Jacek M. · 2015 · IEEE Transactions on Neural Networks and Learning Systems

Abstract

People can understand complex structures if they relate to more isolated yet understandable concepts. Despite this fact, popular pattern recognition tools, such as decision tree or production rule learners, produce only flat models which do not build intermediate data representations. On the other hand, neural networks typically learn hierarchical but opaque models. We show how constraining neurons' weights to be nonnegative improves the interpretability of a network's operation. We analyze the proposed method on large data sets: the MNIST digit recognition data and the Reuters text categorization data. The patterns learned by traditional and constrained network are contrasted to those learned with principal component analysis and nonnegative matrix factorization.

Overview

The claims and statistics of this paper haven’t been checked yet.

Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.

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

Integrity signals

Registry

Crossref · 10.1109/tnnls.2014.2310059

Cites

6 of 6 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.

Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.

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 6 references

Cited by

See all 161

Metadata

Authors
Chorowski, J., & Zurada, J. M.
Venue
IEEE Transactions on Neural Networks and Learning Systems
Published
2015-01
Volume
26
Issue
1
Pages
62-69
ISSN
  • 2162-237X (ISSN-L)
  • 2162-2388
OpenAlex
W2093522043
Cited by
161
References
6
FWCI
8.91
Type
journal article
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: Learning Understandable Neural Networks With Nonnegative Weight Constraints. https://app.cochat.ai/papers/10.1109/tnnls.2014.2310059
The paper
Chorowski, J., & Zurada, J. M. (2015). Learning Understandable Neural Networks With Nonnegative Weight Constraints. IEEE Transactions on Neural Networks and Learning Systems. https://doi.org/10.1109/tnnls.2014.2310059

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.