Skip to main content
Article thumbnail
Location of Repository

Sum-of-squares clustering on networks

By Carrizosa Emilio, Mladenović Nenad and Todosijević Raca

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

Topics: networks, clustering, location, p-Median, Mathematics, QA1-939, Science, Q, DOAJ:Mathematics, DOAJ:Mathematics and Statistics, Management information systems, T58.6-58.62
Publisher: University of Belgrade
Year: 2011
DOI identifier: 10.2298/YJOR1102157C
OAI identifier: oai:doaj.org/article:21b53d97f488498da7ffb133fee84737
Journal:
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • https://doaj.org/toc/1820-743X (external link)
  • https://doaj.org/toc/0354-0243 (external link)
  • http://www.doiserbia.nb.rs/img... (external link)
  • https://doaj.org/article/21b53... (external link)
  • Suggested articles


    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.