Published in

Elsevier, European Journal of Operational Research, 1(146), p. 19-34

DOI: 10.1016/s0377-2217(02)00208-4

Links

Tools

Export citation

Search in Google Scholar

Minimization Subproblems and Heuristics for an Applied Clustering Problem

Journal article published in 2003 by Ernesto G. Birgin ORCID, José Mario Martínez, Débora P. Ronconi
This paper is available in a repository.
This paper is available in a repository.

Full text: Download

Green circle
Preprint: archiving allowed
Upload
Orange circle
Postprint: archiving restricted
Upload
Red circle
Published version: archiving forbidden
Policy details
Data provided by SHERPA/RoMEO

Abstract

A practical problem that requires the classification of a set of points of Rn 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.