Heuristics for minimizing the maximum within-clusters distance

Página do item simplificado
dc.contributor.authorFioruci, José Augusto
dc.contributor.authorToledo, Franklina M.b.
dc.contributor.authorNascimento, Mariá Cristina Vasconcelos [UNIFESP]
dc.contributor.institutionUniversidade de São Paulo (USP)
dc.contributor.institutionUniversidade Federal de São Paulo (UNIFESP)
dc.date.accessioned2015-06-14T13:45:04Z
dc.date.available2015-06-14T13:45:04Z
dc.date.issued2012-12-01
dc.description.abstractThe clustering problem consists in finding patterns in a data set in order to divide it into clusters with high within-cluster similarity. This paper presents the study of a problem, here called MMD problem, which aims at finding a clustering with a predefined number of clusters that minimizes the largest within-cluster distance (diameter) among all clusters. There are two main objectives in this paper: to propose heuristics for the MMD and to evaluate the suitability of the best proposed heuristic results according to the real classification of some data sets. Regarding the first objective, the results obtained in the experiments indicate a good performance of the best proposed heuristic that outperformed the Complete Linkage algorithm (the most used method from the literature for this problem). Nevertheless, regarding the suitability of the results according to the real classification of the data sets, the proposed heuristic achieved better quality results than C-Means algorithm, but worse than Complete Linkage.en
dc.description.affiliationUniversidade de São Paulo Instituto de Ciências Matemáticas e de Computação
dc.description.affiliationUniversidade Federal de São Paulo (UNIFESP) Instituto de Ciência e Tecnologia
dc.description.affiliationUnifespUNIFESP, Instituto de Ciência e Tecnologia
dc.description.sourceSciELO
dc.format.extent497-522
dc.identifierhttp://dx.doi.org/10.1590/S0101-74382012005000023
dc.identifier.citationPesquisa Operacional. Sociedade Brasileira de Pesquisa Operacional, v. 32, n. 3, p. 497-522, 2012.
dc.identifier.doi10.1590/S0101-74382012005000023
dc.identifier.fileS0101-74382012000300002.pdf
dc.identifier.issn0101-7438
dc.identifier.scieloS0101-74382012000300002
dc.identifier.urihttp://repositorio.unifesp.br/handle/11600/7427
dc.language.isoeng
dc.publisherSociedade Brasileira de Pesquisa Operacional
dc.relation.ispartofPesquisa Operacional
dc.rightsinfo:eu-repo/semantics/openAccess
dc.subjectclusteringen
dc.subjectheuristicsen
dc.subjectGRASPen
dc.subjectminimization of the maximum diameteren
dc.titleHeuristics for minimizing the maximum within-clusters distanceen
dc.typeinfo:eu-repo/semantics/article
Arquivos
Pacote Original
Agora exibindo 1 - 1 de 1
Imagem de Miniatura
Nome:
S0101-74382012000300002.pdf
Tamanho:
719.47 KB
Formato:
Adobe Portable Document Format
Descrição:
Baixar
Coleções
ICT - Artigos