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

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

Stochastic proximity embedding

Agrafiotis, Dimitris K.·2003·Journal of Computational Chemistry

Abstract

We introduce stochastic proximity embedding (SPE), a novel self‐organizing algorithm for producing meaningful underlying dimensions from proximity data. SPE attempts to generate low‐dimensional Euclidean embeddings that best preserve the similarities between a set of related observations. The method starts with an initial configuration, and iteratively refines it by repeatedly selecting pairs of objects at random, and adjusting their coordinates so that their distances on the map match more closely their respective proximities. The magnitude of these adjustments is controlled by a learning rate parameter, which decreases during the course of the simulation to avoid oscillatory behavior. Unlike classical multidimensional scaling (MDS) and nonlinear mapping (NLM), SPE scales linearly with respect to sample size, and can be applied to very large data sets that are intractable by conventional embedding procedures. The method is programmatically simple, robust, and convergent, and can be applied to a wide range of scientific problems involving exploratory data analysis and visualization. © 2003 Wiley Periodicals, Inc. J Comput Chem 24: 1215–1221, 2003

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.1002/jcc.10234

Cites

2 of 2 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

Show all 2 references

Cited by

See all 175

Metadata

Authors
Agrafiotis, D. K.
Venue
Journal of Computational Chemistry
Publisher
Wiley
Published
2003-06-09
Volume
24
Issue
10
Pages
1215-1221
ISSN
  • 0192-8651 (ISSN-L)
  • 1096-987X
OpenAlex
W2134738108
Cited by
175
References
2
FWCI
4.01
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: Stochastic proximity embedding. https://app.cochat.ai/papers/10.1002/jcc.10234
The paper
Agrafiotis, D. K. (2003). Stochastic proximity embedding. Journal of Computational Chemistry. https://doi.org/10.1002/jcc.10234

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.