Boosting \(k\)-NN for categorization of natural scenes
type: Item
instance of: scholarly article
title: Boosting \(k\)-NN for categorization of natural scenes
zbMATH Open document ID: 1259.68203
author: Richard Nock
author: Paolo Piro
author: Frank Nielsen
author: Wafa Bel Haj Ali
author: Michel Barlaud
published in: International Journal of Computer Vision
publication date: 2013-03-20T00:00:00Z
Mathematics Subject Classification ID: 68T45
Mathematics Subject Classification ID: 68T05
zbMATH DE Number: 6146912
zbMATH Keywords: boosting
zbMATH Keywords: \(k\) nearest neighbors
zbMATH Keywords: image categorization
zbMATH Keywords: scene classification
describes a project that uses: SIFT
describes a project that uses: AdaBoost-SAMME
describes a project that uses: ML-KNN
describes a project that uses: Vlfeat
describes a project that uses: LIBSVM
MaRDI profile type: Publication
full work available at URL: s11263-012-0539-2
OpenAlex ID: W2111536473
cites work: Q3174158
cites work: Convexity, Classification, and Risk Bounds
cites work: Advances in instance selection for instance-based learning algorithms
cites work: A Bayesian Reassessment of Nearest-Neighbor Classification
cites work: Information Theory in Computer Vision and Pattern Recognition
cites work: An Optimal Global Nearest Neighbor Metric
cites work: Indoor versus outdoor scene classification using probabilistic neural network
cites work: Likelihood inference in nearest-neighbour classification models
cites work: Boosted discriminant projections for nearest neighbor classification
cites work: On surrogate loss functions and \(f\)-divergences
cites work: An improved bound on the finite-sample risk of the nearest neighbor rule
cites work: Modeling the shape of the scene: A holistic representation of the spatial envelope
cites work: Improved boosting algorithms using confidence-rated predictions
cites work: Improved scene classification using efficient low-level features and semantic cues
cites work: Kernel nearest-neighbor algorithm
cites work: Classification methods with reject option based on convex risk minimization
cites work: ML-KNN: A lazy learning approach to multi-label learning
cites work: Multi-class AdaBoost
cites work: On kernel difference-weighted \(k\)-nearest neighbor classification
DOI: 10.1007/S11263-012-0539-2
description: scientific article; zbMATH DE number 6146912