A heuristic algorithm for solving the minimum sum-of-squares clustering problems
type: Item
instance of: scholarly article
title: A heuristic algorithm for solving the minimum sum-of-squares clustering problems
zbMATH Open document ID: 1311.90111
author: Burak Ordin
author: A. M. Bagirov
published in: Journal of Global Optimization
publication date: 2015-03-24T00:00:00Z
Mathematics Subject Classification ID: 90C26
zbMATH DE Number: 6419081
zbMATH Keywords: minimum sum-of-squares clustering
zbMATH Keywords: global optimization
zbMATH Keywords: nonsmooth optimization
zbMATH Keywords: \(k\)-means algorithm
zbMATH Keywords: global \(k\)-means algorithm
describes a project that uses: UCI-ml
describes a project that uses: TSPLIB
MaRDI profile type: Publication
full work available at URL: s10898-014-0171-5
OpenAlex ID: W2033344446
cites work: A receding-horizon regulator for nonlinear systems and a neural approximation
cites work: A global optimization approach to classification
cites work: Unsupervised and supervised data classification via nonsmooth and global optimization (with comments and rejoinder)
cites work: An algorithm for minimizing clustering functions
cites work: A new nonsmooth optimization algorithm for minimum sum-of-squares clustering problems
cites work: Modified global \(k\)-means algorithm for minimum sum-of-squares clustering problems
cites work: Fast modified global \(k\)-means algorithm for incremental cluster construction
cites work: Q4516036
cites work: Optimization and nonsmooth analysis
cites work: A method of truncated codifferential with application to some problems of cluster analysis
cites work: Evaluation of a Branch and Bound Algorithm for Clustering
cites work: An Interior Point Algorithm for Minimum Sum-of-Squares Clustering
cites work: A comparison of two dual-based procedures for solving the p-median problem
cites work: Cluster analysis and mathematical programming
cites work: J-MEANS: A new local search heuristic for minimum sum of squares clustering
cites work: Variable neighborhood decomposition search
cites work: Analysis of global \(k\)-means, an incremental heuristic for minimum sum-of-squares clustering
cites work: A Branch and Bound Clustering Algorithm
cites work: Fast global \(k\)-means clustering using cluster membership and inequality
cites work: TSPLIB—A Traveling Salesman Problem Library
cites work: Convex Analysis
cites work: Determination of the collapse load of plastic structures by the use of an upper bounding algorithm
cites work: A global optimization RLT-based approach for solving the hard clustering problem
cites work: Q3875132
cites work: Cluster analysis by simulated annealing
cites work: A novel clustering approach and prediction of optimal number of clusters: global optimum search with enhanced positioning
cites work: The hyperbolic smoothing clustering method
cites work: Solving the minimum sum-of-squares clustering problem by hyperbolic smoothing and partition into boundary and gravitational regions
DOI: 10.1007/S10898-014-0171-5
description: scientific article; zbMATH DE number 6419081