Equi-sized, Homogeneous Partitioning
We consider the problem of partitioning a data set of n data objects into c homogeneous subsets (that is, data objects in the same subset should be similar to each other), such that each subset is of approximately the same size. This problem has applications wherever a population has to be distributed among a limited number of resources and the workload for each resource shall be balanced. We modify an existing clustering algorithm in this respect, present some empirical evaluation and discuss the results.
Unable to display preview. Download preview PDF.