Improving The Accuracy Of Nearest-neighbor Classification Using Principled Construction And Stochastic Sampling Of Training-set Centroids
2018 Β· Stephen Whitelam
Abstract
A conceptually simple way to classify images is to directly compare test-set data and training-set data. The accuracy of this approach is limited by the method of comparison used, and by the extent to which the training-set data cover configuration space. Here we show that this coverage can be substantially increased using coarse graining (replacing groups of images by their centroids) and stochastic sampling (using distinct sets of centroids in combination). We use the MNIST and Fashion-MNIST data sets to show that a principled coarse-graining algorithm can convert training images into fewer image centroids without loss of accuracy of classification of test-set images by nearest-neighbor classification. Distinct batches of centroids can be used in combination as a means of stochastically sampling configuration space, and can classify test-set data more accurately than can the unaltered training set. On the MNIST and Fashion-MNIST data sets this approach converts nearest-neighbor class
Authors
(none)
Tags
Stats
Related papers
- On High-dimensional Modifications Of The Nearest Neighbor Classifier (2024)0.00
- Simpleshot: Revisiting Nearest-neighbor Classification For Few-shot Learning (2019)0.00
- P3dc-shot: Prior-driven Discrete Data Calibration For Nearest-neighbor Few-shot Classification (2023)6.34
- Neighborhood Watch: Representation Learning With Local-margin Triplet Loss And Sampling Strategy For K-nearest-neighbor Image Classification (2019)0.00
- With A Little Help From My Friends: Nearest-neighbor Contrastive Learning Of Visual Representations (2021)18.76
- Explaining The Success Of Nearest Neighbor Methods In Prediction (2025)18.63
- Pnnclr: Stochastic Pseudo Neighborhoods For Contrastive Learning Based Unsupervised Representation Learning Problems (2023)7.16
- Reducing Nearest Neighbor Training Sets Optimally And Exactly (2023)0.00