A heuristic algorithm for solving the minimum sum-of-squares clustering problems

No abstract is available for this paper.

• Publication year

  2014

• Venue

  Journal of Global Optimization

• Publication date

  2014-03-19

• Fields of study

  Mathematics, Computer Science

• Identifiers
  DOI 10.1007/s10898-014-0171-5
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• Fast modified global k-means algorithm for incremental cluster construction

  2011cited by this paper
• Solving the minimum sum-of-squares clustering problem by hyperbolic smoothing and partition into boundary and gravitational regions

  2011cited by this paper
• Fast global k-means clustering using cluster membership and inequality

  2010cited by this paper
• The hyperbolic smoothing clustering method

  2010cited by this paper
• Modified global k-means algorithm for minimum sum-of-squares clustering problems

  2008cited by this paper
• A novel clustering approach and prediction of optimal number of clusters: global optimum search with enhanced positioning

  2007cited by this paper
• A new nonsmooth optimization algorithm for minimum sum-of-squares clustering problems

  2006cited by this paper
• Analysis of Global k-Means, an Incremental Heuristic for Minimum Sum-of-Squares Clustering

  2005cited by this paper
• A Global Optimization RLT-based Approach for Solving the Hard Clustering Problem

  2005cited by this paper
• An algorithm for minimizing clustering functions

  2005cited by this paper
• Cluster Analysis and Mathematical Programming

  2003cited by this paper
• Unsupervised and supervised data classification via nonsmooth and global optimization

  2003cited by this paper
• The global k-means clustering algorithm

  2003influential reference
• A method of truncated codifferential with application to some problems of cluster analysis

  2002cited by this paper
• A Global Optimization Approach to Classification

  2002cited by this paper
• A global optimisation approach to classification in medical diagnosis and prognosis

  2001cited by this paper
• J-MEANS: a new local search heuristic for minimum sum of squares clustering

  1999cited by this paper
• UCI Repository of machine learning databases

  1998cited by this paper
• Advances in data science and classification

  1998cited by this paper
• Variable Neighborhood Decomposition Search

  1998cited by this paper
• Clustering and Neural Networks

  1998cited by this paper
• An Interior Point Algorithm for Minimum Sum-of-Squares Clustering

  1997cited by this paper
• Computational experience on four algorithms for the hard clustering problem

  1996cited by this paper
• A Tabu search approach to the clustering problem

  1995cited by this paper
• Cluster Analysis by Simulated Annealing

  1994cited by this paper
• TSPLIB - A Traveling Salesman Problem Library

  1991cited by this paper
• A simulated annealing algorithm for the clustering problem

  1991cited by this paper
• A practical application of simulated annealing to clustering

  1990cited by this paper
• Evaluation of a Branch and Bound Algorithm for Clustering

  1985cited by this paper
• A comparison of two dual-based procedures for solving the p-median problem

  1985cited by this paper
• Optimization And Nonsmooth Analysis

  1983cited by this paper
• Clustering techniques: The user's dilemma

  1976cited by this paper
• A Branch and Bound Clustering Algorithm

  1975cited by this paper
• Convex Analysis: (pms-28)

  1970cited by this paper
• Contributions to mathematical statistics

  1951cited by this paper
• THE USE OF MULTIPLE MEASUREMENTS IN TAXONOMIC PROBLEMS

  1936cited by this paper

• SoK: Grouping Spam and Phishing Email Threats for Smarter Security

  2025cites this paper
• Nonmonotone subgradient methods based on a local descent lemma

  2025cites this paper
• Clust-Splitter $-$ an Efficient Nonsmooth Optimization-Based Algorithm for Clustering Large Datasets

  2025cites this paper
• Stochastic limited memory bundle algorithm for clustering in big data

  2025cites this paper
• Crystal synthesizability prediction using contrastive positive unlabeled learning

  2024cites this paper
• Local solutions of the multi-source Weber problem

  2024influential citation
• Memetic Differential Evolution Methods for Semi-Supervised Clustering

  2024cites this paper
• Robust clustering algorithm: The use of soft trimming approach

  2024cites this paper
• A bundle-type method for nonsmooth DC programs

  2023cites this paper
• The Boosted Double-proximal Subgradient Algorithm for nonconvex optimization

  2023cites this paper
