EFFICIENT COMPUTATION OF VORONOI NEIGHBORS BASED ON POLYTOPE SEARCH IN PATTERN RECOGNITION

Juan Mendez, Javier Lorenzo

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. The 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 in 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. The 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.

References

  1. Agrell, E. (1993). A method for examining vector quantizer structures. In Proceeding of IEEE International Symposium on Information Theory, page 394.
  2. Asuncion, A. and Newman, D. (2007). UCI machine learning repository.
  3. Aupetit, M. (2003). High-dimensional labeled data analysis with gabriel graphs. In European Symposium on Artificial Neuron Networks, pages 21-26.
  4. Aupetit, M. and Catz, T. (2005). High-dimensional labeled data analysis with topology representating graphs. Neurocomputing, 63:139-169.
  5. Avis, D. and Fukuda, K. (1992). A pivoting algorithm for convex hulls and vertex enumeration of arrangements and polyhedra. Discrete Comput. Geom., 8(3):295- 313.
  6. Barber, C. B., Dobkin, D. P., and Huhdanpaa, H. (1996). The quickhull algorithm for convex hulls. ACM Transactions on Mathematical Software, 22(4):469-483.
  7. Bazaraa, M. S., Jarvis, J. J., and Sherali, H. S. (1990). Linnear Programming and Networks Flows. Wiley.
  8. Bhattacharya, B., Poulsen, R., and Toussaint, G. (1992). Application of proximity graphs to editing nearest neighbor decision rules. Technical Report SOCS 92.19, School of Computer Science, McGill University.
  9. Bowyer, A. (1981). Computing Dirichlet tessellations. The Computer Journal, 24(2):162-166.
  10. Bremner, D., Fukuda, K., and Marzetta, A. (1997). Primaldual methods for vertex and facet enumeration. In SCG 7897: Proceedings of the thirteenth annual symposium on Computational geometry, pages 49-56, New York, NY, USA. ACM.
  11. Chin, E., Garcia, E. K., and Gupta, M. R. (2007). Color management of printers by regression over enclosing neighborhoods. In IEEE International Conference on Image Processing. ICIP 2007, volume 2, pages 161- 164.
  12. Dantzig, G. B. and Thapa, M. N. (2003). Linear Programming 2: Theory and Extensions. Springer Verlag.
  13. Devroye, L., Gyorfi, L., and Lugosi, G. (1996). A Probabilistic Theory of Pattern Recognition.
  14. Duda, R., Hart, P., and Stork, D. (2001). Pattern Classification. John Wiley.
  15. Fukuda, K. (2004). Frecuently asked questions in polyhedral computation. Technical report, Swiss Federal Institute of Technology, Lausanne, Switzerland.
  16. Gabriel, K. R. and Sokal, R. R. (1969). A new stattistical approach to geographic variation analysis. Systematic Zoology, 18:259-270.
  17. Greeff, G. (2005). The revised simplex algorithm on a GPU. Technical report, Dept. of Computer Science, University of Stellenbosch.
  18. Gupta, M. R., Garcia, E. K., and Chin, E. (2008). Adaptive local linear regression with application to printer color management. IEEE Trans. on Image Processing.
  19. Kalai, G. (1997). Linear programming, the simplex algorithm and simple polytopes. Math. Program., 79:217- 233.
  20. Koivistoinen, H., Ruuska, M., and Elomaa, T. (2006). A voronoi diagram approach to autonomous clustering. Lecture Notes in Computer Science, (4265):149-160.
  21. Navarro, G. (2002). Searching in metric spaces by spatial approximation. The VLDB Journal, 11:28-46.
  22. Ramasubramanian, V. and Paliwal, K. (1997). Voronoi projection-based fast nearest-neighbor search algorithms: Box-search and mapping table-based search techniques. Digital Signal Processing, 7:260-277.
  23. Sibson, R. (1981). Interpreting multivariate data, chapter A brief description of natural neighbour interpolation, pages 21-36. John Wiley.
  24. Watson, D. F. (1981). Computing the n-dimensional tessellation with application to voronoi polytopes. The Computer Journal, 24(2):167-172.
  25. Web, A. (2002). Statistical Pattern Recognition. John Wiley, 2nd edition.
  26. Winston, W. L. (1994). Operations Research Applications and Algorithms. Wadsworth.
  27. Wright, M. H. (2004). The interior-point revolution in optimization: History, recent developments,nnd lasting consequences. Bull. of AMS, 42(1):39-56.
  28. Yarmish, G. and van Slyke, R. (2001). retroLP, an implementation of the standard Simplex method. Technical report, Dept. of Computer and Information Science, Brooklyn College.
Download


Paper Citation


in Harvard Style

Mendez J. and Lorenzo J. (2012). EFFICIENT COMPUTATION OF VORONOI NEIGHBORS BASED ON POLYTOPE SEARCH IN PATTERN RECOGNITION . In Proceedings of the 1st International Conference on Pattern Recognition Applications and Methods - Volume 2: ICPRAM, ISBN 978-989-8425-99-7, pages 357-364. DOI: 10.5220/0003755703570364


in Bibtex Style

@conference{icpram12,
author={Juan Mendez and Javier Lorenzo},
title={EFFICIENT COMPUTATION OF VORONOI NEIGHBORS BASED ON POLYTOPE SEARCH IN PATTERN RECOGNITION},
booktitle={Proceedings of the 1st International Conference on Pattern Recognition Applications and Methods - Volume 2: ICPRAM,},
year={2012},
pages={357-364},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0003755703570364},
isbn={978-989-8425-99-7},
}


in EndNote Style

TY - CONF
JO - Proceedings of the 1st International Conference on Pattern Recognition Applications and Methods - Volume 2: ICPRAM,
TI - EFFICIENT COMPUTATION OF VORONOI NEIGHBORS BASED ON POLYTOPE SEARCH IN PATTERN RECOGNITION
SN - 978-989-8425-99-7
AU - Mendez J.
AU - Lorenzo J.
PY - 2012
SP - 357
EP - 364
DO - 10.5220/0003755703570364