Please use this identifier to cite or link to this item:
Title: Computing Voronoi adjacencies in high dimensional spaces by using linear programming
Authors: Mendez, Juan 
Lorenzo, Javier 
UNESCO Clasification: 120304 Inteligencia artificial
Keywords: Voronoi adjacencies
Nearest neighbors
Machine learning
Linear programming
Issue Date: 2013
Journal: Springer Proceedings in Mathematics and Statistics 
Abstract: Some algorithms in Pattern Recognition and Machine Learning as neighborhood-based classification and dataset condensation can be improved with the use of Voronoi tessellation. This paper shows the weakness of some existing algorithms of tessellation to deal with high-dimensional datasets. The use of linear programming can improve the tessellation procedures by focusing on Voronoi adjacency. It will be shown that the adjacency test based on linear programming is a version of the polytope search. However, the polytope search procedure provides more information than a simple Boolean test. This paper proposes a strategy to use the additional information contained in the basis of the linear programming algorithm to obtain other tests. The theoretical results are applied to tessellate several random datasets, and also for much-used datasets in Machine Learning repositories.
ISBN: 978-1-4614-5075-7
ISSN: 2194-1009
DOI: 10.1007/978-1-4614-5076-4_3
Source: Latorre Carmona P., Sánchez J., Fred A. (eds) Mathematical Methodologies in Pattern Recognition and Machine Learning. Springer Proceedings in Mathematics & Statistics, vol 30. Springer, New York, NY
Appears in Collections:Actas de congresos
Show full item record


checked on Feb 21, 2021

Page view(s)

checked on Feb 27, 2021

Google ScholarTM




Export metadata

Items in accedaCRIS are protected by copyright, with all rights reserved, unless otherwise indicated.