|Title:||Sum-of-squares clustering on networks||Journal:||Yugoslav Journal of Operations Research||Volume:||21||Issue:||2||First page:||157||Last page:||161||Issue Date:||1-Dec-2011||Rank:||M51||ISSN:||0354-0243||DOI:||10.2298/YJOR1102157C||Abstract:||
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.
|Keywords:||Clustering | Location | Networks | P-Median||Publisher:||Faculty of Organizational Sciences, University of Belgrade||Project:||Serbian-Spanish project AIB2010SE-00318
Ministry of Science and Innovation, Spain, Grant no. MTM2009-14039
Serbian Ministry of Sciences, Project 172010
Show full item record
checked on Dec 5, 2021
checked on Dec 6, 2021
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.