A Hybrid Heuristic for the k-medoids Clustering Problem

• Autor(a) principal: Nascimento, Maria C. V. [UNIFESP]
• Data de Publicação: 2012
• Outros Autores: Toledo, Franklina M. B., Carvalho, Andre C. P. L. F. de, Soule, T.
• Tipo de documento: Artigo de conferência
• Idioma: eng
• Título da fonte: Repositório Institucional da UNIFESP
• Texto Completo: http://repositorio.unifesp.br/handle/11600/34362; http://dx.doi.org/10.1145/2330163.2330223
• topic: clustering; bioinformatics; heuristic; PAM; integer programming

Clustering is an important tool for data analysis, since it allows the exploration of datasets with no or very little prior information. Its main goal is to group a set of data based on their similarity (dissimilarity). A well known mathematical formulation for clustering is the k-medoids problem. Current versions of k-medoids rely on heuristics, with good results reported in the literature. However, few methods that analyze the quality of the partitions found by the heuristics have been proposed. in this paper, we propose a hybrid Lagrangian heuristic for the k-medoids. We compare the performance of the proposed Lagrangian heuristic with other heuristics for the k-medoids problem found in literature. Experimental results presented that the proposed Lagrangian heuristic outperformed the other algorithms.