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

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

Self-organizing hierarchical feature maps

Koikkalainen, P., Oja, E. · 1990 · 1990 IJCNN International Joint Conference on Neural Networks

Abstract

The topological feature map (TFM) algorithm introduced by T. Kohenen (1982) implements two important properties: a vector quantization (VQ) and a topology-preserving mapping. A tree-structured TFM (TSTFM) is presented as a computationally inexpensive alternative to the TFM algorithm. The computational complexity of the TSTFM isO(logN) rather thanO(N) for the TFM. In addition, the TSTFM has some new properties that prove to be useful for VQ and in the context of visual perception: increased performance in VQ compared to the tree-structured VQ of A. Buzo et al. (1980) and hierarchical mapping of code vectors

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.1109/ijcnn.1990.137727

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.

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

Cited by

See all 224

Metadata

Authors
Koikkalainen, P., & Oja, E.
Venue
1990 IJCNN International Joint Conference on Neural Networks
Publisher
IEEE
Published
1990
Pages
279-284 vol.2
ISSN
2161-4407 (ISSN-L)
OpenAlex
W2000101855
Cited by
224
References
1
FWCI
0.76
Type
conference paper
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: Self-organizing hierarchical feature maps. https://app.cochat.ai/papers/10.1109/ijcnn.1990.137727
The paper
Koikkalainen, P., & Oja, E. (1990). Self-organizing hierarchical feature maps. 1990 IJCNN International Joint Conference on Neural Networks. https://doi.org/10.1109/ijcnn.1990.137727

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.