Please use this identifier to cite or link to this item:
|Type:||Artigo de periódico|
|Title:||Minimization subproblems and heuristics for an applied clustering problem|
|Abstract:||A practical problem that requires the classification of a set of points of R-n using a criterion not sensitive to bounded outliers is studied in this paper. A fixed-point (k-means) algorithm is defined that uses an arbitrary distance function. Finite convergence is proved. A robust distance defined by Boente et al. is selected for applications. Smooth approximations of this distance are defined and suitable heuristics are introduced to enhance the probability of finding global optimizers. A real-life example is presented and commented. (C) 2002 Elsevier Science B.V., All rights reserved.|
|Editor:||Elsevier Science Bv|
|Appears in Collections:||Artigos e Materiais de Revistas Científicas - Unicamp|
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.