Please use this identifier to cite or link to this item: http://repositorio.unicamp.br/jspui/handle/REPOSIP/57021
Type: Artigo de periódico
Title: Minimization subproblems and heuristics for an applied clustering problem
Author: Birgin, EG
Martinez, JM
Ronconi, DP
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.
Subject: nonlinear programming
heuristics
clustering
classification
fixed points
Country: Holanda
Editor: Elsevier Science Bv
Rights: fechado
Identifier DOI: 10.1016/S0377-2217(02)00208-4
Date Issue: 2003
Appears in Collections:Artigos e Materiais de Revistas Científicas - Unicamp

Files in This Item:
File Description SizeFormat 
WOS000180346000002.pdf164.69 kBAdobe PDFView/Open


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.