118
Views
20
CrossRef citations to date
0
Altmetric
Original Articles

An algorithm for minimizing clustering functions

Pages 351-368 | Accepted 15 Dec 2004, Published online: 08 Aug 2006

Keep up to date with the latest research on this topic with citation updates for this article.

Read on this site (1)

Articles from other publishers (19)

Adil Bagirov, Najmeh Hoseini-Monjezi & Sona Taheri. (2023) A novel optimization approach towards improving separability of clusters. Computers & Operations Research 152, pages 106135.
Crossref
Rudolf Scitovski, Kristian Sabo, Francisco Martínez-Álvarez & Šime UngarRudolf Scitovski, Kristian Sabo, Francisco Martínez-Álvarez & Šime Ungar. 2021. Cluster Analysis and Applications. Cluster Analysis and Applications 147 166 .
Rudolf Scitovski, Kristian Sabo, Francisco Martínez-Álvarez & Šime UngarRudolf Scitovski, Kristian Sabo, Francisco Martínez-Álvarez & Šime Ungar. 2021. Cluster Analysis and Applications. Cluster Analysis and Applications 65 100 .
Adil M. Bagirov, Napsu Karmitsa & Sona TaheriAdil M. Bagirov, Napsu Karmitsa & Sona Taheri. 2020. Partitional Clustering via Nonsmooth Optimization. Partitional Clustering via Nonsmooth Optimization 201 223 .
Napsu Karmitsa, Adil M. Bagirov & Sona Taheri. (2018) Clustering in large data sets with the limited memory bundle method. Pattern Recognition 83, pages 245-259.
Crossref
Napsu Karmitsa, Adil M. Bagirov & Sona Taheri. (2017) New diagonal bundle method for clustering problems in large data sets. European Journal of Operational Research 263:2, pages 367-379.
Crossref
Rudolf Scitovski. (2017) A new global optimization method for a symmetric Lipschitz continuous function and the application to searching for a globally optimal partition of a one-dimensional set. Journal of Global Optimization 68:4, pages 713-727.
Crossref
Adil M. Bagirov, Sona Taheri & Julien Ugon. (2016) Nonsmooth DC programming approach to the minimum sum-of-squares clustering problems. Pattern Recognition 53, pages 12-24.
Crossref
A. M. Bagirov, B. Ordin, G. Ozturk & A. E. Xavier. (2014) An incremental clustering algorithm based on hyperbolic smoothing. Computational Optimization and Applications 61:1, pages 219-241.
Crossref
Burak Ordin & Adil M. Bagirov. (2014) A heuristic algorithm for solving the minimum sum-of-squares clustering problems. Journal of Global Optimization 61:2, pages 341-361.
Crossref
Rudolf Scitovski & Tomislav Marošević. (2015) Multiple circle detection based on center-based clustering. Pattern Recognition Letters 52, pages 9-16.
Crossref
Ivan Vidović & Rudolf Scitovski. (2014) Center-based clustering for line detection and application to crop rows detection. Computers and Electronics in Agriculture 109, pages 212-220.
Crossref
Rudolf Scitovski & Kristian Sabo. (2014) Analysis of the k-means algorithm in the case of data points occurring on the border of two or more clusters. Knowledge-Based Systems 57, pages 1-7.
Crossref
Rudolf Scitovski & Sanja Scitovski. (2013) A fast partitioning algorithm and its application to earthquake investigation. Computers & Geosciences 59, pages 124-131.
Crossref
Adil Bagirov. 2009. Encyclopedia of Optimization. Encyclopedia of Optimization 2664 2671 .
Adil Bagirov. 2009. Encyclopedia of Optimization. Encyclopedia of Optimization 648 655 .
A.M. Rubinov, N.V. Soukhorokova & J. Ugon. (2006) Classes and clusters in data analysis. European Journal of Operational Research 173:3, pages 849-865.
Crossref
Adil M. Bagirov & Julien Ugon. (2006) Piecewise Partially Separable Functions and a Derivative-free Algorithm for Large Scale Nonsmooth Optimization. Journal of Global Optimization 35:2, pages 163-195.
Crossref
Adil Bagirov, Najmeh Hoseini Monjezi & Sona Taheri. (2022) A Novel Optimization Approach Towards Improving Compactness and Separability of Clusters. SSRN Electronic Journal.
Crossref

Reprints and Corporate Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

To request a reprint or corporate permissions for this article, please click on the relevant link below:

Academic Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

Obtain permissions instantly via Rightslink by clicking on the button below:

If you are unable to obtain permissions via Rightslink, please complete and submit this Permissions form. For more information, please visit our Permissions help page.