Advertisement

Discussion by J.A. Hartigan

  • Eric D. Feigelson
  • G. Jogesh Babu

Abstract

Dr. Murtagh paints a grim picture of the typical astronomical database, containing data of various types and complexity from various sources with varying reliability. And I do not think much comfort is available in standard statistical theory for handling such data; most multivariate analysis presupposes data to be in a rectangular data matrix and begins by assuming that points are sampled independently from some population. So, yes, usually we begin by getting data into shape by crude procrustean means, lopping off bits of data in one place, and interpolating bits of data elsewhere.

Keywords

Cluster Center Minimum Span Tree Under Sampling Gradient Line Normal Mixture Model 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Everitt, B.S. and Hand. D.J. Finite Mixture Distributions. Chapman and Hall (London), 1981.MATHGoogle Scholar
  2. Hartigan, J.A. Consistency of single linkage for high density clusters. Journal of the American Statistical Association 76: 388–394, 1981.MathSciNetMATHCrossRefGoogle Scholar
  3. Pollard, D. A central limit theorem for k-means clustering. Annals of Statistics 10: 919–926, 1982.MathSciNetMATHGoogle Scholar

Copyright information

© Springer-Verlag New York, Inc. 1992

Authors and Affiliations

  • Eric D. Feigelson
    • 1
  • G. Jogesh Babu
    • 2
  1. 1.Department of Astronomy and AstrophysicsPennsylvania State UniversityUSA
  2. 2.Department of StatisticsPennsylvania State UniversityUSA

Personalised recommendations