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.

Unable to display preview. Download preview PDF.


  1. 1.
    Jain, A.K., Dubes, R.C.: Algorithms for Clustering Data. Prentice-Hall, Englewood Cliffs (1988)zbMATHGoogle Scholar
  2. 2.
    Bezdek, J.C.: Pattern Recognition with Fuzzy Objective Function Algorithms. Plenum Press, New York (1981)zbMATHGoogle Scholar
  3. 3.
    Höppner, F., Klawonn, F., Kruse, R., Runkler, T.A.: Fuzzy Cluster Analysis. John Wiley & Sons, Chichester (1999)zbMATHGoogle Scholar
  4. 4.
    Klawonn, F., Höppner, F.: What is fuzzy about fuzzy clustering? – Understanding and improving the concept of the fuzzifier. In: Advances in Intelligent Data Analysis, pp. 254–264. Springer, Heidelberg (2003)CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  • Frank Klawonn
    • 1
  • Frank Höppner
    • 2
  1. 1.Department of Computer ScienceUniversity of Applied Sciences Braunschweig /WolfenbüttelWolfenbüttelGermany
  2. 2.Department of EconomicsUniversity of Applied Sciences Braunschweig /WolfenbüttelWolfsburgGermany

Personalised recommendations