An alternative to classical latent class models selection methods for sparse binary data: an illustration with simulated data
Guardado en:
| Autor: | |
|---|---|
| Formato: | artículo original |
| Estado: | Versión publicada |
| Fecha de Publicación: | 2017 |
| Descripción: | Within the context of a latent class model with manifest binary variables, we propose an alternative method that solves the problem of estimating empirical distribution with sparse contingency tables and the chi-square approximation for goodness-of-fit will not be valid. We analyze sparse binary data, where there are many response patterns with very small expected frequencies in several data sets varying in degree of sparseness from 1 to 5 defined d = n/2p = n/R is a factor that is mentioned in almost all prior literature as being an important determinant of how well the distribution is represented by the chi-squared.The proposed approach produced results that were valid and reliable under the mentioned problematic data conditions. Results from the proposal presented compare the rates of Type I for traditional goodness-of-fit tests. We also show that with data density d ≤ 5, Pearson’s statistic (χ2) should not be used to select latent class models using the Patterns Method, given that this has the probability of Type I error being greater than 5%. By comparing the Patterns Method and the Parametric Bootstrap for data density d = 2, we show that the Patterns Method has more accurate Type I error probabilities since the likelihood ratio, Read-Cressie and Freeman-Tukey statistics afford values of α < 0.05. In contrast, the Parametric Bootstrap provides values in these statistics that surpass 5%. |
| País: | Portal de Revistas UCR |
| Institución: | Universidad de Costa Rica |
| Repositorio: | Portal de Revistas UCR |
| Lenguaje: | Inglés |
| OAI Identifier: | oai:portal.ucr.ac.cr:article/22448 |
| Acceso en línea: | https://revistas.ucr.ac.cr/index.php/matematica/article/view/22448 |
| Palabra clave: | sparse data latent class goodness-of-fit binary data datos escasos clases latentes bondad de ajuste datos binarios |