Finite mixtures of distributions with common central moments
Let ℱ = {F} be a family of n-variate cumulative distribution functions (c.d.f.'s). If F₁...,F(k) belong to ℱ and P₁,...,P(k) are positive numbers that sum to 1, then the convex combination M(x₁ ,. . . , x(n)) = [formula omitted](x₁,...,x(n)) is called a finite mixture generated by ℱ. The F₁,…,...
Main Author: | |
---|---|
Language: | English |
Published: |
University of British Columbia
2011
|
Subjects: | |
Online Access: | http://hdl.handle.net/2429/37425 |
id |
ndltd-UBC-oai-circle.library.ubc.ca-2429-37425 |
---|---|
record_format |
oai_dc |
spelling |
ndltd-UBC-oai-circle.library.ubc.ca-2429-374252018-01-05T17:48:49Z Finite mixtures of distributions with common central moments Rennie, Robert Richard Distribution (Probability theory) Let ℱ = {F} be a family of n-variate cumulative distribution functions (c.d.f.'s). If F₁...,F(k) belong to ℱ and P₁,...,P(k) are positive numbers that sum to 1, then the convex combination M(x₁ ,. . . , x(n)) = [formula omitted](x₁,...,x(n)) is called a finite mixture generated by ℱ. The F₁,…,F(k) are called the components of the mixture and the P₁,…,P(k) are called their weights, respectively. The mixture M(x₁,...,x(n)) is said to be identifiable with respect to ℱ if no other convex combination of a finite number of c.d.f.'s from ℱ will generate M(x₁,...,x(n)). We establish the identiflability of mixtures consisting of at most k components when the components belong to a family of univariate c.d.f.'s that have the following properties: (a) no two c.d.f.'s have the same mean; (b) each c.d.f. has the same r(th) central moment for r = 1,...,2k-1; and (c) the first 2k-1 central moments are finite. If the mixture and the 2k-1 central moments are known, a solution for the weights and means of the components is given. If a random sample is taken from the mixture, then asymptotically normal estimates of the weights and means are given, providing the 2k-1 central moments are known. Matrix mixtures are introduced and are found to be of use in estimating the density functions and c.d.f.'s of the components. In the .case of the above family, the estimates of the density functions are shown to have an asymptotically normal distribution. Consistent and least squares estimates are obtained for the component c.d.f.'s. We show that for multivariate mixtures identifiability of any one of the marginal mixtures implies the identifiability of the multivariate mixture, but not conversely. Finally, the univariate results are generalized to the multivariate case, and an example of the use of matrix mixtures is given. Science, Faculty of Mathematics, Department of Graduate 2011-09-16T20:21:03Z 2011-09-16T20:21:03Z 1968 Text Thesis/Dissertation http://hdl.handle.net/2429/37425 eng For non-commercial purposes only, such as research, private study and education. Additional conditions apply, see Terms of Use https://open.library.ubc.ca/terms_of_use. University of British Columbia |
collection |
NDLTD |
language |
English |
sources |
NDLTD |
topic |
Distribution (Probability theory) |
spellingShingle |
Distribution (Probability theory) Rennie, Robert Richard Finite mixtures of distributions with common central moments |
description |
Let ℱ = {F} be a family of n-variate cumulative distribution functions (c.d.f.'s). If F₁...,F(k) belong to ℱ and P₁,...,P(k) are positive numbers that sum to 1, then the convex combination M(x₁ ,. . . , x(n)) = [formula omitted](x₁,...,x(n)) is called a finite mixture generated by ℱ. The F₁,…,F(k) are called the components of the mixture and the P₁,…,P(k) are called their weights, respectively. The mixture M(x₁,...,x(n)) is said to be identifiable with respect to ℱ if no other convex combination of a finite number of c.d.f.'s from ℱ will generate M(x₁,...,x(n)).
We establish the identiflability of mixtures consisting of at most k components when the components belong to a family of univariate c.d.f.'s that have the following properties: (a) no two c.d.f.'s have the same mean; (b) each c.d.f. has the same r(th) central moment for r = 1,...,2k-1; and (c) the first 2k-1 central moments are finite. If the mixture and the 2k-1 central moments are known, a solution for the weights and means of the components is given. If a random sample is taken from the mixture, then asymptotically normal estimates of the weights and means are given, providing the 2k-1 central moments are known.
Matrix mixtures are introduced and are found to be of use in estimating the density functions and c.d.f.'s of the components. In the .case of the above family, the estimates of the density functions are shown to have an asymptotically normal distribution. Consistent and least squares estimates are obtained for the component c.d.f.'s.
We show that for multivariate mixtures identifiability of any one of the marginal mixtures implies the identifiability of the multivariate mixture, but not conversely. Finally, the univariate results are generalized to the multivariate case, and an example of the use of matrix mixtures is given. === Science, Faculty of === Mathematics, Department of === Graduate |
author |
Rennie, Robert Richard |
author_facet |
Rennie, Robert Richard |
author_sort |
Rennie, Robert Richard |
title |
Finite mixtures of distributions with common central moments |
title_short |
Finite mixtures of distributions with common central moments |
title_full |
Finite mixtures of distributions with common central moments |
title_fullStr |
Finite mixtures of distributions with common central moments |
title_full_unstemmed |
Finite mixtures of distributions with common central moments |
title_sort |
finite mixtures of distributions with common central moments |
publisher |
University of British Columbia |
publishDate |
2011 |
url |
http://hdl.handle.net/2429/37425 |
work_keys_str_mv |
AT rennierobertrichard finitemixturesofdistributionswithcommoncentralmoments |
_version_ |
1718595904045318144 |