Parameter Estimation under Constraints for Multivariate Normal Distributions with Incomplete Data

2001 ◽  
Vol 26 (2) ◽  
pp. 219-232
Author(s):  
Alice Zoppé ◽  
Yuh-Pey Anne Buu ◽  
Bernard Flury
Keyword(s):  
Missing Data ◽  
Em Algorithm ◽  
Missing Values ◽  
Missing At Random ◽  
Maximum Likelihood Estimates ◽  
Data Matrix ◽  
Ratio Test ◽  
Multivariate Normal ◽  
The Em Algorithm ◽  
Log Likelihood

This work presents an application of the EM-algorithm to two problems of estimation and testing in a multivariate normal distribution with missing data. The assumptions are that the observations are multivariate normally distributed and that the missing values are missing at random. The two models are tested applying the log-likelihood ratio test; for deriving the maximum likelihood estimates and evaluating the corresponding log-likelihood functions the EM algorithm is used. The problem of different and non-monotone patterns of missing data is solved introducing suitable transformations and partitions of the data matrix. The algorithm is proposed for general constraints on the mean vector; the topic of exchangeability of random vectors is also presented.

scholarly journals Comparison of the Average Kappa Coefficients of Two Binary Diagnostic Tests with Missing Data

Mathematics ◽  
2021 ◽  
Vol 9 (21) ◽  
pp. 2834
Author(s):  
José Antonio Roldán-Nofuentes ◽  
Saad Bouh Regad
Keyword(s):  
Missing Data ◽  
Em Algorithm ◽  
Diagnostic Test ◽  
Gold Standard ◽  
Diagnostic Tests ◽  
Missing At Random ◽  
Disease Status ◽  
Simulation Experiments ◽  
Sem Algorithm ◽  
The Em Algorithm

The average kappa coefficient of a binary diagnostic test is a parameter that measures the average beyond-chance agreement between the diagnostic test and the gold standard. This parameter depends on the accuracy of the diagnostic test and also on the disease prevalence. This article studies the comparison of the average kappa coefficients of two binary diagnostic tests when the gold standard is not applied to all individuals in a random sample. In this situation, known as partial disease verification, the disease status of some individuals is a missing piece of data. Assuming that the missing data mechanism is missing at random, the comparison of the average kappa coefficients is solved by applying two computational methods: the EM algorithm and the SEM algorithm. With the EM algorithm the parameters are estimated and with the SEM algorithm their variances-covariances are estimated. Simulation experiments have been carried out to study the sizes and powers of the hypothesis tests studied, obtaining that the proposed method has good asymptotic behavior. A function has been written in R to solve the proposed problem, and the results obtained have been applied to the diagnosis of Alzheimer's disease.

scholarly journals Kernel weighted least square approach for imputing missing values of metabolomics data

2021 ◽  
Vol 11 (1) ◽  
Author(s):  
Nishith Kumar ◽  
Md. Aminul Hoque ◽  
Masahiro Sugimoto
Keyword(s):  
Missing Data ◽  
Large Scale ◽  
Missing Values ◽  
Kernel Weight ◽  
Least Square ◽  
Data Matrix ◽  
Data Imputation ◽  
Metabolomics Data ◽  
Missing Value ◽  
Missing Data Imputation

AbstractMass spectrometry is a modern and sophisticated high-throughput analytical technique that enables large-scale metabolomic analyses. It yields a high-dimensional large-scale matrix (samples × metabolites) of quantified data that often contain missing cells in the data matrix as well as outliers that originate for several reasons, including technical and biological sources. Although several missing data imputation techniques are described in the literature, all conventional existing techniques only solve the missing value problems. They do not relieve the problems of outliers. Therefore, outliers in the dataset decrease the accuracy of the imputation. We developed a new kernel weight function-based proposed missing data imputation technique that resolves the problems of missing values and outliers. We evaluated the performance of the proposed method and other conventional and recently developed missing imputation techniques using both artificially generated data and experimentally measured data analysis in both the absence and presence of different rates of outliers. Performances based on both artificial data and real metabolomics data indicate the superiority of our proposed kernel weight-based missing data imputation technique to the existing alternatives. For user convenience, an R package of the proposed kernel weight-based missing value imputation technique was developed, which is available at https://github.com/NishithPaul/tWLSA.

scholarly journals PENDUGAAN DATA HILANG DENGAN METODE YATES DAN ALGORITMA EM PADA RANCANGAN LATTICE SEIMBANG

2015 ◽  
Vol 4 (2) ◽  
pp. 74
Author(s):  
MADE SUSILAWATI ◽  
KARTIKA SARI
Keyword(s):  
Missing Data ◽  
Em Algorithm ◽  
Basic Concept ◽  
Incomplete Data ◽  
Likelihood Function ◽  
Animal Husbandry ◽  
Lattice Design ◽  
The Em Algorithm ◽  
Missing Data Estimation ◽  
Data Estimation

