Balanced clustering
id:
balanced-clustering-277-13358318
title:
Balanced clustering
text:
Balanced clustering is a special case of clustering where, in the strictest sense, cluster sizes are constrained to ⌊ n k ⌋ or ⌈ n k ⌉ , where n is the number of points and k is the number of clusters. A typical algorithm is balanced k-means, which minimizes mean square error (MSE). Another type of balanced clustering called balance-driven clustering has a two-objective cost function that minimizes both the imbalance and the MSE. Typical cost functions are ratio cut and Ncut. Balanced clustering
brand slug:
wiki
category slug:
encyclopedia
description:
original url:
https://en.wikipedia.org/wiki/Balanced_clustering
date created:
date modified:
2023-07-14T09:43:03Z
main entity:
{"identifier":"Q25304891","url":"https://www.wikidata.org/entity/Q25304891"}
image:
fields total:
13
integrity:
13