A least squares algorithm for a mixture model for compositional data
β Scribed by Ab Mooijaart; Peter G.M. van der Heijden; L.Andries van der Ark
- Publisher
- Elsevier Science
- Year
- 1999
- Tongue
- English
- Weight
- 136 KB
- Volume
- 30
- Category
- Article
- ISSN
- 0167-9473
No coin nor oath required. For personal study only.
β¦ Synopsis
The estimation of a model for compositional data is studied where the data are approximated by a mixture of latent compositions. This model is variously known as "endmember analysis" or "latent budget analysis". Two estimation procedures are available. The ΓΏrst uses a procedure which is incorrect in the sense that, although it claims to be a least squares procedure, it does not always minimize a least squares criterion. The second uses a maximum likelihood procedure starting from assumptions that are often violated for compositional data. In this paper we propose a constrained (weighted) least squares procedure for the estimation of the model.
π SIMILAR VOLUMES
We apply Dykstra's alternating projection algorithm to the constrained least-squares matrix problem that arises naturally in statistics and mathematical economics. In particular, we are concerned with the problem of finding the closest symmetric positive definite bounded and patterned matrix, in the