Abstract
Clustering methods have proved very successful in tackling the global optimization problem. One reason is that they make it possible to very efficiently combine global and local search.
The clustering technique facilitate efficient representation of the information on the problem encountered in the solution process. The output from the process showing the evolution of clusters contains a lot of extra information hard to formalize, but of great importance for the practitioner solving a real world problem.
In clustering methods stopping conditions available for uniform sampling and multistart relating the goal prescribed to the effort needed to achieve this goal can be used. Considerable theoretical progress has been made in this direction. The clustering approach to global optimization thus rests on a sound theoretical base which makes these methods attractive both from a practical and mathematical standpoint.
Keywords
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.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
Editor information
Rights and permissions
Copyright information
© 1989 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Törn, A., Žilinskas, A. (1989). Clustering methods. In: Törn, A., Žilinskas, A. (eds) Global Optimization. Lecture Notes in Computer Science, vol 350. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-50871-6_5
Download citation
DOI: https://doi.org/10.1007/3-540-50871-6_5
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-50871-7
Online ISBN: 978-3-540-46103-6
eBook Packages: Springer Book Archive