{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,29]],"date-time":"2025-09-29T11:56:07Z","timestamp":1759146967558,"version":"3.28.0"},"reference-count":16,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012,9]]},"DOI":"10.1109\/itw.2012.6404679","type":"proceedings-article","created":{"date-parts":[[2013,1,17]],"date-time":"2013-01-17T15:30:12Z","timestamp":1358436612000},"page":"297-301","source":"Crossref","is-referenced-by-count":3,"title":["Construction of irregular histograms by penalized maximum likelihood: A comparative study"],"prefix":"10.1109","author":[{"given":"Panu","family":"Luosto","sequence":"first","affiliation":[]},{"given":"Ciprian Doru","family":"Giurcaneanu","sequence":"additional","affiliation":[]},{"given":"Petri","family":"Kontkanen","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"15","doi-asserted-by":"crossref","first-page":"227","DOI":"10.1016\/j.ipl.2007.04.003","article-title":"A linear-time algorithm for computing the multinomial stochastic complexity","volume":"103","author":"kontkanen","year":"2007","journal-title":"Inform Process Lett"},{"key":"16","first-page":"142","article-title":"On asymptotics of certain recurrences arising in universal coding","volume":"34","author":"szpankowski","year":"1998","journal-title":"Probl Inf Transm"},{"key":"13","doi-asserted-by":"publisher","DOI":"10.2478\/s13537-011-0033-x"},{"key":"14","doi-asserted-by":"publisher","DOI":"10.1109\/ISITA.2008.4895421"},{"key":"11","doi-asserted-by":"publisher","DOI":"10.1016\/j.csda.2010.04.021"},{"key":"12","article-title":"The normalized maximum likelihood distribution of the multinomial model class with positive maximum likelihood parameters","author":"luosto","year":"2012","journal-title":"Department of Computer Science Tech Rep C-2012-5"},{"key":"3","article-title":"Modified akaike's criterion for histogram density estimation","author":"castellan","year":"1999","journal-title":"Univ de Paris-Sud France Technical Report #99 61"},{"key":"2","doi-asserted-by":"publisher","DOI":"10.1007\/BF01203164"},{"key":"1","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.1974.1100705"},{"key":"10","doi-asserted-by":"publisher","DOI":"10.1214\/aos\/1176344136"},{"journal-title":"Estimation par Minimum de Contraste Re?gulier et Heuristique de Pente en Se?lection de Mode?les","year":"2010","author":"saumard","key":"7"},{"key":"6","article-title":"MDL histogram density estimation","author":"kontkanen","year":"2007","journal-title":"Proc 5th Int Workshop Artificial Intelligence and Statistics"},{"key":"5","doi-asserted-by":"crossref","DOI":"10.1007\/978-0-387-68812-1","author":"rissanen","year":"2007","journal-title":"Information and Complexity in Statistical Modeling"},{"journal-title":"Concentration Inequalities and Model Selection","year":"2007","author":"massart","key":"4"},{"journal-title":"Computationally Efficient Methods for MDL-optimal Density Estimation and Data Clustering","year":"2009","author":"kontkanen","key":"9"},{"key":"8","doi-asserted-by":"publisher","DOI":"10.1109\/18.481776"}],"event":{"name":"2012 IEEE Information Theory Workshop (ITW 2012)","start":{"date-parts":[[2012,9,3]]},"location":"Lausanne, Switzerland","end":{"date-parts":[[2012,9,7]]}},"container-title":["2012 IEEE Information Theory Workshop"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/6389798\/6404631\/06404679.pdf?arnumber=6404679","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,7,8]],"date-time":"2019-07-08T08:31:10Z","timestamp":1562574670000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/6404679\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,9]]},"references-count":16,"URL":"https:\/\/doi.org\/10.1109\/itw.2012.6404679","relation":{},"subject":[],"published":{"date-parts":[[2012,9]]}}}