Geodesic
Sum-Of-Squares Clustering on Networks
Yugoslav journal of operations research, Tome 21 (2011) no. 2, p. 157 Cet article a éte moissonné depuis la source eLibrary of Mathematical Institute of the Serbian Academy of Sciences and Arts

Voir la notice de l'article

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.
Classification : 90C35, 90C30
Keywords: Networks, clustering, location, p-Median. 
@article{YJOR_2011_21_2_a0,
     author = {Emilio Carrizosa and Nenad Mladenovi\'c and Raca Todosijevi\'c},
     title = {Sum-Of-Squares {Clustering} on {Networks}},
     journal = {Yugoslav journal of operations research},
     pages = {157 },
     year = {2011},
     volume = {21},
     number = {2},
     language = {en},
     url = {http://geodesic.mathdoc.fr/item/YJOR_2011_21_2_a0/}
}
TY  - JOUR
AU  - Emilio Carrizosa
AU  - Nenad Mladenović
AU  - Raca Todosijević
TI  - Sum-Of-Squares Clustering on Networks
JO  - Yugoslav journal of operations research
PY  - 2011
SP  - 157 
VL  - 21
IS  - 2
UR  - http://geodesic.mathdoc.fr/item/YJOR_2011_21_2_a0/
LA  - en
ID  - YJOR_2011_21_2_a0
ER  - 
%0 Journal Article
%A Emilio Carrizosa
%A Nenad Mladenović
%A Raca Todosijević
%T Sum-Of-Squares Clustering on Networks
%J Yugoslav journal of operations research
%D 2011
%P 157 
%V 21
%N 2
%U http://geodesic.mathdoc.fr/item/YJOR_2011_21_2_a0/
%G en
%F YJOR_2011_21_2_a0
Emilio Carrizosa; Nenad Mladenović; Raca Todosijević. Sum-Of-Squares Clustering on Networks. Yugoslav journal of operations research, Tome 21 (2011) no. 2, p. 157 . http://geodesic.mathdoc.fr/item/YJOR_2011_21_2_a0/