Content deleted Content added
Citation bot (talk | contribs) m Alter: url. Add: pages, issue, volume. Removed parameters. Formatted dashes. | You can use this bot yourself. Report bugs here. | User-activated. |
MikkoMalinen (talk | contribs) m Added a scenario where balanced clustering can be used. |
||
Line 1:
'''Balanced clustering''' is a special case of [[Cluster analysis|clustering]] where, in the strictest sense, cluster sizes are constrained to <math>\lfloor {n\over k}\rfloor</math> or <math>\lceil{n \over k}\rceil</math>, where <math>n</math> is the number of points and <math>k</math> is the number of clusters.<ref>{{Cite journal|last=M. I. Malinen and P. Fränti|date=August 2014|title=Balanced k-Means for Clustering|url=|journal=Joint Int. Workshop on Structural, Syntactic, and Statistical Pattern Recognition (S+SSPR 2014), LNCS 8621|doi=|pmid=|access-date=}}</ref> A typical algorithm is balanced [[K-means clustering|k-means]], which minimizes [[Mean squared error|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<ref>{{Cite journal|last=L. Hagen and A. B. Kahng|date=1992|title=New spectral methods for ratio cut partitioning and clustering|url=|journal=IEEE Transactions on Computer-Aided Design|doi=|pmid=|access-date=}}</ref> and Ncut.<ref>{{Cite journal|author=J. Shi and J. Malik|date=2000|title=Normalized cuts and image segmentation|url=https://repository.upenn.edu/cis_papers/107|journal=IEEE Transactions on Pattern Analysis and Machine Intelligence|volume=22|issue=8|pages=888–905|doi=10.1109/34.868688}}</ref> Balanced clustering can be used for example in scenarios where freight has to be delivered to <math>n</math> locations with <math>k</math> cars. It is then preferred that each car delivers to an equal number of locations.
== Software ==
| |||