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

The DOI matches its Crossref record.

Connectivity of the mutual k-nearest-neighbor graph in clustering and outlier detection

Brito, M.R., Chávez, E.L., Quiroz, A.J., Yukich, J.E. · 1997 · Statistics & Probability Letters

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.1016/s0167-7152(96)00213-1

Cites

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

No references could be resolved yet.

Research works printed but not linked: 8

  1. Dudley, 1984, Ecole d'eté de probabilités de St.-Flour, Vol. 1097, 1
  2. González-Barrios, 1995, When does the k-nearest neighbors graph contain the MST?, Comunicación Técnica del CIMAT
  3. Gowda, 1978, Agglomerative clustering using the concept of mutual nearest neighborhood, Pattern Recognition, 10, 105, 10.1016/0031-3203(78)90018-3 · DOI · Paper page
  4. Jarvis, 1973, Clustering using a similarity measure based on shared near neighbors, IEEE Trans. Comput. C, 22, 1025, 10.1109/T-C.1973.223640 · DOI · Paper page
  5. Milligan, 1985, An examination of procedures for determining the number of clusters in a data set, Psychometrica, 50, 159, 10.1007/BF02294245 · DOI · Paper page
  6. Wong, 1982, A hybrid clustering method for identifying high density clusters, J. Amer. Statist. Assoc., 77, 841, 10.2307/2287316 · doi:10.2307/2287316
  7. Wong, 1983, A k-th nearest neighbour clustering procedure, J. Roy. Statist. Soc., Ser. B, 45, 362, 10.1111/j.2517-6161.1983.tb01262.x · DOI
  8. Zahn, 1971, Graph-theoretical methods for detecting and describing Gestalt clusters, IEEE Trans. Comput. C, 20, 68, 10.1109/T-C.1971.223083 · DOI · Paper page

Cited by

See all 250

Metadata

Authors
Brito, M. R., Chávez, E. L., Quiroz, A. J., & Yukich, J. E.
Venue
Statistics & Probability Letters
Publisher
Elsevier BV
Published
1997-08
Volume
35
Issue
1
Pages
33-42
ISSN
0167-7152 (ISSN-L)
OpenAlex
W2029073757
Cited by
250
References
0
FWCI
1.43
Type
journal article
Language
en
Open access
closed
Licence
www.elsevier.com/tdm/userlicense/1.0/ (tdm)

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: Connectivity of the mutual k-nearest-neighbor graph in clustering and outlier detection. https://app.cochat.ai/papers/10.1016/s0167-7152(96)00213-1
The paper
Brito, M. R., Chávez, E. L., Quiroz, A. J., & Yukich, J. E. (1997). Connectivity of the mutual k-nearest-neighbor graph in clustering and outlier detection. Statistics & Probability Letters. https://doi.org/10.1016/s0167-7152(96)00213-1

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.