• A New Boosted Proximal Point Algorithm for Minimizing Nonsmooth DC Functions

  2022cites this paper
• A novel optimization approach towards improving separability of clusters

  2022cites this paper
• AN ADAPTIVE 𝑘-MEDIANS CLUSTERING ALGORITHM

  2022influential citation
• Memetic differential evolution methods for clustering problems

  2021cites this paper
• A Computational Study of the DC Minimization Global Optimality Conditions Applied to K-Means Clustering

  2021cites this paper
• A boosted DC algorithm for non-differentiable DC components with non-monotone line search

  2021cites this paper
• The DTC (difference of tangentially convex functions) programming: optimality conditions

  2021cites this paper
• Less is more: simple algorithms for the minimum sum of squares clustering problem

  2021cites this paper
• An augmented subgradient method for minimizing nonsmooth DC functions

  2021cites this paper
• Latent group detection in functional partially linear regression models

  2021cites this paper
• Semi-Supervised Clustering with Inaccurate Pairwise Annotations

  2021cites this paper
• Boosted scaled subgradient method for DC programming

  2021cites this paper
• A memetic algorithm based on reformulation local search for minimum sum-of-squares clustering in networks

  2020cites this paper
• Multi-objective cluster analysis using a gradient evolution algorithm

  2020cites this paper
• Incremental Clustering Algorithms

  2020cites this paper
• The Boosted Difference of Convex Functions Algorithm for Nonsmooth Functions

  2020cites this paper
• An incremental nonsmooth optimization algorithm for clustering using L_1 and L_\infty norms

  2020cites this paper
• THE NONSMOOTH

  2020cites this paper
• An incremental fuzzy algorithm for data clustering problems

  2019cites this paper
• A Comparative Study of Unsupervised Classification Algorithms in Multi-Sized Data Sets

  2019cites this paper
• Word embedding-based techniques for text clustering and topic modelling with application in the healthcare domain

  2019cites this paper
• Cyberattack triage using incremental clustering for intrusion detection systems

  2019cites this paper
• On Some Incremental Algorithms for the Minimum Sum-of-Squares Clustering Problem. Part 1: Ordin and Bagirov's Incremental Algorithm.

  2019influential citation
• Using Positive Spanning Sets to Achieve d-Stationarity with the Boosted DC Algorithm

  2019cites this paper
• Using positive spanning sets to achieve stationarity with the Boosted DC Algorithm

  2019cites this paper
• Clustering in large data sets with the limited memory bundle method

  2018influential citation
• Qualitative properties of the minimum sum-of-squares clustering problem

  2018influential citation
• A simulated annealing‐based maximum‐margin clustering algorithm

  2018cites this paper
• Review of Basic Local Searches for Solving the Minimum Sum-of-Squares Clustering Problem

  2018cites this paper
• The Boosted DC Algorithm for nonsmooth functions

  2018cites this paper
• Double Bundle Method for finding Clarke Stationary Points in Nonsmooth DC Programming

  2018cites this paper
• HG-means: A scalable hybrid genetic algorithm for minimum sum-of-squares clustering

  2018influential citation
• Minimizing nonsmooth DC functions via successive DC piecewise-affine approximations

  2017cites this paper
• Nesterov’s smoothing technique and minimizing differences of convex functions for hierarchical clustering

  2017cites this paper
• A DC programming approach for solving multicast network design problems via the Nesterov smoothing technique

  2017cites this paper
• A DC Optimization Algorithm for Clustering Problems with $_$-norm

  2017influential citation
• A bi-objective vehicle routing problem integrating routing operations into tactical clustering decisions

  2017cites this paper
• Double Bundle Method for Nonsmooth DC Optimization

  2017cites this paper
• New diagonal bundle method for clustering problems in large data sets

  2017influential citation
• On Strategies to Fix Degenerate k-means Solutions

  2017cites this paper
• Optimization Based Clustering Algorithms for Authorship Analysis of Phishing Emails

  2017cites this paper
• Nonsmooth DC programming approach to the minimum sum-of-squares clustering problems

  2016influential citation
• Nonsmooth Optimization Based Algorithms in Cluster Analysis

  2015cites this paper
• AN INCREMENTAL DC ALGORITHM FOR THE MINIMUM SUM-OF-SQUARES CLUSTERING

  2014cites this paper