Optimal clustering: A model and method

Gary Klein and Jay E. Aronson

Naval Research Logistics (NRL), 1991, vol. 38, issue 3, 447-461

Abstract: Classifying items into distinct groupings is fundamental in scientific inquiry. The objective of cluster analysis is to assign n objects to up to K mutually exclusive groups while minimizing some measure of dissimilarity among the items. Few mathematical programming approaches have been applied to these problems. Most clustering methods to date only consider lowering the amount of interaction between each observation and the group mean or median. Clustering used in information systems development to determine groupings of modules requires a model that will account for the total group interaction. We formulate a mixed‐integer programming model for optimal clustering based upon scaled distance measures to account for this total group interaction. We discuss an efficient, implicit enumeration algorithm along with some implementation issues, a method for computing tight bounds for each node in the solution tree, and a small example. A computational example problem, taken from the computer‐assisted process organization (CAPO) literature, is presented. Detailed computational results indicate that the method is effective for solving this type of cluster analysis problem.

Date: 1991
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (3)

Downloads: (external link)
https://doi.org/10.1002/1520-6750(199106)38:33.0.CO;2-0

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:wly:navres:v:38:y:1991:i:3:p:447-461

Access Statistics for this article

More articles in Naval Research Logistics (NRL) from John Wiley & Sons
Bibliographic data for series maintained by Wiley Content Delivery ().