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

The DOI matches its Crossref record.

Exploration of very large databases by self-organizing maps

Kohonen, T. · 2002 · Proceedings of International Conference on Neural Networks (ICNN'97)

Abstract

This paper describes a data organization system and genuine content-addressable memory called the WEBSOM. It is a two-layer self-organizing map (SOM) architecture where documents become mapped as points on the upper map, in a geometric order that describes the similarity of their contents. By standard browsing tools one can select from the map subsets of documents that are most similar mutually. It is also possible to submit free-form queries about the wanted documents whereby the WEBSOM locates the best-matching documents. The document map exemplified in this paper has over 100000 map nodes, with 315 inputs at each, and over 1000000 documents have been organized by it. The system has been implemented by software on a general-purpose computer.

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/icnn.1997.611622

Cites

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

Cited by

See all 225

Metadata

Authors
Kohonen, T.
Venue
Proceedings of International Conference on Neural Networks (ICNN'97)
Publisher
IEEE
Published
2002-11-22
Volume
1
Pages
PL1-PL6
OpenAlex
W2104766360
Cited by
225
References
0
FWCI
6.25
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: Exploration of very large databases by self-organizing maps. https://app.cochat.ai/papers/10.1109/icnn.1997.611622
The paper
Kohonen, T. (2002). Exploration of very large databases by self-organizing maps. Proceedings of International Conference on Neural Networks (ICNN'97). https://doi.org/10.1109/icnn.1997.611622

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.