The complexity of finding minimal Voronoi covers with applications to machine learning
From MaRDI portal
Publication:1314528
DOI10.1016/0925-7721(93)90019-3zbMath0801.68166OpenAlexW2084691280MaRDI QIDQ1314528
Publication date: 29 November 1994
Published in: Computational Geometry (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0925-7721(93)90019-3
NP-hardtrainingcomputational geometrymachine learningVoronoi diagramsnearest neighbor learning programplanar tessellation
Analysis of algorithms and problem complexity (68Q25) Learning and adaptive systems in artificial intelligence (68T05) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)
Related Items (2)
GEOMETRIC PROXIMITY GRAPHS FOR IMPROVING NEAREST NEIGHBOR METHODS IN INSTANCE-BASED LEARNING AND DATA MINING ⋮ Categorization generated by extended prototypes -- an axiomatic approach
Cites Work
This page was built for publication: The complexity of finding minimal Voronoi covers with applications to machine learning