The DOI matches its Crossref record; 2 of the 2 references it cites were found in a registry or an index.
Competitive learning with floating-gate circuits
Abstract
Competitive learning is a general technique for training clustering and classification networks. We have developed an 11-transistor silicon circuit, that we term an automaximizing bump circuit, that uses silicon physics to naturally implement a similarity computation, local adaptation, simultaneous adaptation and computation and nonvolatile storage. This circuit is an ideal building block for constructing competitive-learning networks. We illustrate the adaptive nature of the automaximizing bump in two ways. First, we demonstrate a silicon competitive-learning circuit that clusters one-dimensional (1-D) data. We then illustrate a general architecture based on the automaximizing bump circuit; we show the effectiveness of this architecture, via software simulation, on a general clustering task. We corroborate our analysis with experimental data from circuits fabricated in a 0.35-mum CMOS process.
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
Neural Networks for Pattern Recognition
Bishop, C. M. (1995) · doi:10.1093/oso/9780198538493.001.0001 · Cited by 12,287
Winner-Take-All Networks of O(N) Complexity
Lazzaro, J., Ryckebusch, S., Mahowald, M. A., & Mead, C. A. (1988) · doi:10.21236/ada451466 · Cited by 582
Cited by
Mori, Y., Kudo, S.-E., Misawa, M., Saito, Y., Ikematsu, H., Hotta, K., Ohtsuka, K., Urushibara, F., Kataoka, S., Ogawa, Y., et al. (2018) · Annals of Internal Medicine · doi:10.7326/m18-0249 · Cited by 509
Widodo, A., Yang, B.-S., Kim, E. Y., Tan, A. C. C., & Mathew, J. (2009) · Nondestructive Testing and Evaluation · doi:10.1080/10589750802378974 · Cited by 58
Lee, K. H., Kung, S.-Y., & Verma, N. (2012) · Journal of Signal Processing Systems · doi:10.1007/s11265-012-0672-8 · Cited by 35
Metadata
- Authors
- Hsu, D., Figueroa, M., & Diorio, C.
- Venue
- IEEE Transactions on Neural Networks
- Published
- 2002-05
- Volume
- 13
- Issue
- 3
- Pages
- 732-744
- ISSN
- 1045-9227 (ISSN-L)
- OpenAlex
- W2124583192
- Cited by
- 379
- References
- 2
- FWCI
- 14.72
- 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: Competitive learning with floating-gate circuits. https://app.cochat.ai/papers/10.1109/tnn.2002.1000139
- The paper
- Hsu, D., Figueroa, M., & Diorio, C. (2002). Competitive learning with floating-gate circuits. IEEE Transactions on Neural Networks. https://doi.org/10.1109/tnn.2002.1000139
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.