Mixture Decomposition of Distributions by Copulas

  • Edwin Diday
Part of the Studies in Classification, Data Analysis, and Knowledge Organization book series (STUDIES CLASS)


Each unit is described by a vector of p distributions each one associated to one of p variables. Our aim is to find simultaneously a “good” partition of these units and a model using “copulas” associated to each class of this partition. Different copulas models are recalled. The mixture decomposition problem is settled in this general case. It extends the standard mixture decomposition problem to the case where each unit is described by a vector of distributions instead as usual, by a vector of a single (categorical or numerical) values. Several generalization of standard algorithms are suggested. All these results are first considered in the case of a single variable and then extended to the case of a vector of p variables by using a top-down binary tree approach.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. BOCK H.H. and DIDAY E. (eds.) (2000): Analysis of Symbolic Data.Exploratory methods for extracting statistical information from complex data. Springer Verlag, Heidelberg, 425.Google Scholar
  2. CLAYTON D.G. (1978): A model for association in bivariate life tables. Biometrika, 65, 141–151.MathSciNetzbMATHCrossRefGoogle Scholar
  3. DEMPSTER A.P., LAIRD N.M. and RUBIN D.B. (1977): Mixture densities, maximum likelihood from incomplete data via the EM algorithm. Journal of the Royal Stat. Society, 39, 1, 1–38.MathSciNetzbMATHGoogle Scholar
  4. DIDAY E. (2001): A generalisation of the mixture decomposition problem in the symbolic data analysis framework. Ceremade report n °0112. May 2001, 14 pages University Paris IX Dauphine.Google Scholar
  5. DIDAY E. (1998): Extracting Information from Multivalued Surveys or from Very Extensive Data Sets by Symbolic Data Analysis Advances in Methodology, Data Analysis and Statistics. Anuska Ferligoj (Editor), Metodoloski zveski, 14. ISBN 86–80227–85–4.Google Scholar
  6. DIDAY E., OK Y. and Schroeder A. (1974): The dynamic clusters method in Pattern Recognition. Proceedings of IFIP Congress, Stockolm.Google Scholar
  7. JAIN A.K. and DUBES R.C. (1988): Algorithms for Clustering Data. Prentice Hall Advanced Reference Series.zbMATHGoogle Scholar
  8. JANOWITZ M. and SCHWEITZER B. (1989): Ordinal and percentile clustering. Math. Social Sciences, 18.Google Scholar
  9. Nelsen R.B. (1998): An introduction to Copulas in Lecture Notes in Statistics. Springer Verlag.Google Scholar
  10. SCHWEITZER B. and SKLAR A. (1983): Probabilist Metric Spaces. Elsever North-Holland, New-York.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2002

Authors and Affiliations

  • Edwin Diday
    • 1
  1. 1.CEREMADEParis IX Dauphine UniversityFrance

Personalised recommendations