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

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

An effective and efficient algorithm for high-dimensional outlier detection

Aggarwal, Charu C., Yu, Philip S. · 2005 · The VLDB Journal

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.1007/s00778-004-0125-5

Cites

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

  • Mining association rules between sets of items in large databases

    Agrawal, R., Imieliński, T., & Swami, A. (1993) · Proceedings of the 1993 ACM SIGMOD international conference on Management of data · doi:10.1145/170035.170072 · Cited by 14,907 · cited 1×

    “1 This is not unexpected: unlike problems such as large itemset detection [7] where one is looking for large aggregate patterns, the problem of finding subsets of dimensions that are sparsely populated is akin to finding a needle in a haystack since one is looking for patterns that rarely exist.”
    Background
  • LOF: identifying density-based local outliers

    Breunig, M. M., Kriegel, H.-P., Ng, R. T., & Sander, J. (2000) · ACM SIGMOD Record · doi:10.1145/335191.335388 · Cited by 5,207

  • LOF: identifying density-based local outliers

    Breunig, M. M., Kriegel, H.-P., Ng, R. T., & Sander, J. (2000) · Proceedings of the 2000 ACM SIGMOD international conference on Management of data · doi:10.1145/342009.335388 · Cited by 4,149 · cited 6×

    “Starting with the work in [8], recent literature [10,20,21,23] defines outliers as points that are neither a part of a cluster nor a part of the background noise; rather they are specifically points that behave very differently from the norm.”
    BackgroundMethodInfluential
  • When Is ''Nearest Neighbor'' Meaningful?

    Beyer, K., Goldstein, J., Ramakrishnan, R., & Shaft, U. (1999) · Lecture Notes in Computer Science · doi:10.1007/3-540-49257-7_15 · Cited by 2,403 · cited 4×

    “The sparsity of the data in high dimensionality [ 9 ] can be interpreted slightly differently to infer that each point is as good as an outlier in high-dimensional space.”
    BackgroundInfluential
  • Efficient algorithms for mining outliers from large data sets

    Ramaswamy, S., Rastogi, R., & Shim, K. (2000) · Proceedings of the 2000 ACM SIGMOD international conference on Management of data · doi:10.1145/342009.335437 · Cited by 1,171 · cited 10×

    “Although the definition in [23] has some advantages over that provided in [20], it is again not specifically designed to work for high-dimensional problems.”
    BackgroundMethodInfluential

Cited by

See all 212

Metadata

Authors
Aggarwal, C. C., & Yu, P. S.
Venue
The VLDB Journal
Published
2005-04
Volume
14
Issue
2
Pages
211-221
ISSN
  • 0949-877X (ISSN-L)
  • 1066-8888
OpenAlex
W2090197195
Cited by
212
References
5
FWCI
4.41
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

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.