{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T08:20:03Z","timestamp":1743150003321,"version":"3.40.3"},"publisher-location":"Cham","reference-count":17,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319681207"},{"type":"electronic","value":"9783319681214"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017]]},"DOI":"10.1007\/978-3-319-68121-4_35","type":"book-chapter","created":{"date-parts":[[2017,9,26]],"date-time":"2017-09-26T12:23:46Z","timestamp":1506428626000},"page":"321-332","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["Channels\u2019 Matching Algorithm for Mixture Models"],"prefix":"10.1007","author":[{"given":"Chenguang","family":"Lu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,9,27]]},"reference":[{"key":"35_CR1","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1111\/j.2517-6161.1977.tb01600.x","volume":"39","author":"AP Dempster","year":"1977","unstructured":"Dempster, A.P., Laird, N.M., Rubin, D.B.: Maximum likelihood from incomplete data via the EM algorithm. J. Roy. Stat. Soc. B 39, 1\u201338 (1977)","journal-title":"J. Roy. Stat. Soc. B"},{"key":"35_CR2","doi-asserted-by":"crossref","unstructured":"Kok, M., Dahlin, J.B., Schon, T.B., Wills, A: Newton-based maximum likelihood estimation in nonlinear state space models. In: IFAC-PapersOnLine 48, pp. 398\u2013403 (2015)","DOI":"10.1016\/j.ifacol.2015.12.160"},{"key":"35_CR3","volume-title":"A Generalized Information Theory","author":"C Lu","year":"1993","unstructured":"Lu, C.: A Generalized Information Theory. China Science and Technology University Press, Hefei (1993). (in Chinese)"},{"key":"35_CR4","first-page":"37","volume":"15","author":"C Lu","year":"1994","unstructured":"Lu, C.: Coding meanings of generalized entropy and generalized mutual information. J. China Inst. Commun. 15, 37\u201344 (1994). (in Chinese)","journal-title":"J. China Inst. Commun."},{"key":"35_CR5","doi-asserted-by":"publisher","first-page":"453","DOI":"10.1080\/03081079908935247","volume":"28","author":"C Lu","year":"1999","unstructured":"Lu, C.: A generalization of Shannon\u2019s information theory. Int. J. Gen. Syst. 28, 453\u2013490 (1999)","journal-title":"Int. J. Gen. Syst."},{"key":"35_CR6","doi-asserted-by":"crossref","unstructured":"Shannon, C.E.: A mathematical theory of communication. Bell Syst. Tech. J. 27, 379\u2013429, 623\u2013656 (1948)","DOI":"10.1002\/j.1538-7305.1948.tb00917.x"},{"key":"35_CR7","first-page":"142","volume":"4","author":"CE Shannon","year":"1959","unstructured":"Shannon, C.E.: Coding theorems for a discrete source with a fidelity criterion. IRE Nat. Conv. Rec. 4, 142\u2013163 (1959)","journal-title":"IRE Nat. Conv. Rec."},{"key":"35_CR8","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1214\/aoms\/1177729694","volume":"22","author":"S Kullback","year":"1951","unstructured":"Kullback, S., Leibler, R.: On information and sufficiency. Ann. Math. Stat. 22, 79\u201386 (1951)","journal-title":"Ann. Math. Stat."},{"key":"35_CR9","doi-asserted-by":"publisher","first-page":"716","DOI":"10.1109\/TAC.1974.1100705","volume":"19","author":"H Akaike","year":"1974","unstructured":"Akaike, H.: A new look at the statistical model identification. IEEE Trans. Autom. Control 19, 716\u2013723 (1974)","journal-title":"IEEE Trans. Autom. Control"},{"key":"35_CR10","doi-asserted-by":"publisher","first-page":"338","DOI":"10.1016\/S0019-9958(65)90241-X","volume":"8","author":"LA Zadeh","year":"1965","unstructured":"Zadeh, L.A.: Fuzzy sets. Inf. Control 8, 338\u2013353 (1965)","journal-title":"Inf. Control"},{"key":"35_CR11","unstructured":"Thomas, S.F.: Possibilistic uncertainty and statistical inference. ORSA\/TIMS Meeting, Houston, Texas (1981)"},{"key":"35_CR12","volume-title":"Fundamentals of Information Theory","author":"J Zhou","year":"1983","unstructured":"Zhou, J.: Fundamentals of Information Theory. People\u2019s Posts & Telecom Press, Beijing (1983). (in Chinese)"},{"key":"35_CR13","unstructured":"Byrne, C.L.: The EM algorithm theory applications and related methods. https:\/\/www.researchgate.net\/profile\/Charles_Byrne"},{"key":"35_CR14","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1214\/aos\/1176346060","volume":"11","author":"CFJ Wu","year":"1983","unstructured":"Wu, C.F.J.: On the convergence properties of the EM algorithm. Ann. Stat. 11, 95\u2013103 (1983)","journal-title":"Ann. Stat."},{"key":"35_CR15","first-page":"355","volume-title":"Learning in Graphical Models","author":"R Neal","year":"1999","unstructured":"Neal, R., Hinton, G.: A view of the EM algorithm that justifies incremental, sparse, and other variants. In: Jordan, M.I. (ed.) Learning in Graphical Models, pp. 355\u2013368. MIT Press, Cambridge (1999)"},{"key":"35_CR16","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1016\/j.spl.2017.02.021","volume":"126","author":"WH Huang","year":"2017","unstructured":"Huang, W.H., Chen, Y.G.: The multiset EM algorithm. Stat. Probab. Lett. 126, 41\u201348 (2017)","journal-title":"Stat. Probab. Lett."},{"key":"35_CR17","doi-asserted-by":"publisher","first-page":"335","DOI":"10.1007\/s11075-013-9794-8","volume":"67","author":"T Springer","year":"2014","unstructured":"Springer, T., Urban, K.: Comparison of the EM algorithm and alternatives. Numer. Algorithms 67, 335\u2013364 (2014)","journal-title":"Numer. Algorithms"}],"container-title":["IFIP Advances in Information and Communication Technology","Intelligence Science I"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-68121-4_35","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,6,27]],"date-time":"2024-06-27T07:41:39Z","timestamp":1719474099000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-68121-4_35"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319681207","9783319681214"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-68121-4_35","relation":{},"ISSN":["1868-4238","1868-422X"],"issn-type":[{"type":"print","value":"1868-4238"},{"type":"electronic","value":"1868-422X"}],"subject":[],"published":{"date-parts":[[2017]]},"assertion":[{"value":"27 September 2017","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ICIS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Intelligence Science","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Shanghai","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"China","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2017","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25 October 2017","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"28 October 2017","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"icis2017","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/cie.shmtu.edu.cn\/icis-2017\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}