Clustering in large data sets with the limited memory bundle method
Authors:
- Napsu KarmitsaNKNapsu Karmitsa
- Adil M. BagirovABAdil M. Bagirov
- Sona TaheriSTSona Taheri
- 1 November 2018
- journal article
- research article
- Published by Elsevier in Pattern Recognition
- Vol. 83, 245-259
Abstract
No abstract availableKeywords
Funding Information
- Research Council of Finland (289500)
This publication has 29 references indexed in Scilit:
- Self-learning K-means clustering: a global optimization approachJournal of Global Optimization, 2012
- Solving the minimum sum-of-squares clustering problem by hyperbolic smoothing and partition into boundary and gravitational regionsPattern Recognition, 2011
- The hyperbolic smoothing clustering methodPattern Recognition, 2010
- A simple and fast algorithm for K-medoids clusteringExpert Systems with Applications, 2009
- Modified global -means algorithm for minimum sum-of-squares clustering problemsPattern Recognition, 2008
- Globally convergent limited memory bundle method for large-scale nonsmooth optimizationMathematical Programming, 2006
- An algorithm for minimizing clustering functionsOptimization, 2005
- A Tabu search approach to the clustering problemPattern Recognition, 1995
- A simulated annealing algorithm for the clustering problemPattern Recognition, 1991
- Comparing partitionsJournal of Classification, 1985