Missing data often occur in agriculture and animal husbandry experiment. The missing data in experimental design makes the information that we get less complete. In this research, the missing data was estimated with Yates method and Expectation Maximization (EM) algorithm. The basic concept of the Yates method is to minimize sum square error (JKG), meanwhile the basic concept of the EM algorithm is to maximize the likelihood function. This research applied Balanced Lattice Design with 9 treatments, 4 replications and 3 group of each repetition. Missing data estimation results showed that the Yates method was better used for two of missing data in the position on a treatment, a column and random, meanwhile the EM algorithm was better used to estimate one of missing data and two of missing data in the position of a group and a replication. The comparison of the result JKG of ANOVA showed that JKG of incomplete data larger than JKG of incomplete data that has been added with estimator of data. This suggest  thatwe need to estimate the missing data.

Predicting in multivariate incomplete time series. Application of the expectation-maximisation algorithm supplemented by the Newton-Raphson method

2021 ◽  
Vol 68 (1) ◽  
pp. 17-46
Author(s):  
Adam Korczyński
Keyword(s):  
Time Series ◽  
Missing Data ◽  
Em Algorithm ◽  
Measurement Errors ◽  
Parameters Estimation ◽  
Maximum Likelihood Estimates ◽  
Original Algorithm ◽  
Expectation Maximisation ◽  
Newton Raphson ◽  
Raphson Method

Statistical practice requires various imperfections resulting from the nature of data to be addressed. Data containing different types of measurement errors and irregularities, such as missing observations, have to be modelled. The study presented in the paper concerns the application of the expectation-maximisation (EM) algorithm to calculate maximum likelihood estimates, using an autoregressive model as an example. The model allows describing a process observed only through measurements with certain level of precision and through more than one data series. The studied series are affected by a measurement error and interrupted in some time periods, which causes the information for parameters estimation and later for prediction to be less precise. The presented technique aims to compensate for missing data in time series. The missing data appear in the form of breaks in the source of the signal. The adjustment has been performed by the EM algorithm to a hybrid version, supplemented by the Newton-Raphson method. This technique allows the estimation of more complex models. The formulation of the substantive model of an autoregressive process affected by noise is outlined, as well as the adjustment introduced to overcome the issue of missing data. The extended version of the algorithm has been verified using sampled data from a model serving as an example for the examined process. The verification demonstrated that the joint EM and Newton-Raphson algorithms converged with a relatively small number of iterations and resulted in the restoration of the information lost due to missing data, providing more accurate predictions than the original algorithm. The study also features an example of the application of the supplemented algorithm to some empirical data (in the calculation of a forecasted demand for newspapers).

Nonparametric spectral analysis with missing data via the EM algorithm

2005 ◽  
Vol 15 (2) ◽  
pp. 191-206 ◽  
Author(s):  
Yanwei Wang ◽  
Petre Stoica ◽  
Jian Li ◽  
Thomas L. Marzetta
Keyword(s):  
Spectral Analysis ◽  
Missing Data ◽  
Em Algorithm ◽  
The Em Algorithm

scholarly journals The Orthogonally Partitioned EM Algorithm: Extending the EM Algorithm for Algorithmic Stability and Bias Correction Due to Imperfect Data

2016 ◽  
Vol 12 (1) ◽  
pp. 65-77
Author(s):  
Michael D. Regier ◽  
Erica E. M. Moodie
Keyword(s):  
Missing Data ◽  
Measurement Error ◽  
Em Algorithm ◽  
Optimal Solution ◽  
Bias Reduction ◽  
Model Parameters ◽  
Finite Sample ◽  
Imperfect Data ◽  
The Em Algorithm ◽  
Finite Sample Properties

Abstract We propose an extension of the EM algorithm that exploits the common assumption of unique parameterization, corrects for biases due to missing data and measurement error, converges for the specified model when standard implementation of the EM algorithm has a low probability of convergence, and reduces a potentially complex algorithm into a sequence of smaller, simpler, self-contained EM algorithms. We use the theory surrounding the EM algorithm to derive the theoretical results of our proposal, showing that an optimal solution over the parameter space is obtained. A simulation study is used to explore the finite sample properties of the proposed extension when there is missing data and measurement error. We observe that partitioning the EM algorithm into simpler steps may provide better bias reduction in the estimation of model parameters. The ability to breakdown a complicated problem in to a series of simpler, more accessible problems will permit a broader implementation of the EM algorithm, permit the use of software packages that now implement and/or automate the EM algorithm, and make the EM algorithm more accessible to a wider and more general audience.

Sign in / Sign up

Export Citation Format

Share Document