K-median problem: Difference between revisions
Content deleted Content added
m Stub-sorting. You can help! |
replace by redirect to k-medians clustering |
||
| (9 intermediate revisions by 4 users not shown) | |||
| Line 1: | Line 1: | ||
#REDIRECT [[k-medians clustering]] |
|||
The '''k-median problem''' is the problem of finding ''k'' centers such that the clusters formed by them are the most compact. |
|||
Formally, given a set of data points ''x'', the ''k'' centers ''ci'' are to be chosen so as to minimize the sum of the squared distances from x to the nearest ci. |
|||
The problem constitutes a better measure for the [[k-means]] clustering algorithm, and is widely used in applications such as [[facility location]]<ref> |
|||
http://www.aladdin.cs.cmu.edu/reu/mini_probes/papers/facilitylocation.ppt</ref>. |
|||
==References== |
|||
{{reflist}} |
|||
{{math-stub}} |
|||
Latest revision as of 13:41, 4 October 2010
Redirect to: