Title | A novel MM algorithm and the mode-sharing method in Bayesian computation for the analysis of general incomplete categorical data |
Author | |
Corresponding Author | Liu, Yin |
Publication Years | 2019-12
|
DOI | |
Source Title | |
ISSN | 0167-9473
|
EISSN | 1872-7352
|
Volume | 140Pages:122-143 |
Abstract | Incomplete categorical data often occur in the fields such as biomedicine, epidemiology, psychology, sports and so on. In this paper, we first introduce a novel minorization-maximization (MM) algorithm to calculate the maximum likelihood estimates (MLEs) of parameters and the posterior modes for the analysis of general incomplete categorical data. Although the data augmentation (DA) algorithm and Gibbs sampling as the corresponding stochastic counterparts of the expectation-maximization (EM) and ECM algorithms are developed very well, up to now, little work has been done on creating stochastic versions to the existing MM algorithms. This is the first paper to propose a mode-sharing method in Bayesian computation for general incomplete categorical data by developing a new acceptance-rejection (AR) algorithm aided with the proposed MM algorithm. The key idea is to construct a class of envelope densities indexed by a working parameter and to identify a specific envelope density which can overcome the four drawbacks associated with the traditional AR algorithm. The proposed mode-sharing based AR algorithm has three significant characteristics: (I) it can automatically establish a family of envelope densities {g(lambda)(.): lambda is an element of S-lambda} indexed by a working parameter lambda, where each member in the family shares mode with the posterior density; (II) with the onedimensional grid method searching over the finite interval S-lambda,S- it can identify an optimal working parameter lambda(opt) by maximizing the theoretical acceptance probability, yielding a best easy-sampling envelope density g lambda(opt) (.), which is more dispersive than the posterior density; (III) it can obtain the optimal envelope constant c(opt) by using the mode-sharing theorem (indicating that the high-dimensional optimization can be completely avoided) or by using the proposed MM algorithm again. Finally, a toy model and three real data sets are used to illustrate the proposed methodologies. (C) 2019 Published by Elsevier B.V. |
Keywords | |
URL | [Source Record] |
Indexed By | |
Language | English
|
SUSTech Authorship | First
|
Funding Project | Research Grant Council of the Hong Kong Special Administrative Region, China[UGC/FDS14/P01/14]
; Research Grant Council of the Hong Kong Special Administrative Region, China[UGC/FDS14/P01/16]
|
WOS Research Area | Computer Science
; Mathematics
|
WOS Subject | Computer Science, Interdisciplinary Applications
; Statistics & Probability
|
WOS Accession No | WOS:000478704800008
|
Publisher | |
EI Accession Number | 20192707142735
|
EI Keywords | Bayesian networks
; Clustering algorithms
; Computation theory
; Maximum likelihood estimation
; Optimization
; Stochastic systems
|
ESI Classification Code | Computer Theory, Includes Formal Logic, Automata Theory, Switching Theory, Programming Theory:721.1
; Information Sources and Analysis:903.1
; Combinatorial Mathematics, Includes Graph Theory, Set Theory:921.4
; Optimization Techniques:921.5
; Statistical Methods:922
; Systems Science:961
|
ESI Research Field | MATHEMATICS
|
Data Source | Web of Science
|
Citation statistics |
Cited Times [WOS]:1
|
Document Type | Journal Article |
Identifier | http://kc.sustech.edu.cn/handle/2SGJ60CL/25063 |
Department | Department of Mathematics 工学院_材料科学与工程系 |
Affiliation | 1.Southern Univ Sci & Technol, Dept Math, Shenzhen 518055, Guangdong, Peoples R China 2.Zhongnan Univ Econ & Law, Sch Math & Stat, Wuhan 430073, Hubei, Peoples R China 3.Hang Seng Univ Hong Kong, Sch Decis Sci, Dept Math & Stat, Siu Lek Yuen,Shatin, Hong Kong, Peoples R China |
First Author Affilication | Department of Mathematics |
First Author's First Affilication | Department of Mathematics |
Recommended Citation GB/T 7714 |
Tian, Guo-Liang,Liu, Yin,Tang, Man-Lai,et al. A novel MM algorithm and the mode-sharing method in Bayesian computation for the analysis of general incomplete categorical data[J]. COMPUTATIONAL STATISTICS & DATA ANALYSIS,2019,140:122-143.
|
APA |
Tian, Guo-Liang,Liu, Yin,Tang, Man-Lai,&Li, Tao.(2019).A novel MM algorithm and the mode-sharing method in Bayesian computation for the analysis of general incomplete categorical data.COMPUTATIONAL STATISTICS & DATA ANALYSIS,140,122-143.
|
MLA |
Tian, Guo-Liang,et al."A novel MM algorithm and the mode-sharing method in Bayesian computation for the analysis of general incomplete categorical data".COMPUTATIONAL STATISTICS & DATA ANALYSIS 140(2019):122-143.
|
Files in This Item: | ||||||
File Name/Size | DocType | Version | Access | License | ||
Tian-2019-A novel MM(1749KB) | Restricted Access | -- |
|
Items in the repository are protected by copyright, with all rights reserved, unless otherwise indicated.
Edit Comment