Heuristics for minimizing the maximum within-clusters distance
The 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 l...
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Sociedade Brasileira de Pesquisa Operacional
2012-12-01
|
| Series: | Pesquisa Operacional |
| Subjects: | |
| Online Access: | http://www.scielo.br/scielo.php?script=sci_arttext&pid=S0101-74382012000300002 |