Estimation in a truncated bivariate poisson distribution using the EM algorithm

An EM algorithm (Dempster et al., 1977) is derived for the estimation of parameters of the truncated bivariate Poisson distribution with zeros rnissing from both margins. The observed inforrnation matrix is obtained and a numerical exarnple is given where the convergence of the EM algorithm is accelerated by the methods of Louis (1982) and conjugate gradients (Jamshidian antl Jennrich, 1993).     

Estimation of gaussian mixtures with rotationally invariant covariance matrices

Homoscedastic and heteroscedastic Gaussian mixtures differ in the constraints placed on the covariance matrices of the mixture components. A new mixture, called herein a strophoscedastic mixture, is defined by a new constraint, This constraint requires the matrices to be identical under orthogonal trans¬formations, where different transformations are allowed for different matrices. It is shown that the M-step of the EM method for estimating the parameters of strophoscedastic mixtures from sample data is explicitly solvable using singular value decompositions. Consequently, the EM-based maximum likelihood estimation algorithm is as easily implemented for strophoscedastic mixtures as it is for homoscedastic and heteroscedastic mixtures. An example of a “noisy” Archimedian spiral is presented.     

Estimating survival curves with left truncated and interval censored data via the ems algorithm

It is well-known that the nonparametric maximum likelihood estimator (NPMLE) of a survival function may severely underestimate the survival probabilities at very early times for left truncated data. This problem might be overcome by instead computing a smoothed nonparametric estimator (SNE) via the EMS algorithm. The close connection between the SNE and the maximum penalized likelihood estimator is also established. Extensive Monte Carlo simulations demonstrate the superior performance of the SNE over that of the NPMLE, in terms of either bias or variance, even for moderately large Samples. The methodology is illustrated with an application to the Massachusetts Health Care Panel Study dataset to estimate the probability of being functionally independent for non-poor male and female groups rcspectively.     

An augmented data scoring algorithm for maximum likelihood

The expectation-maximization (EM) method facilitates computation of max¬imum likelihood (ML) and maximum penalized likelihood (MPL) solutions. The procedure requires specification of unobservabie complete data which augment the measured or incomplete data. This specification defines a conditional expectation of the complete data log-likelihood function which is computed in the E-stcp. The EM algorithm is most effective when maximizing the iunction Q{0) denned in the F-stnp is easier than maximizing the likelihood function.

The Monte Carlo EM (MCEM) algorithm of Wei & Tanner (1990) was introduced for problems where computation of Q is difficult or intractable. However Monte Carlo can he computationally expensive, e.g. in signal processing applications involving large numbers of parameters. We provide another approach: a modification of thc standard EM algorithm avoiding computation of conditional expectations.     

A structured variational learning approach for switching latent factor models

A data-driven approach for modeling volatility dynamics and co-movements in financial markets is introduced. Special emphasis is given to multivariate conditionally heteroscedastic factor models in which the volatilities of the latent factors depend on their past values, and the parameters are driven by regime switching in a latent state variable. We propose an innovative indirect estimation method based on the generalized EM algorithm principle combined with a structured variational approach that can handle models with large cross-sectional dimensions. Extensive Monte Carlo simulations and preliminary experiments with financial data show promising results.     

A Note on Inconsistency of NPMLE of the Distribution Function from Left Truncated and Case I Interval Censored Data

We show that under reasonable conditions the nonparametric maximum likelihood estimate (NPMLE) of the distribution function from left-truncated and case 1 interval-censored data is inconsistent, in contrast to the consistency properties of the NPMLE from only left-truncated data or only interval-censored data. However, the conditional NPMLE is shown to be consistent. Numerical examples are provided to illustrate their finite sample properties.     

Identifiable finite mixtures of location models for clustering mixed-mode data

For clustering mixed categorical and continuous data, Lawrence and Krzanowski (1996) proposed a finite mixture model in which component densities conform to the location model. In the graphical models literature the location model is known as the homogeneous Conditional Gaussian model. In this paper it is shown that their model is not identifiable without imposing additional restrictions. Specifically, for g groups and m locations, (g!)m–1 distinct sets of parameter values (not including permutations of the group mixing parameters) produce the same likelihood function. Excessive shrinkage of parameter estimates in a simulation experiment reported by Lawrence and Krzanowski (1996) is shown to be an artifact of the model's non-identifiability. Identifiable finite mixture models can be obtained by imposing restrictions on the conditional means of the continuous variables. These new identified models are assessed in simulation experiments. The conditional mean structure of the continuous variables in the restricted location mixture models is similar to that in the underlying variable mixture models proposed by Everitt (1988), but the restricted location mixture models are more computationally tractable.     

Modelling Variability in the Branching Structure of Strawberry Inflorescences

The branching structure of inflorescences of the cultivated strawberry ( Fragaria × ananassa Duch.) is very variable. This paper demonstrates that some aspects of this variability are well described by a simple stochastic model of branching that has two adjustable parameters. The model is shown to provide a good fit to data from a set of almost 700 inflorescences of the cultivar Elsanta, collected over two successive years. For one parameter the maximum likelihood estimator is a moment estimator which is fully efficient even if the detailed branching structure of the inflorescences is not recorded. This parameter provides a convenient summary of branching vigour. The maximum likelihood estimator of the second parameter must be determined iteratively and can be quite inefficient unless the full branching structure is recorded. The model demonstrates that branching structure is affected by the order in which inflorescences emerge on the plant.     

复杂网络社区结构问题综述

本文从社区的定义,社区结构评价指标,社区发现算法几个方面对复杂网络社区结构问题进行了综述。对现有的几种对社区的定义进行了较详细的阐述,介绍了几种比较有代表性的评价指标,并对复杂网络社区发现算法进行了分类总结,最后对复杂网络社区结构的发展做出展望。