Traditional multilevel model assumed independence between groups. Datasets are different from traditional hierarchical data when it is grouped by geographical units. The individual is influenced by not only its region...
详细信息
ISBN:
(纸本)9781479921867
Traditional multilevel model assumed independence between groups. Datasets are different from traditional hierarchical data when it is grouped by geographical units. The individual is influenced by not only its region but also the adjacent regions. It could include spatial dependence between groups. Therefore, it is necessary to build a new model and estimation method. In this paper, spatial statistics and spatial econometric models are introduced to random intercept model. Spatial dependence is reflected by spatial lag model in traditional level-2 model. Four types of parameters which include fixed effects, random level-1 coefficients, variance-covariance components, and spatial correlation error parameter need to estimate. Maximum likelihood estimation based on EM algorithm and fisher scoring algorithm for improved random intercept model is employed.
We review the fisherscoring and EM algorithms for incomplete multivariate data from an estimating function point of view, and examine the corresponding quasi-score functions under second-moment assumptions. A bias-co...
详细信息
We review the fisherscoring and EM algorithms for incomplete multivariate data from an estimating function point of view, and examine the corresponding quasi-score functions under second-moment assumptions. A bias-corrected REML-type estimator for the covariance matrix is derived, and the fisher, Godambe and empirical sandwich information matrices are compared. We make a numerical investigation of the two algorithms, and compare with a hybrid algorithm, where fisherscoring is used for the mean vector and the EM algorithm for the covariance matrix. (C) 2011 Elsevier B.V. All rights reserved.
In this paper, we introduce a Bayesian analysis for mixture of distributions belonging to the exponential family. As a special case we consider a mixture of normal exponential distributions including joint modeling of...
详细信息
In this paper, we introduce a Bayesian analysis for mixture of distributions belonging to the exponential family. As a special case we consider a mixture of normal exponential distributions including joint modeling of the mean and variance. We also consider joint modeling of the mean and variance heterogeneity. Markov Chain Monte Carlo (MCMC) methods are used to obtain the posterior summaries of interest. We also introduce and apply an EM algorithm, where the maximization is obtained applying the fisher scoring algorithm. Finally, we also include analysis of real data sets to illustrate the proposed methodology. (C) 2011 Elsevier Inc. All rights reserved.
In this article, we consider the maximum likelihood estimation of two commonly used overdispersion models, namely, the Dirichlet-multinomial distribution (DM), due to Mosimann (Biometrika 49 (1962) 65), and a finite m...
详细信息
In this article, we consider the maximum likelihood estimation of two commonly used overdispersion models, namely, the Dirichlet-multinomial distribution (DM), due to Mosimann (Biometrika 49 (1962) 65), and a finite mixture distribution (FM) proposed by Morel and Nagaraj (Biometrika 80 (1993) 363), and Neerchal and Morel (J. Amer. Statist. Assoc. 93 (1998) 1078). These models have been successfully used in the literature for modeling overdispersion in multinomial data. Maximum likelihood estimation of the parameters of these models using the classical fisherscoring method poses certain computational challenges. In the case of DM, the challenges are overcome by noting that the fisher information matrix can be computed using the beta-binomial distribution (BB), which is the univariate version of DIM. On the other hand, in the case of FM, an approximation theorem call be used to obtain a two-stage procedure for computing the maximum likelihood estimates. Simulation results show that the two-stage procedure is faster without loosing any accuracy. (C) 2004 Elsevier B.V. All rights reserved.
Kriging is a popular analysis approach for computer experiments for the purpose of creating a cheap-to-compute "meta-model" as a surrogate to a computationally expensive engineering simulation model. The max...
详细信息
Kriging is a popular analysis approach for computer experiments for the purpose of creating a cheap-to-compute "meta-model" as a surrogate to a computationally expensive engineering simulation model. The maximum likelihood approach is used to estimate the parameters in the kriging model. However, the likelihood function near the optimum may be flat in some situations, which leads to maximum likelihood estimates for the parameters in the covariance matrix that have very large variance. To overcome this difficulty, a penalized likelihood approach is proposed for the kriging model. Both theoretical analysis and empirical experience using real world data suggest that the proposed method is particularly important in the context of a computationally intensive simulation model where the number of simulation runs must be kept small because collection of a large sample set is prohibitive. The proposed approach is applied to the reduction of piston slap, an unwanted engine noise due to piston secondary motion. Issues related to practical implementation of the proposed approach are discussed.
Multi-layer perceptrons (MLPs), a common type of artificial neural networks (ANNs), are widely used in computer science and engineering for object recognition, discrimination and classification, and have more recently...
详细信息
Multi-layer perceptrons (MLPs), a common type of artificial neural networks (ANNs), are widely used in computer science and engineering for object recognition, discrimination and classification, and have more recently found use in process monitoring and control. "Training" such networks is not a straightforward optimisation problem, and we examine features of these networks which contribute to the optimisation difficulty. Although the original "perceptron", developed in the late 1950s (Rosenblatt 1958, Widrow and Hoff 1960), had a binary output from each "node", this was not compatible with back-propagation and similar training methods for the MLP. Hence the output of each node (and the final network output) was made a differentiable function of the network inputs. We reformulate the MLP model with the original perceptron in mind so that each node in the "hidden layers" can be considered as a latent (that is, unobserved) Bernoulli random variable. This maintains the property of binary output from the nodes, and with an imposed logistic regression of the hidden layer nodes on the inputs, the expected output of our model is identical to the MLP output with a logistic sigmoid activation function (for the case of one hidden layer). We examine the usual MLP objective function-the sum of squares-and showits multi-modal form and the corresponding optimisation difficulty. We also construct the likelihood for the reformulated latent variable model and maximise it by standard finite mixture ML methods using an EM algorithm, which provides stable ML estimates from random starting positions without the need for regularisation or cross-validation. Over-fitting of the number of nodes does not affect this stability. This algorithm is closely related to the EM algorithm of Jordan and Jacobs (1994) for the Mixture of Experts model. We conclude with some general comments on the relation between the MLP and latent variable models.
In this article, we show that, if subjects are assumed to be homogeneous within it finite set of latent classes, the basic restrictions of the Rasch model (conditional independence and unidimensionality) can be relaxe...
详细信息
In this article, we show that, if subjects are assumed to be homogeneous within it finite set of latent classes, the basic restrictions of the Rasch model (conditional independence and unidimensionality) can be relaxed in a flexible way by simply adding appropriate columns to a basic design matrix. When discrete covariates are available so that subjects may be classified into strata, we show how a joint modeling approach can achieve greater parsimony. Parameter estimates may be obtained by maximizing the conditional likelihood (given the total number of captures) with a combined use of the EM and fisher scoring algorithms. We also discuss a technique for obtaining confidence intervals for the size of the population under study based on the profile likelihood.
A popular approach to estimation based on incomplete data is the EM algorithm. For categorical data, this paper presents a simple expression of the observed data log-likelihood and its derivatives in terms of the comp...
详细信息
A popular approach to estimation based on incomplete data is the EM algorithm. For categorical data, this paper presents a simple expression of the observed data log-likelihood and its derivatives in terms of the complete data for a broad class of models and missing data patterns. We show that using the observed data likelihood directly is easy and has some advantages. One can gain considerable computational speed over the EM algorithm and a straightforward variance estimator is obtained for the parameter estimates. The general formulation treats a wide range of missing data problems in a uniform way. Two examples are worked out in full.
A likelihood based method is proposed for multivariate categorical data. It is assumed that, together with the marginal outcomes, the set of pairwise associations between outcomes is of scientific interest. The focus ...
详细信息
A likelihood based method is proposed for multivariate categorical data. It is assumed that, together with the marginal outcomes, the set of pairwise associations between outcomes is of scientific interest. The focus is on binary outcomes and it is indicated how the proposed method generalizes to categorical outcomes. A connection with second-order generalized estimating equations (GEE2) is established. The method is applied to analyze data from a developmental toxicity study.
Classical factor analysis assumes a random sample of vectors of observations. For clustered vectors of observations, such as data for students from colleges, or individuals within households, it may be necessary to co...
详细信息
Classical factor analysis assumes a random sample of vectors of observations. For clustered vectors of observations, such as data for students from colleges, or individuals within households, it may be necessary to consider different within-group and between-group factor structures. Such a two-level model for factor analysis is defined, and formulas for a scoringalgorithm for estimation with this model are derived. A simple noniterative method based on a decomposition of the total sums of squares and crossproducts is discussed. This method provides a suitable starting solution for the iterative algorithm, but it is also a very good approximation to the maximum likelihood solution. Extensions for higher levels of nesting are indicated. With judicious application of quasi-Newton methods, the amount of computation involved in the scoringalgorithm is moderate even for complex problems;in particular, no inversion of matrices with large dimensions is involved. The methods are illustrated on two examples.
暂无评论