{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T04:12:15Z","timestamp":1740111135587,"version":"3.37.3"},"reference-count":34,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2019,12,1]],"date-time":"2019-12-01T00:00:00Z","timestamp":1575158400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["11771199"],"award-info":[{"award-number":["11771199"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["11601524","61773401"],"award-info":[{"award-number":["11601524","61773401"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Research Grant Council of the Hong Kong Special Administrative Region, China","award":["UGC\/FDS14\/P01\/14","UGC\/FDS14\/P01\/16"],"award-info":[{"award-number":["UGC\/FDS14\/P01\/14","UGC\/FDS14\/P01\/16"]}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Computational Statistics & Data Analysis"],"published-print":{"date-parts":[[2019,12]]},"DOI":"10.1016\/j.csda.2019.04.012","type":"journal-article","created":{"date-parts":[[2019,5,31]],"date-time":"2019-05-31T15:11:33Z","timestamp":1559315493000},"page":"122-143","update-policy":"https:\/\/2.zoppoz.workers.dev:443\/https\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":1,"special_numbering":"C","title":["A novel MM algorithm and the mode-sharing method in Bayesian computation for the analysis of general incomplete categorical data"],"prefix":"10.1016","volume":"140","author":[{"given":"Guo-Liang","family":"Tian","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yin","family":"Liu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Man-Lai","family":"Tang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tao","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/j.csda.2019.04.012_b1","doi-asserted-by":"crossref","first-page":"38","DOI":"10.1177\/096228029700600104","article-title":"EM Algorithms without missing data","volume":"6","author":"Becker","year":"1997","journal-title":"Stat. Methods Med. Res."},{"year":"1995","series-title":"Neural Networks for Pattern Recognition","author":"Bishop","key":"10.1016\/j.csda.2019.04.012_b2"},{"key":"10.1016\/j.csda.2019.04.012_b3","doi-asserted-by":"crossref","first-page":"299","DOI":"10.1198\/000313001753272240","article-title":"An introduction to perfect sampling","volume":"55","author":"Casella","year":"2000","journal-title":"Amer. Statist."},{"key":"10.1016\/j.csda.2019.04.012_b4","series-title":"A Festschrift for Herman Rubin","first-page":"342","article-title":"Generalized accept-reject sampling schemes","volume":"vol. 45","author":"Casella","year":"2004"},{"key":"10.1016\/j.csda.2019.04.012_b5","doi-asserted-by":"crossref","first-page":"256","DOI":"10.2307\/2347999","article-title":"Practical tests for comparing two proportions with incomplete data","volume":"31","author":"Choi","year":"1982","journal-title":"J. Appl. Stat."},{"issue":"1","key":"10.1016\/j.csda.2019.04.012_b6","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1111\/j.2517-6161.1977.tb01600.x","article-title":"Maximum-likelihood from incomplete data via the EM algorithm (with discussion)","volume":"39","author":"Dempster","year":"1977","journal-title":"J. R. Stat. Soc. Ser. B Stat. Methodol."},{"issue":"1","key":"10.1016\/j.csda.2019.04.012_b7","doi-asserted-by":"crossref","first-page":"131","DOI":"10.1214\/aoap\/1027961037","article-title":"An interruptible algorithm for perfect sampling via Markov chains","volume":"8","author":"Fill","year":"1998","journal-title":"Ann. Appl. Probab."},{"key":"10.1016\/j.csda.2019.04.012_b8","doi-asserted-by":"crossref","first-page":"398","DOI":"10.1080\/01621459.1990.10476213","article-title":"Sampling-based approaches to calculating marginal densities","volume":"85","author":"Gelfand","year":"1990","journal-title":"J. Amer. Statist. Assoc."},{"issue":"1","key":"10.1016\/j.csda.2019.04.012_b9","first-page":"49","article-title":"Discussion of \u201coptimization transfer using surrogate objective functions\u201d by K. Lange, D.R. Hunter and I. Yang","volume":"9","author":"Gelman","year":"2000","journal-title":"J. Comput. Graph. Statist."},{"key":"10.1016\/j.csda.2019.04.012_b10","doi-asserted-by":"crossref","unstructured":"Ghahramami, Z., Jordan, M., 1995. Learning from incomplete data. Technical Report AL Lab Memo (1509) CVCL Paper (108) MIT AI Lab.","DOI":"10.21236\/ADA295618"},{"issue":"11","key":"10.1016\/j.csda.2019.04.012_b11","doi-asserted-by":"crossref","first-page":"1","DOI":"10.18637\/jss.v033.i11","article-title":"A generalization of the dirichlet distribution","volume":"33","author":"Hankin","year":"2010","journal-title":"J. Stat. Softw."},{"issue":"4","key":"10.1016\/j.csda.2019.04.012_b12","doi-asserted-by":"crossref","first-page":"246","DOI":"10.1080\/00029890.1983.11971205","article-title":"The ranking of incomplete tournaments: A mathematician\u2019s guide to popular sports","volume":"90","author":"Jech","year":"1983","journal-title":"Am. Math. Monthly"},{"key":"10.1016\/j.csda.2019.04.012_b13","doi-asserted-by":"crossref","first-page":"11","DOI":"10.2307\/1267911","article-title":"Newton\u2013raphson and related algorithms for maximum likelihood variance component estimation","volume":"18","author":"Jennrich","year":"1976","journal-title":"Technometrics"},{"key":"10.1016\/j.csda.2019.04.012_b14","doi-asserted-by":"crossref","first-page":"181","DOI":"10.1162\/neco.1994.6.2.181","article-title":"Hierarchical mixtures of experts and the EM algorithm","volume":"6","author":"Jordan","year":"1994","journal-title":"Neural Comput."},{"issue":"1","key":"10.1016\/j.csda.2019.04.012_b15","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1007\/BF02295434","article-title":"Accuracy of Kendall\u2019s chi-square approximation to circular triad distributions","volume":"63","author":"Knezek","year":"1998","journal-title":"Psychometrika"},{"year":"2002","series-title":"Mathematical and Statistical Methods for Genetic Analysis","author":"Lange","key":"10.1016\/j.csda.2019.04.012_b16"},{"issue":"1","key":"10.1016\/j.csda.2019.04.012_b17","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1080\/10618600.2000.10474858","article-title":"Optimization transfer using surrogate objective functions (with discussion)","volume":"9","author":"Lange","year":"2000","journal-title":"J. Comput. Graph. Statist."},{"year":"2002","series-title":"Statistical Analysis with Missing Data","author":"Little","key":"10.1016\/j.csda.2019.04.012_b18"},{"issue":"4","key":"10.1016\/j.csda.2019.04.012_b19","doi-asserted-by":"crossref","first-page":"633","DOI":"10.1093\/biomet\/81.4.633","article-title":"The ECME algorithm: A simple extension of EM and ECM with faster monotone convergence","volume":"81","author":"Liu","year":"1994","journal-title":"Biometrika"},{"issue":"4","key":"10.1016\/j.csda.2019.04.012_b20","doi-asserted-by":"crossref","first-page":"755","DOI":"10.1093\/biomet\/85.4.755","article-title":"Parameter expansion to accelerate EM: The PX-EM algorithm","volume":"85","author":"Liu","year":"1998","journal-title":"Biometrika"},{"year":"1997","series-title":"The EM Algorithm and Extensions","author":"McLachlan","key":"10.1016\/j.csda.2019.04.012_b21"},{"issue":"3","key":"10.1016\/j.csda.2019.04.012_b22","doi-asserted-by":"crossref","first-page":"511","DOI":"10.1111\/1467-9868.00082","article-title":"The EM algorithm \u2014 an old folk-song sung to a fast new tune (with discussion)","volume":"59","author":"Meng","year":"1997","journal-title":"J. R. Stat. Soc. Ser. B Stat. Methodol."},{"issue":"2","key":"10.1016\/j.csda.2019.04.012_b23","doi-asserted-by":"crossref","first-page":"267","DOI":"10.1093\/biomet\/80.2.267","article-title":"Maximum likelihood estimation via the ECM algorithm: A general framework","volume":"80","author":"Meng","year":"1993","journal-title":"Biometrika"},{"key":"10.1016\/j.csda.2019.04.012_b24","series-title":"Various Techniques Used in Connection with Random Digits","first-page":"36","volume":"vol. 12","author":"von Neumann","year":"1951"},{"key":"10.1016\/j.csda.2019.04.012_b25","unstructured":"R Core Team, 2018. R: A Language and Environment for Statistical Computing. R Foundation for Statistical Computing, Vienna, Austria."},{"year":"1973","series-title":"Linear Statistical Inferences and its Applications","author":"Rao","key":"10.1016\/j.csda.2019.04.012_b26"},{"issue":"2","key":"10.1016\/j.csda.2019.04.012_b27","doi-asserted-by":"crossref","first-page":"195","DOI":"10.1137\/1026034","article-title":"Mixture densities, maximum likelihood and the EM algorithm","volume":"26","author":"Render","year":"1984","journal-title":"SIAM Rev."},{"year":"2004","series-title":"Monte Carlo Statistical Methods","author":"Robert","key":"10.1016\/j.csda.2019.04.012_b28"},{"issue":"3","key":"10.1016\/j.csda.2019.04.012_b29","doi-asserted-by":"crossref","first-page":"581","DOI":"10.1093\/biomet\/63.3.581","article-title":"Inference and missing data","volume":"63","author":"Rubin","year":"1976","journal-title":"Biometrika"},{"key":"10.1016\/j.csda.2019.04.012_b30","first-page":"543","article-title":"A non-iterative sampling\/importance resampling alternative to the data augmentation algorithm for creating a few imputations when fractions of missing information are modest: the SIR algorithm. Discussion of Tanner and Wong 1987","volume":"82","author":"Rubin","year":"1987","journal-title":"J. Amer. Stat. Assoc."},{"key":"10.1016\/j.csda.2019.04.012_b31","series-title":"Bayesian Statistics, Vol. 3","article-title":"Using the SIR algorithm to simulate posterior distributions","author":"Rubin","year":"1988"},{"year":"1996","series-title":"Tools for Statistical Inference: Methods for the Exploration of Posterior Distributions and Likelihood Functions","author":"Tanner","key":"10.1016\/j.csda.2019.04.012_b32"},{"key":"10.1016\/j.csda.2019.04.012_b33","doi-asserted-by":"crossref","first-page":"528","DOI":"10.1080\/01621459.1987.10478458","article-title":"The calculation of posterior distribution by data augmentation (with discussion)","volume":"83","author":"Tanner","year":"1987","journal-title":"J. Amer. Statist. Assoc."},{"issue":"1","key":"10.1016\/j.csda.2019.04.012_b34","doi-asserted-by":"crossref","first-page":"95","DOI":"10.1214\/aos\/1176346060","article-title":"On the convergence properties of the EM algorithm","volume":"11","author":"Wu","year":"1983","journal-title":"Ann. Statist."}],"container-title":["Computational Statistics & Data Analysis"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/api.elsevier.com\/content\/article\/PII:S0167947319300969?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/api.elsevier.com\/content\/article\/PII:S0167947319300969?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2024,7,18]],"date-time":"2024-07-18T23:37:14Z","timestamp":1721345834000},"score":1,"resource":{"primary":{"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/linkinghub.elsevier.com\/retrieve\/pii\/S0167947319300969"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,12]]},"references-count":34,"alternative-id":["S0167947319300969"],"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/doi.org\/10.1016\/j.csda.2019.04.012","relation":{},"ISSN":["0167-9473"],"issn-type":[{"type":"print","value":"0167-9473"}],"subject":[],"published":{"date-parts":[[2019,12]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"A novel MM algorithm and the mode-sharing method in Bayesian computation for the analysis of general incomplete categorical data","name":"articletitle","label":"Article Title"},{"value":"Computational Statistics & Data Analysis","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/2.zoppoz.workers.dev:443\/https\/doi.org\/10.1016\/j.csda.2019.04.012","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2019 Published by Elsevier B.V.","name":"copyright","label":"Copyright"}]}}