- Title
- An algorithm for minimizing clustering functions
- Creator
- Bagirov, Adil; Ugon, Julien
- Date
- 2005
- Type
- Text; Journal article
- Identifier
- http://researchonline.federation.edu.au/vital/access/HandleResolver/1959.17/60182
- Identifier
- vital:82
- Identifier
-
https://doi.org/10.1080/02331930500096155
- Identifier
- ISSN:0233-1934
- Abstract
- The problem of cluster analysis is formulated as a problem of nonsmooth, nonconvex optimization. An algorithm for solving the latter optimization problem is developed which allows one to significantly reduce the computational efforts. This algorithm is based on the so-called discrete gradient method. Results of numerical experiments are presented which demonstrate the effectiveness of the proposed algorithm.; C1
- Publisher
- Taylor & Francis
- Relation
- Optimization Vol. 54, no. 4-5 (Aug-Oct 2005), p. 351-368
- Rights
- Copyright Taylor and Francis
- Rights
- Open Access
- Rights
- This metadata is freely available under a CCO license
- Subject
- 0802 Computation Theory and Mathematics; Clustering functions; Cluster analysis; Nonsmooth; Nonconvex; Optimisation; Discrete gradient method; Minimization
- Full Text
- Reviewed
- Hits: 4947
- Visitors: 5361
- Downloads: 410
| Thumbnail | File | Description | Size | Format | |||
|---|---|---|---|---|---|---|---|
| View Details Download | DS1 | Final Version | 174 KB | Adobe Acrobat PDF | View Details Download |