An incremental clustering algorithm based on hyperbolic smoothing
- 30 October 2014
- journal article
- Published by Springer Nature in Computational Optimization and Applications
- Vol. 61 (1) , 219-241
Abstract
No abstract availableKeywords
This publication has 24 references indexed in Scilit:
- Fast modified global k-means algorithm for incremental cluster constructionPattern Recognition, 2011
- 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
- Modified global -means algorithm for minimum sum-of-squares clustering problemsPattern Recognition, 2008
- The global k-means clustering algorithmPattern Recognition, 2003
- J-Means: a new local search heuristic for minimum sum of squares clusteringPattern Recognition, 2001
- A Tabu search approach to the clustering problemPattern Recognition, 1995
- A practical application of simulated annealing to clusteringPattern Recognition, 1992
- A simulated annealing algorithm for the clustering problemPattern Recognition, 1991
- Clustering techniques: The user's dilemmaPattern Recognition, 1976