K-medians clustering
id:
k-medians-clustering-167-16964919
title:
K-medians clustering
text:
In statistics, k-medians clustering is a cluster analysis algorithm. It is a variation of k-means clustering where instead of calculating the mean for each cluster to determine its centroid, one instead calculates the median. This has the effect of minimizing error over all clusters with respect to the 2-norm distance metric, as opposed to the squared 2-norm distance metric. This relates directly to the k-median problem which is the problem of finding k centers such that the clusters formed by t
brand slug:
wiki
category slug:
encyclopedia
description:
Cluster analysis algorithm
original url:
https://en.wikipedia.org/wiki/K-medians_clustering
date created:
2007-07-03T13:46:38Z
date modified:
2024-08-30T16:12:32Z
main entity:
{"identifier":"Q4041956","url":"https://www.wikidata.org/entity/Q4041956"}
image:
fields total:
13
integrity:
15