CoChat

An adaptive k-nearest neighbor algorithm

Sun, Shiliang, Huang, Rongqing · 2010 · 2010 Seventh International Conference on Fuzzy Systems and Knowledge Discovery
Cited by 225

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

Abstract

An adaptive k-nearest neighbor algorithm (AdaNN) is brought forward in this paper to overcome the limitation of the traditional k-nearest neighbor algorithm (kNN) which usually identifies the same number of nearest neighbors for each test example. It is known that the value of k has crucial influence on the performance of the kNN algorithm, and our improved kNN algorithm focuses on finding out the suitable k for each test example. The proposed algorithm finds out the optimal k, the number of the fewest nearest neighbors that every training example can use to get its correct class label. For classifying each test example using the kNN algorithm, we set k to be the same as the optimal k of its nearest neighbor in the training set. The performance of the proposed algorithm is tested on several data sets. Experimental results indicate that our algorithm performs better than the traditional kNN algorithm.

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/fskd.2010.5569740

Cites

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

Cited by

See all 225

Metadata

Authors
Sun, S., & Huang, R.
Venue
2010 Seventh International Conference on Fuzzy Systems and Knowledge Discovery
Publisher
IEEE
Published
2010-08
Pages
91-94
OpenAlex
W1985712316
Cited by
225
References
1
FWCI
2.02
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

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.