Authors
Adil M Bagirov, John Yearwood
Publication date
2006/4/16
Journal
European journal of operational research
Volume
170
Issue
2
Pages
578-596
Publisher
North-Holland
Description
The minimum sum-of-squares clustering problem is formulated as a problem of nonsmooth, nonconvex optimization, and an algorithm for solving the former problem based on nonsmooth optimization techniques is developed. The issue of applying this algorithm to large data sets is discussed. Results of numerical experiments have been presented which demonstrate the effectiveness of the proposed algorithm.
Total citations
Scholar articles
AM Bagirov, J Yearwood - European journal of operational research, 2006