CLUSTER ANALYSIS AND MATHEMATICAL PROGRAMMING

Abstract

Cluster analysis involves the problem of optimal partitioning of a given set of entities into a pre-assigned number of mutually exclusive and exhaustive clusters. Here the problem is formulated in two different ways with the distance function (a) of minimizing the within groups sums of squares and (b) minimizing the maximum distance within groups. These lead to different kinds of linear and non-linear (0-1) integer programming problems. Computational difficulties are discussed.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Oct 01, 1969
Accession Number
AD0697267

Entities

People

  • M. R. Rao

Organizations

  • Carnegie Mellon University

Tags

Communities of Interest

  • Materials and Manufacturing Processes

DTIC Thesaurus Topics

  • Abstracts
  • Algorithms
  • Computations
  • Computer Programming
  • Convex Programming
  • Dynamic Programming
  • Evolutionary Algorithms
  • Integer Programming
  • Linear Programming
  • Mathematical Programming
  • Military Research
  • Nonlinear Programming
  • Operations Research
  • Schools
  • Universities

Fields of Study

  • Mathematics

Readers

  • Operations Research
  • Regression Analysis.