Advertisement

Dwulit’s Hull as Means of Optimization of kNN Algorithm

  • M. P. Dwulit
  • Z. Szymański
Part of the Advances in Intelligent and Soft Computing book series (AINSC, volume 99)

Abstract

The paper includes a description of a novel method for reducing the size of a training set in order to reduce memory requirements and classification complexity. Our method allows the condensing of the training set in a way that it is both training set consistent (classifies all training data points correctly) and decision-boundary consistent (the decision boundary does not changes after applying our method) for NN classifiers. Furthermore, the algorithm described here allows the utilization of a parallel computing paradigm in order to increase performance.

Keywords

Convex Hull Voronoi Diagram Near Neighbor Delaunay Triangulation Decision Boundary 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [Bhattacharya et al. 1992]
    Bhattacharya, B.K., Poulsen, R.S., Toussaint, G.T.: Application of proximity graphs to editing nearest neighbor decision rules, Simon Fraser University, pp. 1–25 (1992)Google Scholar
  2. [Blair 2000]
    Blair, D.E.: Inversion theory and conformal mapping. American Mathematical Society, Providence, Rhode Island (2000)Google Scholar
  3. [Fayed et al. 2009]
    Fayed, H.A., Atiya, A.F.: A novel template reduction approach for the K-nearest neighbor method. Trans. Neur. Netw. 20, 890–896 (2009)CrossRefGoogle Scholar
  4. [Gates 1972]
    Gates, G.W.: The reduced nearest neighbor rule. IEEE Trans. on Inform. Theory 18, 431–433 (1972)CrossRefGoogle Scholar
  5. [Goodman 1997]
    Goodman, J.E.: Handbook of discrete and computational geometry. CRC Press, Boca Raton (1997)zbMATHGoogle Scholar
  6. [Hart 1968]
    Hart, E.: The condensed nearest neighbor rule. IEEE Trans. on Inform. Theory 14, 515–516 (1968)CrossRefGoogle Scholar
  7. [O’Rourke 1998]
    O’Rourke, J.: Computational Geometry in C, 2nd edn. Cambridge University Press, Cambridge (1998)zbMATHGoogle Scholar
  8. [Ripley 1996]
    Ripley, B.D.: Pattern recognition and neural networks. Cambridge University Press, Cambridge (1996)zbMATHGoogle Scholar
  9. [Szymanski and Dwulit 2010]
    Szymański, Z., Dwulit, M.P.: Improved nearest neighbor classifier based on local space inversion. In: Proc. of the 3rd International Conf. on Human System Interaction, Rzeszow, Poland, pp. 95–100 (2010)Google Scholar
  10. [Vincent and Bengio 2002]
    Vincent, P., Bengio, Y.: K-local hyperplane and convex distance nearest neighbor algorithms. In: Advances in Neural Information Processing Systems, vol. 14, pp. 985–992. MIT Press, Cambridge (2002)Google Scholar
  11. [Wilson and Martinez 2000]
    Wilson, D.R., Martinez, T.R.: Reduction techniques for instance-based learning algorithms. Mach. Learn. 38, 257–286 (2000)zbMATHCrossRefGoogle Scholar
  12. [Zhang et al. 2006]
    Zhang, H., Berg, A.C., Maire, M., et al.: SVM-KNN: Discriminative nearest neighbor classification for visual category recognition. In: Proc. of the 2006 IEEE Computer Society Conf. on Computer Vision and Pattern Recognition, pp. 2126–2136 (2006)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2012

Authors and Affiliations

  • M. P. Dwulit
    • 1
  • Z. Szymański
    • 1
  1. 1.Department of Computer ScienceWarsaw University of TechnologyWarsawPoland

Personalised recommendations