File(s) under permanent embargo
A new nonsmooth optimization algorithm for minimum sum-of-squares clustering problems
journal contribution
posted on 2006-04-16, 00:00 authored by A M Bagirov, John YearwoodJohn YearwoodThe 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.
History
Journal
European journal of operational researchVolume
170Issue
2Pagination
578 - 596Publisher
ElsevierLocation
Amsterdam, The NetherlandsPublisher DOI
ISSN
0377-2217eISSN
1872-6860Language
engPublication classification
C1.1 Refereed article in a scholarly journalCopyright notice
2004, ElsevierUsage metrics
Categories
No categories selectedLicence
Exports
RefWorks
BibTeX
Ref. manager
Endnote
DataCite
NLM
DC