Suche

Wo soll gesucht werden?
Erweiterte Literatursuche

Ariadne Pfad:

Inhalt

Literaturnachweis - Detailanzeige

 
Autor/inJeon, Minjeong
TitelEstimation of Complex Generalized Linear Mixed Models for Measurement and Growth
Quelle(2012), (129 Seiten)
PDF als Volltext Verfügbarkeit 
Ph.D. Dissertation, University of California, Berkeley
Spracheenglisch
Dokumenttypgedruckt; online; Monographie
ISBN978-1-2679-7362-7
SchlagwörterHochschulschrift; Dissertation; Hierarchical Linear Modeling; Computation; Measurement; Maximum Likelihood Statistics; Monte Carlo Methods; Item Response Theory; Markov Processes; Bayesian Statistics; Longitudinal Studies; Comparative Analysis; Correlation; Self Esteem; Students; Foreign Countries; South Korea
AbstractMaximum likelihood (ML) estimation of generalized linear mixed models (GLMMs) is technically challenging because of the intractable likelihoods that involve high dimensional integrations over random effects. The problem is magnified when the random effects have a crossed design and thus the data cannot be reduced to small independent clusters. A variety of methods have been developed for approximating the intractable likelihood functions, but there seems no method yet that is both computationally efficient and accurate in a wide range of situations. In this dissertation, I consider new estimation methods and applications of complex GLMMs for measurement and growth. The dissertation consists of three papers, 1) Variational maximization-maximization (MM) algorithm, 2) Monte Carlo local likelihood (MCLL) estimation, and 3) Autoregressive item response theory (IRT) growth model for longitudinal item analysis. In the first and second papers, I develop two ML methods for estimating GLMMs with crossed random effects. The variational MM algorithm is a modified expectation-maximization (EM) algorithm where a variational density is introduced in the expectation (E) step to approximate the true posterior density of the random effects given the data. The E-step is replaced by another maximization step that minimizes the Kullback-Leibler (KL) divergence between the posterior and the variational density, or equivalently, maximizes the lower bound of the log-likelihood with respect to the variational distribution. The MCLL algorithm uses the posterior samples of model parameters obtained from Markov chain Monte Carlo (MCMC) for likelihood inference. The posterior density is estimated by local likelihood density estimation and the likelihood function is approximated up to a constant by the local likelihood density estimate of the posterior divided by the prior. The performance of these new algorithms is evaluated using simulation and empirical studies and compared with other ML and Bayesian estimators. In the third paper, a new autoregressive IRT growth model is proposed to take into account serial correlations among responses to the same items over time. The consequences of ignoring serial dependence and the initial conditions problem are investigated using simulations. The new model is applied to longitudinal data of Korean students' self-esteem. [The dissertation citations contained here are published with the permission of ProQuest LLC. Further reproduction is prohibited without permission. Copies of dissertations may be obtained by Telephone (800) 1-800-521-0600. Web page: http://www.proquest.com/en-US/products/dissertations/individuals.shtml.] (As Provided).
AnmerkungenProQuest LLC. 789 East Eisenhower Parkway, P.O. Box 1346, Ann Arbor, MI 48106. Tel: 800-521-0600; Web site: http://www.proquest.com/en-US/products/dissertations/individuals.shtml
Erfasst vonERIC (Education Resources Information Center), Washington, DC
Update2020/1/01
Literaturbeschaffung und Bestandsnachweise in Bibliotheken prüfen
 

Standortunabhängige Dienste
Die Wikipedia-ISBN-Suche verweist direkt auf eine Bezugsquelle Ihrer Wahl.
Tipps zum Auffinden elektronischer Volltexte im Video-Tutorial

Trefferlisten Einstellungen

Permalink als QR-Code

Permalink als QR-Code

Inhalt auf sozialen Plattformen teilen (nur vorhanden, wenn Javascript eingeschaltet ist)

Teile diese Seite: