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

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

CHAOTIC RESONANCE — METHODS AND APPLICATIONS FOR ROBUST CLASSIFICATION OF NOISY AND VARIABLE PATTERNS

KOZMA, ROBERT, FREEMAN, WALTER J. · 2001 · International Journal of Bifurcation and Chaos

Abstract

A fundamental tenet of the theory of deterministic chaos holds that infinitesimal variation in the initial conditions of a network that is operating in the basin of a low-dimensional chaotic attractor causes the various trajectories to diverge from each other quickly. This "sensitivity to initial conditions" might seem to hold promise for signal detection, owing to an implied capacity for distinguishing small differences in patterns. However, this sensitivity is incompatible with pattern classification, because it amplifies irrelevant differences in incomplete patterns belonging to the same class, and it renders the network easily corrupted by noise. Here a theory of stochastic chaos is developed, in which aperiodic outputs with 1/f 2 spectra are formed by the interaction of globally connected nodes that are individually governed by point attractors under perturbation by continuous white noise. The interaction leads to a high-dimensional global chaotic attractor that governs the entire array of nodes. An example is our spatially distributed KIII network that is derived from studies of the olfactory system, and that is stabilized by additive noise modeled on biological noise sources. Systematic parameterization of the interaction strengths corresponding to synaptic gains among nodes representing excitatory and inhibitory neuron populations enables the formation of a robust high-dimensional global chaotic attractor. Reinforcement learning from examples of patterns to be classified using habituation and association creates lower dimensional local basins, which form a global attractor landscape with one basin for each class. Thereafter, presentation of incomplete examples of a test pattern leads to confinement of the KIII network in the basin corresponding to that pattern, which constitutes many-to-one generalization. The capture after learning is expressed by a stereotypical spatial pattern of amplitude modulation of a chaotic carrier wave. Sensitivity to initial conditions is no longer an issue. Scaling of the additive noise as a parameter optimizes the classification of data sets in a manner that is comparable to stochastic resonance. The local basins constitute dynamical memories that solve difficult problems in classifying data sets that are not linearly separable. New local basins can be added quickly from very few examples without loss of existing basins. The attractor landscape enables the KIII set to provide an interface between noisy, unconstrained environments and conventional pattern classifiers. Examples given here of its robust performance include fault detection in small machine parts and the classification of spatiotemporal EEG patterns from rabbits trained to discriminate visual stimuli.

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.1142/s0218127401002870

Cites

1 of 1 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 1 references

Cited by

See all 206

Metadata

Authors
KOZMA, R., & FREEMAN, W. J.
Venue
International Journal of Bifurcation and Chaos
Published
2001-06
Volume
11
Issue
06
Pages
1607-1629
ISSN
  • 0218-1274 (ISSN-L)
  • 1793-6551
OpenAlex
W2130875964
Cited by
206
References
1
FWCI
11.37
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: CHAOTIC RESONANCE — METHODS AND APPLICATIONS FOR ROBUST CLASSIFICATION OF NOISY AND VARIABLE PATTERNS. https://app.cochat.ai/papers/10.1142/s0218127401002870
The paper
KOZMA, R., & FREEMAN, W. J. (2001). CHAOTIC RESONANCE — METHODS AND APPLICATIONS FOR ROBUST CLASSIFICATION OF NOISY AND VARIABLE PATTERNS. International Journal of Bifurcation and Chaos. https://doi.org/10.1142/s0218127401002870

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.