Sum-of-squares clustering on networks | Zendy

Emilio Carrizosa | Zendy; Nenad Mladenović | Zendy; Raca Todosijević | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

Sum-of-squares clustering on networks

Author(s) -

Emilio Carrizosa,

Nenad Mladenović,

Raca Todosijević

Publication year - 2011

Publication title -

yugoslav journal of operations research

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 0.221

H-Index - 21

eISSN - 1820-743X

pISSN - 0354-0243

DOI - 10.2298/yjor1102157c

Subject(s) - cluster analysis , explained sum of squares , set (abstract data type) , mathematics , computer science , cluster (spacecraft) , space (punctuation) , mathematical optimization , combinatorics , algorithm , data mining , artificial intelligence , statistics , programming language , operating system

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

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research