Premium
An algorithm for clustering based on non‐smooth optimization techniques
Author(s) -
Bagirov A. M.,
Rubinov A. M.,
Soukhoroukova N. V.,
Yearwood J.
Publication year - 2003
Publication title -
international transactions in operational research
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 1.032
H-Index - 52
eISSN - 1475-3995
pISSN - 0969-6016
DOI - 10.1111/1475-3995.00431
Subject(s) - cluster analysis , mathematical optimization , computer science , cluster (spacecraft) , algorithm , optimization problem , regular polygon , mathematics , artificial intelligence , geometry , programming language
The problem of cluster analysis is formulated as a problem of non‐smooth, non‐convex optimization, and an algorithm for solving the cluster analysis problem based on non‐smooth optimization techniques is developed. We discuss applications of this algorithm in large databases. Results of numerical experiments are presented to demonstrate the effectiveness of this algorithm.