Sum-of-squares clustering on networks (Q2853254)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Sum-of-squares clustering on networks |
scientific article; zbMATH DE number 6217202
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Sum-of-squares clustering on networks |
scientific article; zbMATH DE number 6217202 |
Statements
Sum-of-squares clustering on networks (English)
0 references
18 October 2013
0 references
location
0 references
p-median
0 references
A continuous p-median problem on a network, taking the minimization of the weighted sum of squared distances between any two nodes as a criterion is considered. The authors extend feasible set of prototypes from a set of nodes to the set of all points in the network. In this case the optimal cluster prototypes are not necessary located at vertices of the network. This property is illustrated by a simple example.
0 references
