Pattern classification using a set of compact hyperspheres

  • Authors:
  • Amir Atiya;Sherif Hashem;Hatem Fayed

  • Affiliations:
  • Computer Engineering Department, Cairo University, Egypt;Engineering Mathematics and Physics Department, Cairo University, Egypt;Engineering Mathematics and Physics Department, Cairo University, Egypt

  • Venue:
  • ICONIP'06 Proceedings of the 13th international conference on Neural Information Processing - Volume Part II
  • Year:
  • 2006

Quantified Score

Hi-index 0.00

Visualization

Abstract

Prototype classifiers are one of the simplest and most intuitive approaches in pattern classification. However, they need careful positioning of prototypes to capture the distribution of each class region. Classical methods, such as learning vector quantization (LVQ), are sensitive to the initial choice of the number and the locations of the prototypes. To alleviate this problem, a new method is proposed that represents each class region by a set of compact hyperspheres. The number of hyperspheres and their locations are determined by setting up the problem as a set of quadratic optimization problems. Experimental results show that the proposed approach significantly beats LVQ and Restricted Coulomb Energy (RCE) in most performance aspects.