Abstract
Recall that the objective in solving the cluster problem is to determine the optimal partitioning of n objects into m disjoint subsets in such a manner that a certain criterion of homogeneity within clusters is satisfied. A way of accomplishing this objective as discussed in Chapter 2 is by complete enumeration, i.e., examine the homogeneity criterion for all possible partitions into m clusters and choose that one which is optimal. Unfortunately, the method of complete enumeration is in general impractical, even for small values of n and m.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 1974 Springer-Verlag Berlin · Heidelberg
About this chapter
Cite this chapter
Odell, P.L., Duran, B.S. (1974). Mathematical Programming and Cluster Analysis. In: Cluster Analysis. Lecture Notes in Economics and Mathematical Systems, vol 100. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-46309-9_3
Download citation
DOI: https://doi.org/10.1007/978-3-642-46309-9_3
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-06954-6
Online ISBN: 978-3-642-46309-9
eBook Packages: Springer Book Archive