{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,30]],"date-time":"2024-10-30T07:52:20Z","timestamp":1730274740044,"version":"3.28.0"},"reference-count":13,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013,7]]},"DOI":"10.1109\/isit.2013.6620481","type":"proceedings-article","created":{"date-parts":[[2013,10,11]],"date-time":"2013-10-11T22:57:32Z","timestamp":1381532252000},"page":"1521-1525","source":"Crossref","is-referenced-by-count":3,"title":["Minimum description length principle for maximum entropy model selection"],"prefix":"10.1109","author":[{"given":"Gaurav","family":"Pandey","sequence":"first","affiliation":[]},{"given":"Ambedkar","family":"Dukkipati","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"13","doi-asserted-by":"publisher","DOI":"10.1198\/016214502753479248"},{"key":"11","first-page":"61","article-title":"Using maximum entropy for text classification","volume":"1","author":"nigam","year":"1999","journal-title":"IJCAI-99 Workshop on Machine Learning for Information Filtering"},{"key":"12","doi-asserted-by":"publisher","DOI":"10.1016\/S0165-1684(02)00470-X"},{"key":"3","doi-asserted-by":"publisher","DOI":"10.1016\/0005-1098(78)90005-5"},{"key":"2","doi-asserted-by":"publisher","DOI":"10.1214\/aos\/1176344136"},{"key":"1","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.1974.1100705"},{"key":"10","first-page":"39","article-title":"A maximum entropy approach to natural language processing","volume":"22","author":"berger","year":"1996","journal-title":"Computational Linguistics"},{"key":"7","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2011.6033686"},{"journal-title":"Computing the Regret Table for Multinomial Data","year":"2005","author":"kontkanen","key":"6"},{"key":"5","first-page":"3","article-title":"Universal sequential coding of single messages","volume":"23","author":"shtar'kov","year":"1987","journal-title":"Problemy Peredachi Informatsii"},{"key":"4","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1986.1057237"},{"key":"9","article-title":"A tutorial introduction to the minimum description length principle","author":"grunwald","year":"2004","journal-title":"Arxiv Preprint math\/0605405"},{"key":"8","doi-asserted-by":"publisher","DOI":"10.1162\/neco.1997.9.8.1627"}],"event":{"name":"2013 IEEE International Symposium on Information Theory (ISIT)","start":{"date-parts":[[2013,7,7]]},"location":"Istanbul, Turkey","end":{"date-parts":[[2013,7,12]]}},"container-title":["2013 IEEE International Symposium on Information Theory"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6597029\/6620166\/06620481.pdf?arnumber=6620481","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,3,22]],"date-time":"2017-03-22T23:27:44Z","timestamp":1490225264000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/6620481\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,7]]},"references-count":13,"URL":"https:\/\/doi.org\/10.1109\/isit.2013.6620481","relation":{},"subject":[],"published":{"date-parts":[[2013,7]]}}}