An algorithm for clustering based on non‐smooth optimization techniques
Adil Bagirov, Alexander M. Rubinov, N. V. Soukhoroukova, John L. Yearwood · International Transactions in Operational Research · 2003
Abstract 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.