MétaCan
Menu
Back to cohort
Record W1666596936 · doi:10.1109/icpr.1998.711125

Reference set thinning for the k-nearest neighbor decision rule

2002· article· en· W1666596936 on OpenAlexaff
Bhaskar Bhattacharya, Damon Kaller

Bibliographic record

Venuenot available
Typearticle
Languageen
FieldComputer Science
TopicComputational Geometry and Mesh Generation
Canadian institutionsSimon Fraser University
Fundersnot available
KeywordsDelaunay triangulationVoronoi diagramCombinatoricsGraphMathematicsDiscrete mathematicsComputer scienceAlgorithmGeometry

Abstract

fetched live from OpenAlex

The k-nearest neighbor decision rule (or k-NNR) is used to classify a point in d-space according to the dominant class among its k nearest neighbors in some reference set (in which each point has a known class). It is useful to find a small subset S' of S that can be used as the reference set instead. If the k-NNR always makes the same decision using either S or S' as the reference set, then S' is called an exact thinning of S for the k-NNR. We show that such an exact thinning can be determined easily from the k-Delaunay graph of S (which is dual to the order-k Voronoi diagram of S). This graph "encodes" a particular subset of S that must be included within any exact thinning for the k-NNR, and it also provides information on how this subset can be augmented into an exact thinning (although perhaps not a minimum one). In addition, we investigate how the k-Gabriel graph (which is a subgraph of the k-Delaunay graph) can be used to derive an inexact thinning of S that performs well in practice for the k-NNR. It is advantageous to use the k-Gabriel graph instead of the k-Delaunay graph, because the k-Gabriel graph is smaller and much easier to compute from the point set S.

Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.

How this classification was reachedexpand

Full frame distilled prediction

Teacher imitation

Not calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.

metaresearch head score (Codex)0.000
metaresearch head score (Gemma)0.000
Version: codex-gemma-dda1882f352aValidation status: machine_predicted_unvalidated
Candidate categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Simulation or modeling · Consensus signal: none
GenreCandidate signal: Methods · Consensus signal: none
Teacher disagreement score0.905
Threshold uncertainty score0.225

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0000.000
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0000.000
Bibliometrics0.0000.000
Science and technology studies0.0000.000
Scholarly communication0.0000.000
Open science0.0000.000
Research integrity0.0000.000
Insufficient payload (model declined to judge)0.0000.000

Machine scores (provisional)

The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.

Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.

Opus teacher head0.079
GPT teacher head0.291
Teacher spread0.212 · how far apart the two teachers sit on this one work
Validation statusscore_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from it

Classification

machine, unvalidated

Machine predicted; a candidate call from one teacher head, not a consensus.

The models applied no category: nothing in the taxonomy fit this work.
Study designSimulation or modeling
Domainnot available
GenreMethods

How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".

Quick stats

Citations14
Published2002
Admission routes1
Has abstractyes

Explore more

Same topicComputational Geometry and Mesh GenerationFrench-language works237,207