The complexity of finding minimal Voronoi covers with applications to machine learning
From MaRDI portal
Publication:1314528
DOI10.1016/0925-7721(93)90019-3zbMath0801.68166MaRDI 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-hard; training; computational geometry; machine learning; Voronoi diagrams; nearest neighbor learning program; planar tessellation
68Q25: Analysis of algorithms and problem complexity
68T05: Learning and adaptive systems in artificial intelligence
68U05: Computer graphics; computational geometry (digital and algorithmic aspects)
Related Items
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