{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,8]],"date-time":"2025-02-08T03:40:02Z","timestamp":1738986002449,"version":"3.37.0"},"reference-count":39,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2009,3,6]],"date-time":"2009-03-06T00:00:00Z","timestamp":1236297600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Data Min Knowl Disc"],"published-print":{"date-parts":[[2009,8]]},"DOI":"10.1007\/s10618-009-0128-3","type":"journal-article","created":{"date-parts":[[2009,3,9]],"date-time":"2009-03-09T10:41:28Z","timestamp":1236595288000},"page":"58-94","source":"Crossref","is-referenced-by-count":1,"title":["Global and componentwise extrapolations for accelerating training of Bayesian networks and conditional random fields"],"prefix":"10.1007","volume":"19","author":[{"given":"Han-Shen","family":"Huang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bo-Hou","family":"Yang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yu-Ming","family":"Chang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chun-Nan","family":"Hsu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2009,3,6]]},"reference":[{"key":"128_CR1","unstructured":"Bauer E, Koller D, Singer Y (1997) Update rules for parameter estimation in Bayesian networks. In: Proceedings of the 13th conference on uncertainty in artificial intelligence (UAI\u201997), pp 3\u201313"},{"key":"128_CR2","doi-asserted-by":"crossref","first-page":"3689","DOI":"10.1016\/j.csda.2006.12.013","volume":"51","author":"A Berlinet","year":"2007","unstructured":"Berlinet A, Roland C (2007) Acceleration schemes with application to the EM algorithm. Comput Stat Data Anal 51: 3689\u20133702","journal-title":"Comput Stat Data Anal"},{"issue":"2\u20133","key":"128_CR3","doi-asserted-by":"crossref","first-page":"213","DOI":"10.1023\/A:1007421730016","volume":"29","author":"J Binder","year":"1997","unstructured":"Binder J, Koller D, Russell S, Kanazawa K (1997) Adaptive probabilistic networks with hidden variables. Mach Learn 29(2\u20133): 213\u2013244","journal-title":"Mach Learn"},{"key":"128_CR4","unstructured":"Bottou L (2007) Stochastic gradient descent examples on toy problems. http:\/\/leon.bottou.org\/projects\/sgd"},{"key":"128_CR5","unstructured":"Burden RL, Faires D (1988) Numerical analysis. PWS-KENT Pub Co"},{"key":"128_CR6","unstructured":"Cheeseman P, Stutz J (1996) Bayesian classification (autoclass): theory and results. In: Advances in knowledge discovery and data mining. MIT Press, Cambridge, MA, USA, pp 153\u2013180"},{"key":"128_CR7","first-page":"309","volume":"9","author":"GF Cooper","year":"1992","unstructured":"Cooper GF, Herskovits E (1992) A Bayesian method for the induction of probabilistic networks from data. Mach Learn 9: 309\u2013347","journal-title":"Mach Learn"},{"issue":"5","key":"128_CR8","doi-asserted-by":"crossref","first-page":"1470","DOI":"10.1214\/aoms\/1177692379","volume":"43","author":"JN Darroch","year":"1972","unstructured":"Darroch JN, Ratcliff D (1972) Generalized iterative scaling for log-linear models. Ann Math Stat 43(5): 1470\u20131480","journal-title":"Ann Math Stat"},{"issue":"1","key":"128_CR9","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1111\/j.2517-6161.1977.tb01600.x","volume":"39","author":"A Dempster","year":"1977","unstructured":"Dempster A, Laird N, Rubin D (1977) Maximum likelihood from incomplete data via the EM algorithm. J R Stat Soc Ser B 39(1): 1\u201338","journal-title":"J R Stat Soc Ser B"},{"issue":"1","key":"128_CR10","doi-asserted-by":"crossref","first-page":"13","DOI":"10.1016\/S0167-9473(99)00003-1","volume":"31","author":"C Fraley","year":"1999","unstructured":"Fraley C (1999) On computing the largest fraction of missing information for the em algorithm and the worst linear function for data augmentation. Comput Stat Data Anal 31(1): 13\u201326","journal-title":"Comput Stat Data Anal"},{"key":"128_CR11","unstructured":"Golub GH, Loan CFV (1996) Matrix computations, 3rd edn. PWS-KENT Pub Co"},{"key":"128_CR12","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4612-4442-4","volume-title":"Numerical mathematics","author":"G Hammerlin","year":"1991","unstructured":"Hammerlin G, Hoffmann K-H (1991) Numerical mathematics. Springer, New York"},{"key":"128_CR13","unstructured":"Hesterberg T (2005) Staggered Aitken acceleration for EM. In: Proceedings of the statistical computing section of the American Statistical Association, Minneapolis, Minnesota, USA"},{"key":"128_CR14","doi-asserted-by":"crossref","unstructured":"Hsu C-N, Chang Y-M, Kuo C-J, Lin Y-S, Huang H-S, Chuang I-F (2008) Integrating high dimensional bi-directional parsing models for gene mention tagging. Bioinformatics 24(13):i286\u2013i294. Proceedings of ISMB-2008","DOI":"10.1093\/bioinformatics\/btn183"},{"key":"128_CR15","doi-asserted-by":"crossref","unstructured":"Huang H-S, Yang B-H, Hsu, C-N (2005) Triple-jump acceleration for the EM algorithm. In: Proceedings of the fifth IEEE international conference on data mining (ICDM\u201905), pp 649\u2013652","DOI":"10.1109\/ICDM.2005.146"},{"key":"128_CR16","unstructured":"Huang H-S, Yang B-H, Hsu C-N (2007a) TJ2aEM: targeted aggressive extrapolation method for accelerating the EM algorithm. Technical report, Institute of Information Science, Academia Sinica, Taiwan. IIS Technical Report: TR-IIS-07-012"},{"key":"128_CR17","doi-asserted-by":"crossref","unstructured":"Huang H-S, Chang Y-M, Hsu C-N (2007b) Training conditional random fields by periodic step size adaptation for large-scale text mining. In: Proceedings of the seventh IEEE international conference on data mining (ICDM\u201907), pp 511\u2013516","DOI":"10.1109\/ICDM.2007.39"},{"issue":"3","key":"128_CR18","doi-asserted-by":"crossref","first-page":"569","DOI":"10.1111\/1467-9868.00083","volume":"59","author":"M Jamshidian","year":"1997","unstructured":"Jamshidian M, Jennrich RI (1997) Acceleration of the EM algorithm by using quasi-newton methods. J R Stat Soc Ser B 59(3): 569\u2013587","journal-title":"J R Stat Soc Ser B"},{"key":"128_CR19","unstructured":"Kapetanios G (2004) On testing for diagonality of large dimensional covariance matrices"},{"key":"128_CR20","doi-asserted-by":"crossref","unstructured":"Kim J-D, Ohta T, Tsuruoka Y, Tateisi Y, Collier N (2004) Introduction to the bio-entity recognition task at JNLPBA. In: Proceedings of the joint workshop on natural language processing in biomedicine and its applications (JNLPBA-2004), pp 70\u201375","DOI":"10.3115\/1567594.1567610"},{"key":"128_CR21","unstructured":"Kudo T (2006) CRF++: yet another CRF toolkit ( http:\/\/crfpp.sourceforge.net\/ ). Available under LGPL from the following http:\/\/crfpp.sourceforge.net\/"},{"key":"128_CR22","doi-asserted-by":"crossref","first-page":"1549","DOI":"10.1016\/j.csda.2006.05.004","volume":"51","author":"M Kuroda","year":"2006","unstructured":"Kuroda M, Sakakihara M (2006) Accelerating the convergence of the EM algorithm using the vector \u03b5 algorithm. Comput Stat Data Anal 51: 1549\u20131561","journal-title":"Comput Stat Data Anal"},{"key":"128_CR23","unstructured":"Lafferty J, McCallum A, Pereira F (2001) Conditional random fields: probabilistic models for segmenting and labeling sequence data. In: Proceedings of 18th international conference on machine learning (ICML\u201903), pp 282\u2013289"},{"key":"128_CR24","doi-asserted-by":"crossref","first-page":"226","DOI":"10.1111\/j.2517-6161.1982.tb01203.x","volume":"44","author":"TA Louis","year":"1982","unstructured":"Louis TA (1982) Finding the observed information matrix when using the EM algorithm. J R Stat Soc Ser B 44: 226\u2013233","journal-title":"J R Stat Soc Ser B"},{"key":"128_CR25","doi-asserted-by":"crossref","unstructured":"Malouf R (2002) A comparison of algorithms for maximum entropy parameter estimation. In: Proceedings of the sixth conference on natural language learning (CoNLL-2002), pp 49\u201355","DOI":"10.3115\/1118853.1118871"},{"key":"128_CR26","unstructured":"McLachlan GJ, Krishnan T (1997) The EM algorithm and extensions. Wiley series in probability and statistics. Wiley-Interscience"},{"key":"128_CR27","doi-asserted-by":"crossref","first-page":"413","DOI":"10.1016\/0024-3795(94)90363-8","volume":"199","author":"X-L Meng","year":"1994","unstructured":"Meng X-L, Rubin DB (1994) On the global and componentwise rates of convergence of the EM algorithm. Linear Algebra Appl 199: 413\u2013425","journal-title":"Linear Algebra Appl"},{"key":"128_CR28","doi-asserted-by":"crossref","unstructured":"Nocedal J, Wright SJ (1999) Numerical optimization. Springer","DOI":"10.1007\/b98874"},{"key":"128_CR29","doi-asserted-by":"crossref","unstructured":"Pearl J (1988) Probabilistic reasoning in intelligent systems: networks of plausible inference. Morgan Kaufmann","DOI":"10.1016\/B978-0-08-051489-5.50008-4"},{"key":"128_CR30","unstructured":"Russell S, Binder J, Koller D, Kanazawa K (1995) Local learning in probabilistic networks with hidden variables. In: Proceedings of the fourteenth international joint conference on artificial intelligence (IJCAI\u201995), pp 1146\u20131152"},{"key":"128_CR31","unstructured":"Salakhutdinov R, Roweis S (2003) Adaptive overrelaxed bound optimization methods. In: Proceedings of the twentieth international conference on machine learning (ICML\u201903), pp 664\u2013671"},{"key":"128_CR32","unstructured":"Salakhutdinov R, Roweis S, Ghahramani Z (2003) On the convergence of bound optimization algorithms. In: Conference on uncertainty in artificial intelligence (UAI\u201903), pp 509\u2013516"},{"key":"128_CR33","doi-asserted-by":"crossref","DOI":"10.1201\/9781439821862","volume-title":"Analysis of incomplete multivariate data","author":"JL Schafer","year":"1997","unstructured":"Schafer JL (1997) Analysis of incomplete multivariate data. Chapman and Hall, New York"},{"key":"128_CR34","doi-asserted-by":"crossref","unstructured":"Settles B (2004) Biomedical named entity recognition using conditional random fields and novel feature sets. In: Proceedings of the joint workshop on natural language processing in biomedicine and its applications (JNLPBA-2004), pp 104\u2013107","DOI":"10.3115\/1567594.1567618"},{"key":"128_CR35","doi-asserted-by":"crossref","unstructured":"Sha F, Pereira F (2003) Shallow parsing with conditional random fields. In: Proceedings of human language technology, the North American Chapter of the Association for Computational Linguistics (NAACL\u201903), pp 213\u2013220","DOI":"10.3115\/1073445.1073473"},{"issue":"3","key":"128_CR36","doi-asserted-by":"crossref","first-page":"279","DOI":"10.1023\/A:1017986506241","volume":"45","author":"B Thiesson","year":"2001","unstructured":"Thiesson B, Meek C, Heckerman D (2001) Accelerating EM for large databases. Mach Learn 45(3): 279\u2013299","journal-title":"Mach Learn"},{"key":"128_CR37","unstructured":"Tjong EF, Sang K, Buchholz S (2000) Introduction to the CoNLL-2000 shared task: Chunking. In: Proceedings of conference on computational natural language learning (CoNLL-2000), pp 127\u2013132"},{"key":"128_CR38","unstructured":"Varadhan R, Roland C (2004) Squared extrapolation methods (SQUAREM): a newclass of simple and efficient numerical schemes for accelerating the convergence of the EM algorithm. Department of Biostatistics Working Paper, Johns Hopkins University, Paper 63"},{"key":"128_CR39","unstructured":"Wilbur J, Smith L, Tanabe L (2007). Biocreative 2. Gene mention task. In: Proceedings of the second biocreative challenge evaluation workshop, pp 7\u201316"}],"container-title":["Data Mining and Knowledge Discovery"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10618-009-0128-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10618-009-0128-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10618-009-0128-3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,8]],"date-time":"2025-02-08T02:59:32Z","timestamp":1738983572000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10618-009-0128-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,3,6]]},"references-count":39,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2009,8]]}},"alternative-id":["128"],"URL":"https:\/\/doi.org\/10.1007\/s10618-009-0128-3","relation":{},"ISSN":["1384-5810","1573-756X"],"issn-type":[{"type":"print","value":"1384-5810"},{"type":"electronic","value":"1573-756X"}],"subject":[],"published":{"date-parts":[[2009,3,6]]}}}