Literature DB >> 23794772

Two algorithms for fitting constrained marginal models.

R J Evans1, A Forcina.   

Abstract

The two main algorithms that have been considered for fitting constrained marginal models to discrete data, one based on Lagrange multipliers and the other on a regression model, are studied in detail. It is shown that the updates produced by the two methods are identical, but that the Lagrangian method is more efficient in the case of identically distributed observations. A generalization is given of the regression algorithm for modelling the effect of exogenous individual-level covariates, a context in which the use of the Lagrangian algorithm would be infeasible for even moderate sample sizes. An extension of the method to likelihood-based estimation under L1-penalties is also considered.

Entities:  

Keywords:  L1-penalty; categorical data; marginal log-linear model; maximum likelihood; non-linear constraint

Year:  2013        PMID: 23794772      PMCID: PMC3686142          DOI: 10.1016/j.csda.2013.02.001

Source DB:  PubMed          Journal:  Comput Stat Data Anal        ISSN: 0167-9473            Impact factor:   1.681


  2 in total

1.  Marginal log-linear parameters for graphical Markov models.

Authors:  Robin J Evans; Thomas S Richardson
Journal:  J R Stat Soc Series B Stat Methodol       Date:  2013-09-01       Impact factor: 4.488

2.  Regularization Paths for Generalized Linear Models via Coordinate Descent.

Authors:  Jerome Friedman; Trevor Hastie; Rob Tibshirani
Journal:  J Stat Softw       Date:  2010       Impact factor: 6.440

  2 in total
  1 in total

1.  Marginal log-linear parameters for graphical Markov models.

Authors:  Robin J Evans; Thomas S Richardson
Journal:  J R Stat Soc Series B Stat Methodol       Date:  2013-09-01       Impact factor: 4.488

  1 in total

北京卡尤迪生物科技股份有限公司 © 2022-2023.