K-median problem: Difference between revisions
Content deleted Content added
No edit summary |
replace by redirect to k-medians clustering |
||
| (3 intermediate revisions by 3 users not shown) | |||
| Line 1: | Line 1: | ||
#REDIRECT [[k-medians clustering]] |
|||
{{DISPLAYTITLE|''k''-median problem}} |
|||
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 ''c''<sub>''i''</sub> are to be chosen so as to minimize the sum of the distances from each ''x'' to the nearest ''c''<sub>''i''</sub>. |
|||
The problem constitutes a better measure for the [[k-means clustering|''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}} |
|||
{{statistics-stub}} |
|||
[[Category:Statistics]] |
|||
Latest revision as of 13:41, 4 October 2010
Redirect to: