Global optimization in clustering using hyperbolic cross points

  • Authors:
  • Y. -K. Hu;Y. P. Hu

  • Affiliations:
  • Department of Mathematical Sciences, Georgia Southern University, Statesboro, GA 30460-8093, USA;Experiment and Training Base, Beijing Union University, 97 North Fourth Ring East Rd., Beijing 100101, China

  • Venue:
  • Pattern Recognition
  • Year:
  • 2007

Quantified Score

Hi-index 0.01

Visualization

Abstract

Erich Novak and Klaus Ritter developed in 1996 a global optimization algorithm that uses hyperbolic cross points (HCPs). In this paper we develop a hybrid algorithm for clustering called CMHCP that uses a modified version of this HCP algorithm for global search and the alternating optimization for local search. The program has been tested extensively with very promising results and high efficiency. This provides a nice addition to the arsenal of global optimization in clustering. In the process, we also analyze the smoothness of some reformulated objective functions.