Parameter estimation for grouped data using EM and MCEM algorithms

Nowadays, the confidentiality of data and information is of great importance for many companies and organizations. For this reason, they may prefer not to release exact data, but instead to grant researchers access to approximate data. For example, rather than providing the exact measurements of the...

Full description

Saved in:
Bibliographic Details
Published inCommunications in statistics. Simulation and computation Vol. 53; no. 8; pp. 3616 - 3637
Main Authors AghahosseinaliShirazi, Zahra, da Silva, João Pedro A. R., de Souza, Camila P. E.
Format Journal Article
LanguageEnglish
Published Philadelphia Taylor & Francis 02.08.2024
Taylor & Francis Ltd
Subjects
Online AccessGet full text
ISSN0361-0918
1532-4141
DOI10.1080/03610918.2022.2108843

Cover

More Information
Summary:Nowadays, the confidentiality of data and information is of great importance for many companies and organizations. For this reason, they may prefer not to release exact data, but instead to grant researchers access to approximate data. For example, rather than providing the exact measurements of their clients, they may only provide researchers with grouped data, that is, the number of clients falling in each of a set of non-overlapping measurement intervals. The challenge is to estimate the mean and variance structure of the hidden ungrouped data based on the observed grouped data. To tackle this problem, this work considers the exact observed data likelihood and applies the Expectation-Maximization (EM) and Monte Carlo EM (MCEM) algorithms for cases where the hidden data follow a univariate, bivariate, or multivariate normal distribution. Simulation studies are conducted to evaluate the performance of the proposed EM and MCEM algorithms. The well-known Galton data set is considered as an application example.
Bibliography:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:0361-0918
1532-4141
DOI:10.1080/03610918.2022.2108843