Sum-of-squares clustering on networks
DOI:
https://doi.org/10.2298/YJOR1102157CKeywords:
networks, clustering, location, p-MedianAbstract
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.Downloads
Published
2011-09-01
Issue
Section
Research Articles
License
Copyright (c) YUJOR
This work is licensed under a Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.