Abstract
This chapter presents different formulations of the clustering problem using various optimization approaches. They include the mixed integer programming, the general nonsmooth, and the nonsmooth DC formulations of the clustering problem. We introduce the auxiliary clustering problem and study optimality conditions for both the clustering and the auxiliary clustering problems. Finally, we discuss the smoothing of the clustering and the auxiliary clustering problems.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Bagirov, A.M.: Modified global k-means algorithm for sum-of-squares clustering problem. Pattern Recogn. 41, 3192–3199 (2008)
Bagirov, A.M.: An incremental DC algorithm for the minimum sum-of-squares clustering. Iran. J. Oper. Res. 5(1), 1–14 (2014)
Bagirov, A.M., Mohebi, E.: Nonsmooth optimization based algorithms in cluster analysis. In: Celebi, E. (ed.) Partitional Clustering Algorithms. Springer, New York, pp. 99–146 (2015)
Bagirov, A.M., Taheri, S.: A DC optimization algorithm for clustering problems with L 1-norm. Iran. J. Oper. Res. 8(2), 2–24 (2017)
Bagirov, A.M., Yearwood, J.: A new nonsmooth optimization algorithm for minimum sum-of-squares clustering problems. Eur. J. Oper. Res. 170(2), 578–596 (2006)
Bagirov, A.M., Rubinov, A., Soukhoroukova, N., Yearwood, J.: Unsupervised and supervised data classification via nonsmooth and global optimization, Top 11, 1–93 (2003)
Bagirov, A.M., Taheri, S., Ugon, J.: Nonsmooth DC programming approach to the minimum sum-of-squares clustering problems. Pattern Recogn. 53, 12–24 (2016)
Bock, H.H.: Clustering and neural networks. In: Rizzi, A., Vichi, M., Bock, H.H. (eds.) Advances in Data Science and Classification, pp. 265–277. Springer, Berlin (1998)
Celebi, M.E.: Improving the performance of k-means for color quantization. Image Vis. Comput. 29(4), 260–271 (2011)
Demyanov, V.F., Bagirov, A.M., Rubinov, A.M.: A method of truncated codifferential with application to some problems of cluster analysis. J. Glob. Optim. 23(1), 63–80 (2002)
Karmitsa, N., Bagirov, A.M., Taheri, S.: New diagonal bundle method for clustering problems in large data sets. Eur. J. Oper. Res. 263(2), 367–379 (2017)
Karmitsa, N., Bagirov, A.M., Taheri, S.: Clustering in large data sets with the limited memory bundle method. Pattern Recogn. 83, 245–259 (2018)
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2020 Springer Nature Switzerland AG
About this chapter
Cite this chapter
M. Bagirov, A., Karmitsa, N., Taheri, S. (2020). Optimization Models in Cluster Analysis. In: Partitional Clustering via Nonsmooth Optimization. Unsupervised and Semi-Supervised Learning. Springer, Cham. https://doi.org/10.1007/978-3-030-37826-4_4
Download citation
DOI: https://doi.org/10.1007/978-3-030-37826-4_4
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-37825-7
Online ISBN: 978-3-030-37826-4
eBook Packages: EngineeringEngineering (R0)