Artículo
Sum-of-squares clustering on networks
Autor/es | Carrizosa Priego, Emilio José
Mladenović, Nenad Todosijević, Raca |
Departamento | Universidad de Sevilla. Departamento de Estadística e Investigación Operativa |
Fecha de publicación | 2011 |
Fecha de depósito | 2016-12-09 |
Publicado en |
|
Resumen | Finding p prototypes by minimizing the sum of the squared distances from a
set of points to its closest prototype is a well-studied problem in clustering, data analysis and continuous location. In this note, this very ... Finding p prototypes by minimizing the sum of the squared distances from a set of points to its closest prototype is a well-studied problem in clustering, data analysis and continuous location. In this note, this very same problem is addressed assuming, for the first time, that the space of possible prototype locations is a network. We develop some interesting properties of such clustering problem. We also show that optimal cluster prototypes are not necessary located at vertices of the network. |
Identificador del proyecto | AIB2010SE-00318
MTM2009-14039 FQM-329 #172010 |
Cita | Carrizosa Priego, E.J., Mladenović, N. y Todosijević, R. (2011). Sum-of-squares clustering on networks. Yugoslav Journal of Operations Research, 21 (2), 157-161. |
Ficheros | Tamaño | Formato | Ver | Descripción |
---|---|---|---|---|
Sum-of-squares clustering on ... | 128.2Kb | [PDF] | Ver/ | |