{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T06:14:56Z","timestamp":1742969696261,"version":"3.40.3"},"publisher-location":"Boston, MA","reference-count":13,"publisher":"Springer US","isbn-type":[{"type":"print","value":"9780387307718"},{"type":"electronic","value":"9780387314396"}],"license":[{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-0-387-31439-6_692","type":"book-chapter","created":{"date-parts":[[2014,6,6]],"date-time":"2014-06-06T09:19:29Z","timestamp":1402046369000},"page":"265-268","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Expectation Maximization Algorithm"],"prefix":"10.1007","author":[{"given":"Boris","family":"Flach","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"ProfessorVaclav","family":"Hlavac","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,2,5]]},"reference":[{"key":"217_CR586","doi-asserted-by":"publisher","DOI":"10.1007\/b137972","volume-title":"Stochastik","author":"D Meintrup","year":"2005","unstructured":"Meintrup D, Sch\u00e4ffler S (2005) Stochastik. Springer, Berlin"},{"key":"217_CR587","volume-title":"Probability and Statistics","author":"A Papoulis","year":"1990","unstructured":"Papoulis A (1990) Probability and Statistics. Prentice-Hall, Englewood Cliffs"},{"key":"217_CR588","volume-title":"Expectation-maximization as lower bound maximization","author":"T Minka","year":"1998","unstructured":"Minka T (1998) Expectation-maximization as lower bound maximization. Tutorial, MIT, Cambridge, MA"},{"key":"217_CR589","unstructured":"Dellaert F (2002) The expectation maximization algorithm. Technical report GIT-GVU-02-20, Georgia Institute of Technology"},{"issue":"1","key":"217_CR590","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 AP, Laird NM, Rubin DB (1977) Maximum likelihood from incomplete data via the EM algorithm. J R Stat Soci Ser B 39(1):1\u201338","journal-title":"J R Stat Soci Ser B"},{"issue":"2","key":"217_CR591","first-page":"81","volume":"4","author":"MI Schlesinger","year":"1968","unstructured":"Schlesinger MI (1968) The interaction of learning and self-organization in pattern recognition. Kibernetika 4(2):81\u201388","journal-title":"Kibernetika"},{"issue":"2","key":"217_CR592","first-page":"49","volume":"1","author":"R Sundberg","year":"1974","unstructured":"Sundberg R (1974) Maximum likelihood theory for incomplete data from an exponential family. Scand J Stat 1(2): 49\u201358","journal-title":"Scand J Stat"},{"key":"217_CR593","volume-title":"The EM algorithm and extensions","author":"GJ McLachlan","year":"1997","unstructured":"McLachlan GJ, Krishnan T (1997) The EM algorithm and extensions. Wiley, New York"},{"key":"217_CR594","doi-asserted-by":"publisher","DOI":"10.1007\/978-94-017-3217-8","volume-title":"Ten lectures on statistical and structural pattern recognition","author":"MI Schlesinger","year":"2002","unstructured":"Schlesinger MI, Hlavac V (2002) Ten lectures on statistical and structural pattern recognition. Kluwer Academic Publishers, Dordrecht"},{"key":"217_CR595","volume-title":"Pattern recognition and machine learning","author":"CM Bishop","year":"2006","unstructured":"Bishop CM (2006) Pattern recognition and machine learning. Springer, New York"},{"issue":"8","key":"217_CR596","doi-asserted-by":"publisher","first-page":"790","DOI":"10.1109\/34.400568","volume":"17","author":"Y Cheng","year":"1995","unstructured":"Cheng Y (1995) Mean shift, mode seeking, and clustering. IEEE Trans Pattern Anal Mach Intell 17(8):790\u2013799","journal-title":"IEEE Trans Pattern Anal Mach Intell"},{"key":"217_CR597","volume-title":"Statistical methods for speech recognition","author":"F Jelinek","year":"1998","unstructured":"Jelinek F (1998) Statistical methods for speech recognition. MIT, Cambridge, MA"},{"key":"217_CR598","volume-title":"Markov random field modeling in image analysis","author":"SZ Li","year":"2009","unstructured":"Li SZ (2009) Markov random field modeling in image analysis. 3rd edn. Advances in pattern recognition. Springer, London","edition":"3"}],"container-title":["Computer Vision"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-0-387-31439-6_692","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,5,27]],"date-time":"2024-05-27T10:56:52Z","timestamp":1716807412000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-0-387-31439-6_692"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9780387307718","9780387314396"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-0-387-31439-6_692","relation":{},"subject":[],"published":{"date-parts":[[2014]]},"assertion":[{"value":"5 February 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"5 February 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"5 February 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"5 February 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"5 February 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"5 February 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"5 February 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"5 February 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"5 February 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"5 February 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"5 February 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"5 February 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"5 February 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"5 February 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"5 February 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"5 February 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"5 February 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"5 February 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"5 February 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}