Asymptotic Properties of Clustering Algorithms,

Abstract

Suppose a sample of size n is observed from the d-dimensional density f. Conditions are given which insure that a single-linkage clustering algorithm can asymptotically find the decomposition of the support of f into connected closed sets. (Author)

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Jun 01, 1977
Accession Number
ADA042888

Entities

People

  • L. P. Devroye
  • T. J. Wagner

Organizations

  • University of Texas at Austin

Tags

Communities of Interest

  • Biomedical

DTIC Thesaurus Topics

  • Air Force
  • Algorithms
  • Clustering
  • Computers
  • Decomposition
  • Electrical Engineering
  • Engineering
  • Image Processing
  • Observation
  • Pattern Recognition
  • Probability
  • Random Variables
  • Recognition
  • Scientific Research

Fields of Study

  • Mathematics

Readers

  • Operations Research
  • Statistical inference.