A Recursive Partitioning Algorithm for Cluster Analysis,

Abstract

In 1965, A.W.F. Edwards and L.L. Cavalli-Sforza introduced a method for cluster analysis based on a recursive partitioning strategy over a minimum-variance clustering criterion. Although this method has been called intuitively appealing, it was dismissed by Gower (1967) and others because of its computational infeasibility. It has been suggested on numerous occasions that some computationally efficient method be found to search an intelligently-chosen subset of the set of all possible partitions for a (hopefully) near-optimal solution. In this paper, one such method is introduced which borrows from the Classification and Regression Trees (CART) classification paradigm of Breiman, Friedman, Olshen and Stone (1984).

Document Details

Document Type
Technical Report
Publication Date
Jan 01, 1992
Accession Number
ADP007174

Entities

People

  • Joseph S. Costa Jr

Tags

DTIC Thesaurus Topics

  • Algorithms
  • Classification
  • Clustering
  • Computer Science
  • Data Science
  • Engineering
  • Information Science
  • Mathematics
  • Statistics
  • Theoretical Computer Science

Fields of Study

  • Computer science

Readers

  • Adaptive Control and Estimation with Uncertainty in Dynamic Systems.
  • Regression Analysis.