
Accession Number : AD0751831
Title : An Optimization Algorithm for Cluster Analysis,
Corporate Author : RAND CORP SANTA MONICA CALIF
Personal Author(s) : Roach,Chris
Report Date : AUG 1972
Pagination or Media Count : 15
Abstract : Given a set of N points and distances between all points, the paper presents an algorithm for determining an optimal partition of the points into k mutually exclusive and exhaustive subsets or clusters according to an objective function defined on the set of all partitions. The value of the objective function for a given partition is defined as the maximum withincluster distance in the partition. The algorithm determines an optimal partition by solving a sequence of setcovering problems. The setcovering problems have no more than N constraints and typically less than 1.5N variables. (Author)
Descriptors : (*MATHEMATICAL PROGRAMMING, ALGORITHMS), OPTIMIZATION, SET THEORY, THEOREMS
Subject Categories : Operations Research
Distribution Statement : APPROVED FOR PUBLIC RELEASE