Qualitative properties of the minimum sum-of-squares clustering problem

Less is more: basic variable neighborhood search heuristic for balanced minimum sum-of-squares clustering

(2017) Leandro R. Costa et al.   INFORMATION SCIENCES

An efficient k -means clustering filtering algorithm using density based initial cluster centers

(2017) K. Mahesh Kumar et al.   INFORMATION SCIENCES

On the Problem of Minimizing a Difference of Polyhedral Convex Functions Under Linear Constraints

(2015) Nguyen Thi Van Hang et al.   JOURNAL OF OPTIMIZATION THEORY AND APPLICATIONS

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

(2014) Burak Ordin et al.   JOURNAL OF GLOBAL OPTIMIZATION

Fast modified global k-means algorithm for incremental cluster construction

(2010) Adil M. Bagirov et al.   PATTERN RECOGNITION

The planar k-means problem is NP-hard

(2010) Meena Mahajan et al.   THEORETICAL COMPUTER SCIENCE

NP-hardness of Euclidean sum-of-squares clustering

(2009) Daniel Aloise et al.   MACHINE LEARNING

Data clustering: 50 years beyond K-means

(2009) Anil K. Jain   PATTERN RECOGNITION LETTERS

Modified global -means algorithm for minimum sum-of-squares clustering problems

(2008) Adil M. Bagirov   PATTERN RECOGNITION