Simple Computation of Maximum Likelihood Estimates in Latent Class Model with Equality and Constant Constraints

A simple computational method for estimation of parameters via a type of EM algorithm is proposed in restricted latent class analysis, where equality and constant constraints are considered. These constraints create difficulty in estimation. In order to simply and stably estimate parameters in restricted latent class analysis, a simple computational method using only first-order differentials is proposed, where the step-halving method is adopted. A simulation study shows that in almost all cases the new method gives parameter sequences monotonously increasing the Q-function in the EM algorithm. Analysis of real data is provided.     

An EM and a Stochastic Version of the EM Algorithm for Nonparametric Hidden Semi-Markov Models

The Hidden semi-Markov models (HSMMs) were introduced to overcome the constraint of a geometric sojourn time distribution for the different hidden states in the classical hidden Markov models. Several variations of HSMMs were proposed that model the sojourn times by a parametric or a nonparametric family of distributions. In this article, we concentrate our interest on the nonparametric case where the duration distributions are attached to transitions and not to states as in most of the published papers in HSMMs. Therefore, it is worth noticing that here we treat the underlying hidden semi-Markov chain in its general probabilistic structure. In that case, Barbu and Limnios (2008 Barbu , V. , Limnios , N. ( 2008 ). Semi-Markov Chains and Hidden Semi-Markov Models Toward Applications: Their Use in Reliability and DNA Analysis . New York : Springer . [Google Scholar]) proposed an Expectation–Maximization (EM) algorithm in order to estimate the semi-Markov kernel and the emission probabilities that characterize the dynamics of the model. In this article, we consider an improved version of Barbu and Limnios' EM algorithm which is faster than the original one. Moreover, we propose a stochastic version of the EM algorithm that achieves comparable estimates with the EM algorithm in less execution time. Some numerical examples are provided which illustrate the efficient performance of the proposed algorithms.     

Dirichlet Processes in Nonlinear Mixed Effects Models

In this article, we use two efficient approaches to deal with the difficulty in computing the intractable integrals when implementing Gibbs sampling in the nonlinear mixed effects model (NLMM) based on Dirichlet processes (DP). In the first approach, we compute the Laplace's approximation to the integral for its high accuracy, low cost, and ease of implementation. The second approach uses the no-gaps algorithm of MacEachern and Müller (1998 MacEachern , S. , Müller , P. ( 1998 ). Estimating mixtures of Dirichlet process models . Journal of Computational and Graphical Statistics 7 : 223 – 238 .[Taylor & Francis Online], [Web of Science ®] , [Google Scholar]) to perform Gibbs sampling without evaluating the difficult integral. We apply both approaches to real problems and simulations. Results show that both approaches perform well in density estimation and prediction and are superior to the parametric analysis in that they can detect important model features, such as skewness, long tails, and multimodality, whereas the parametric analysis cannot.     

An algorithm for the minimum sum of weighted absolute errors regression

We propose an algorithm to estimate the unknown constants in a multiple linear regression model under the minimum sum of weighted absolute errors (MSWAE). The proposed algorithm, a generalization of an earlier algorithm, is compared to a bounded variable algorithm. Some somputational experience is reported.     

Selection of cost-optimal 2k−p fractional factorials

Selecting an optimal 2^k?pfractional factorial is structured as a mathematical programming problem. An algorithm is defined for the solution, and the case of additive costs is shown to have a known solution for resolution III designs.     

The computational aspects of multiple attribute sampling procedures

One method of controlling the quality of incoming lots is through attribute sampling. To simultaneously control several (possibly dependent) attributes, properly chosen single attribute sampling plans can be merged into a multiple attribute sampling plan. The general form of such a plan is given and various alternatives are discussed. The multinomial distribution is used to develop formulae necessary for an analysis of a multiple attribute plan. Due to the lengthy nature of the calculations involved, a computer algorithm is outlined.     

Simulation of the p-generalized Gaussian distribution

In this paper, we introduce the p-generalized polar methods for the simulation of the p-generalized Gaussian distribution. On the basis of geometric measure representations, the well-known Box–Muller method and the Marsaglia–Bray rejecting polar method for the simulation of the Gaussian distribution are generalized to simulate the p-generalized Gaussian distribution, which fits much more flexibly to data than the Gaussian distribution and has already been applied in various fields of modern sciences. To prove the correctness of the p-generalized polar methods, we give stochastic representations, and to demonstrate their adequacy, we perform a comparison of six simulation techniques w.r.t. the goodness of fit and the complexity. The competing methods include adapted general methods and another special method. Furthermore, we prove stochastic representations for all the adapted methods.     

An EM algorithm for the estimation of parameters of bivariate generalized exponential distribution under random left censoring

In this paper, we consider the four-parameter bivariate generalized exponential distribution proposed by Kundu and Gupta [Bivariate generalized exponential distribution, J. Multivariate Anal. 100 (2009), pp. 581–593] and propose an expectation–maximization algorithm to find the maximum-likelihood estimators of the four parameters under random left censoring. A numerical experiment is carried out to discuss the properties of the estimators obtained iteratively.     

A Method of Finding Predictor Genes for a Particular Disease Using a Clustering Algorithm

Clustering Algorithms are nowadays really important tools in microarray data analysis. The different clustering algorithm generally used in biological science does not take into consideration the underlying probability distribution of the data. In this sense, they are heuristic in nature. In this work we proposed a clustering algorithm based on EM Algorithm. It gives 28% less misclassification than the K-means algorithm (which is mostly use in Bio science). We have also shown on a real data set that this algorithm can be efficiently used for detecting the genes which are responsible for a particular disease.     

Mixture of Bivariate Exponential Distributions

The exponential distribution is one of the most used type of distribution because of its importance in many lifetime applications and its properties. So is its bivariate form. Simply used, there can be limitations specially for the heterogeneous type population. Its mixture form adds a lot of characters and desirable properties. We propose a mixture of bivariate exponential distribution, study properties of the associated parameters and predict the elements of the mixture. We include the presence of covariate information through a linear relationship, capturing the now famous idea by Marshall and Olkin.