SciELO - Scientific Electronic Library Online

 
vol.23 número2A hybrid algorithm for the robust graph coloring problemApplication of a confirmatory factor model to find the latent factors that determine the perceived quality of life índice de autoresíndice de assuntospesquisa de artigos
Home Pagelista alfabética de periódicos  

Serviços Personalizados

Journal

Artigo

Indicadores

Links relacionados

  • Não possue artigos similaresSimilares em SciELO

Compartilhar


Revista de Matemática Teoría y Aplicaciones

versão impressa ISSN 1409-2433

Resumo

HERNANDEZ, Yunay  e  BEAUSOLEIL, Ricardo. Clustering problems in a multiobjective framework. Rev. Mat [online]. 2016, vol.23, n.2, pp.445-461. ISSN 1409-2433.

We propose a new algorithm using tabu search to deal with biobjective clustering problems. A cluster is a collection of records that are similar to one other and dissimilar to records in other clusters. Clustering has applications in VLSI design, protein-protein interaction networks, data mining and many others areas. Clustering problems have been subject of numerous studies; however, most of the work has focused on single-objective problems. In the context of multiobjective optimization our aim is to find a good approximation to the Pareto front and provide a method to make decisions. As an application problem we present the zoning problem by allowing the optimization of two objectives.

Palavras-chave : combinatorial data analysis; clustering; tabu search; multiobjective optimization.

        · resumo em Espanhol     · texto em Inglês     · Inglês ( pdf )