TY - GEN
T1 - Fast calculation of restricted maximum likelihood methods for unstructured high-throughput data
AU - Zhu, Shengxin
N1 - Funding Information:
ACKNOWLEDGEMENT The project is supported by the Natural Science Fund of China (No.11501044) and partially supported by NSFC (No.11571002, 11571047, 11671049, 11671051, 61672003).
Publisher Copyright:
© 2017 IEEE.
PY - 2017/10/20
Y1 - 2017/10/20
N2 - Linear mixed models are often used for analysing unbalanced data with certain missing values in a broad range of applications. The restricted maximum likelihood method is often preferred to estimate co-variance parameters in such models due to its unbiased estimation of the underlying variance parameters. The restricted log-likelihood function involves log determinants of a complicated co-variance matrix which are computational prohibitive. An efficient statistical estimate of the underlying model parameters and quantifying the accuracy of the estimation requires the observed or the Fisher information matrix. Standard approaches to compute the observed and Fisher information matrix are computationally prohibitive. Customized algorithms are of highly demand to keep the restricted log-likelihood method scalable for increasing high-throughput unbalanced data sets. In this paper, we explore how to leverage an information splitting technique and dedicate matrix transform to significantly reduce computations. Together with a fill-in reducing multi-frontal sparse direct solvers, this approach improves performance of the computation process.
AB - Linear mixed models are often used for analysing unbalanced data with certain missing values in a broad range of applications. The restricted maximum likelihood method is often preferred to estimate co-variance parameters in such models due to its unbiased estimation of the underlying variance parameters. The restricted log-likelihood function involves log determinants of a complicated co-variance matrix which are computational prohibitive. An efficient statistical estimate of the underlying model parameters and quantifying the accuracy of the estimation requires the observed or the Fisher information matrix. Standard approaches to compute the observed and Fisher information matrix are computationally prohibitive. Customized algorithms are of highly demand to keep the restricted log-likelihood method scalable for increasing high-throughput unbalanced data sets. In this paper, we explore how to leverage an information splitting technique and dedicate matrix transform to significantly reduce computations. Together with a fill-in reducing multi-frontal sparse direct solvers, this approach improves performance of the computation process.
KW - Fisher-scoring algorithm
KW - fill-in reducing algorithm
KW - linear mixed model
KW - multi-frontal factorization
KW - restricted log-likelihood
KW - unbalanced data
UR - http://www.scopus.com/inward/record.url?scp=85040000546&partnerID=8YFLogxK
U2 - 10.1109/ICBDA.2017.8078871
DO - 10.1109/ICBDA.2017.8078871
M3 - Conference Proceeding
AN - SCOPUS:85040000546
T3 - 2017 IEEE 2nd International Conference on Big Data Analysis, ICBDA 2017
SP - 40
EP - 43
BT - 2017 IEEE 2nd International Conference on Big Data Analysis, ICBDA 2017
PB - Institute of Electrical and Electronics Engineers Inc.
T2 - 2nd IEEE International Conference on Big Data Analysis, ICBDA 2017
Y2 - 10 March 2017 through 12 March 2017
ER -