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

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

Fast Outlier Detection in High Dimensional Spaces

Angiulli, Fabrizio, Pizzuti, Clara·2002·Lecture Notes in Computer Science

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.1007/3-540-45681-3_2

Cites

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

Research works printed but not linked: 5

  1. C. Faloutsos and S. Roseman. Fractals for secondary key retrieval. In Proc. ACM Int. Conf. on Principles of Database Systems (PODS’89), pages 247–252, 1989. · doi:10.1145/73721.73746
  2. H. V. Jagadish. Linear clustering of objects with multiple atributes. In Proc. ACM Int. Conf. on Managment of Data (SIGMOD’90), pages 332–342, 1990. · doi:10.1145/93597.98742
  3. H. V. Jagadish. Linear clustering of objects with multiple atributes. In Proc. ACM Int. Conf. on Managment of Data (SIGMOD’90), pages 332–342, 1990. · doi:10.1145/93597.98742
  4. M. Lopez and S. Liao. Finding k-closest-pairs efficiently for high dimensional data. In Proc. 12th Canadian Conf. on Computational Geometry (CCCG), pages 197–204, 2000.
  5. J. Shepherd, X. Zhu, and N. Megiddo. A fast indexing method for multidimensional nearest neighbor search. In Proc. SPIE Conf. on Storage and Retrieval for image and video databases VII, pages 350–355, 1999. · doi:10.1117/12.333854

Cited by

See all 836

Metadata

Authors
Angiulli, F., & Pizzuti, C.
Venue
Lecture Notes in Computer Science
Published
2002
Pages
15-27
ISSN
0302-9743 (ISSN-L)
OpenAlex
W1530232915
Cited by
836
References
17
FWCI
5.98
Type
conference paper
Language
en
Open access
closed
Licence

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: Fast Outlier Detection in High Dimensional Spaces. https://app.cochat.ai/papers/10.1007/3-540-45681-3_2
The paper
Angiulli, F., & Pizzuti, C. (2002). Fast Outlier Detection in High Dimensional Spaces. Lecture Notes in Computer Science. https://doi.org/10.1007/3-540-45681-3_2

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.