Cover: An Optimization Algorithm for Cluster Analysis.

An Optimization Algorithm for Cluster Analysis.

Published 1972

by C. D. Roach

Purchase Print Copy

 Format Price
Add to Cart Paperback14 pages $20.00

Given a set of [N] points and distances between all points, this 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 within-cluster distance in the partition. The algorithm determines an optimal partition by solving a sequence of set-covering problems, which have no more than [N] constraints and typically less than 1.5 [N] variables. 14 pp. Ref.

This report is part of the RAND paper series. The paper was a product of RAND from 1948 to 2003 that captured speeches, memorials, and derivative research, usually prepared on authors' own time and meant to be the scholarly or scientific contribution of individual authors to their professional fields. Papers were less formal than reports and did not require rigorous peer review.

This document and trademark(s) contained herein are protected by law. This representation of RAND intellectual property is provided for noncommercial use only. Unauthorized posting of this publication online is prohibited; linking directly to this product page is encouraged. Permission is required from RAND to reproduce, or reuse in another form, any of its research documents for commercial purposes. For information on reprint and reuse permissions, please visit www.rand.org/pubs/permissions.

RAND is a nonprofit institution that helps improve policy and decisionmaking through research and analysis. RAND's publications do not necessarily reflect the opinions of its research clients and sponsors.