Output-sensitive algorithms for computing nearest-neighbour decision boundaries

DOI10.1007/S00454-004-1152-0MaRDI QIDQ2484010zbMATH OpenOpenAlexWikidataFDO

Authors David Bremner, Erik D. Demaine, John Iacono, Stefan Langerman, Pat Morin, Godfried Toussaint, Jeff Erickson

Publication date 2 August 2005

Published in Discrete \& Computational Geometry (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s00454-004-1152-0

Mathematics Subject Classification ID

Pattern recognition, speech recognition (68T10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Recommendations

• Output-sensitive algorithms for computing nearest-neighbour decision boundaries.
• Separability of point sets by \(k\)-level linear classification trees
• Chromatic nearest neighbor searching: A query sensitive approach
• An efficient \(k\) nearest neighbors searching algorithm for a query line.
• Algorithms and hardness results for nearest neighbor problems in bicolored point sets

Cited in

(8)

• A characterization of nearest-neighbor rule decision surfaces and a new approach to generate them
• Output sensitive algorithms for approximate incidences and their applications
• Inversion and geodiversity: searching model space for the answers
• Finding simplices containing the origin in two and three dimensions
• Multifractal detrended moving average analysis for texture representation
• Multifractal methods for rapeseed nitrogen nutrition qualitative diagnosis modeling
• Design‐based properties of the nearest neighbor spatial interpolator and its bootstrap mean squared error estimator
• Output-sensitive algorithms for computing nearest-neighbour decision boundaries.

This page was built for publication: Output-sensitive algorithms for computing nearest-neighbour decision boundaries

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2484010)