Sum-of-squares clustering on networks
2011 ◽
Vol 21
(2)
◽
pp. 157-161
◽
Keyword(s):
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.
Keyword(s):
2011 ◽
Vol 76
(9)
◽
pp. 1133-1139
◽
2007 ◽
Vol 16
(06)
◽
pp. 919-934
2020 ◽
2011 ◽
Vol 94-96
◽
pp. 1814-1817
Keyword(s):
2009 ◽
Vol 289-292
◽
pp. 679-686
◽
2014 ◽
Vol 27
(1)
◽
pp. 1-5
◽
Keyword(s):
Keyword(s):