{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:23:05Z","timestamp":1725664985862},"publisher-location":"Berlin, Heidelberg","reference-count":10,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540626855"},{"type":"electronic","value":"9783540684312"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1997]]},"DOI":"10.1007\/3-540-62685-9_18","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T22:47:43Z","timestamp":1330296463000},"page":"210-222","source":"Crossref","is-referenced-by-count":1,"title":["A minimax lower bound for empirical quantizer design"],"prefix":"10.1007","author":[{"given":"Peter","family":"Bartlett","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tam\u00e1s","family":"Linder","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"G\u00e1bor","family":"Lugosi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,3]]},"reference":[{"key":"18_CR1","doi-asserted-by":"crossref","first-page":"1041","DOI":"10.1214\/aop\/1176993141","volume":"4","author":"K. Alexander","year":"1984","unstructured":"K. Alexander. Probability inequalities for empirical processes and a law of the iterated logarithm. Annals of Probability, 4:1041\u20131067, 1984.","journal-title":"Annals of Probability"},{"key":"18_CR2","unstructured":"P. A. Chou. The distortion of vector quantizers trained on n vectors decreases to the optimum as Op(1\/n). Proceedings of IEEE Int. Symp. Inform. Theory, Trondheim, Norway, 1994."},{"key":"18_CR3","volume-title":"Probability Theory, Independence, Interchangeability, Martingales","author":"Y.S. Chow","year":"1978","unstructured":"Y.S. Chow and H. Teicher. Probability Theory, Independence, Interchangeability, Martingales. Springer-Verlag, New York, 1978."},{"key":"18_CR4","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4612-0711-5","volume-title":"A Probabilistic Theory of Pattern Recognition","author":"L. Devroye","year":"1996","unstructured":"L. Devroye, L. Gy\u00f6rfi, and G. Lugosi. A Probabilistic Theory of Pattern Recognition. Springer-Verlag, New York, 1996."},{"key":"18_CR5","first-page":"277","volume":"17","author":"A.N. Kolmogorov","year":"1961","unstructured":"A.N. Kolmogorov and V.M. Tikhomirov. \u03b5-entropy and \u03b5-capacity of sets in function spaces. Translations of the American Mathematical Society, 17:277\u2013364, 1961.","journal-title":"Translations of the American Mathematical Society"},{"key":"18_CR6","doi-asserted-by":"crossref","first-page":"1728","DOI":"10.1109\/18.340451","volume":"40","author":"T. Linder","year":"1994","unstructured":"T. Linder, G. Lugosi, and K. Zeger. Rates of convergence in the source coding theorem, empirical quantizer design, and universal lossy source coding. IEEE Transactions on Information Theory, 40:1728\u20131740, 1994.","journal-title":"IEEE Transactions on Information Theory"},{"key":"18_CR7","doi-asserted-by":"crossref","unstructured":"T. Linder, G. Lugosi, and K. Zeger. Empirical quantizer design in the presence of source noise or channel noise. IEEE Transactions on Information Theory, 1996. to appear.","DOI":"10.1109\/18.556117"},{"key":"18_CR8","doi-asserted-by":"crossref","first-page":"422","DOI":"10.1093\/biomet\/55.2.422","volume":"55","author":"C.L. Mallows","year":"1968","unstructured":"C.L. Mallows. An inequality involving multinomial probabilities. Biometrika, 55:422\u2013424, 1968.","journal-title":"Biometrika"},{"key":"18_CR9","unstructured":"N. Merhav and J. Ziv. On the amount of side information required for lossy data compression. submitted to IEEE Transactions on Information Theory, 1995."},{"key":"18_CR10","doi-asserted-by":"crossref","first-page":"919","DOI":"10.1214\/aop\/1176993713","volume":"10","author":"D. Pollard","year":"1982","unstructured":"D. Pollard. A central limit theorem for k-means clustering. Annals of Probability, 10:919\u2013926, 1982.","journal-title":"Annals of Probability"}],"container-title":["Lecture Notes in Computer Science","Computational Learning Theory"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-62685-9_18.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T21:13:52Z","timestamp":1605647632000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-62685-9_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997]]},"ISBN":["9783540626855","9783540684312"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/3-540-62685-9_18","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1997]]}}}