{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,9,13]],"date-time":"2023-09-13T20:30:22Z","timestamp":1694637022926},"reference-count":26,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"11","license":[{"start":{"date-parts":[[2009,11,1]],"date-time":"2009-11-01T00:00:00Z","timestamp":1257033600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Inform. Theory"],"published-print":{"date-parts":[[2009,11]]},"DOI":"10.1109\/tit.2009.2030460","type":"journal-article","created":{"date-parts":[[2009,10,27]],"date-time":"2009-10-27T17:29:54Z","timestamp":1256664594000},"page":"5251-5262","source":"Crossref","is-referenced-by-count":8,"title":["Individual Sequence Prediction Using Memory-Efficient Context Trees"],"prefix":"10.1109","volume":"55","author":[{"given":"Ofer","family":"Dekel","sequence":"first","affiliation":[]},{"given":"Shai","family":"Shalev-Shwartz","sequence":"additional","affiliation":[]},{"given":"Yoram","family":"Singer","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511546921"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1978.1055934"},{"key":"ref12","first-page":"387","article-title":"extensions to the context tree weighting method","author":"willems","year":"1994","journal-title":"Proc IEEE Int Symp Inf Theory"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/18.382012"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1007\/BF00114008"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1214\/aos\/1018031204"},{"key":"ref16","doi-asserted-by":"crossref","first-page":"381","DOI":"10.1089\/106652700750050844","article-title":"optimal amnesic probabilistic automata, or, how to learn and classify proteins in linear time and space","volume":"7","author":"bejerano","year":"2000","journal-title":"J Comput Biol"},{"key":"ref17","first-page":"263","article-title":"behavior of sequential predictors of binary sequences","author":"cover","year":"1965","journal-title":"Proc 4th Conf Inf Theory Statist Decision Functions Random Processes"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.4153\/CJM-1954-037-2"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1037\/h0042519"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1967.1053964"},{"key":"ref3","first-page":"97","volume":"iii","author":"hannan","year":"1957","journal-title":"Contributions to the Theory of Games"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/18.144706"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/TSMC.1977.4309738"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1023\/A:1007396710653"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.1993.748374"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.2140\/pjm.1956.6.1"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1023\/A:1007670818503"},{"key":"ref1","first-page":"131","article-title":"asymptotically subminimax solutions of compound statistical decision problems","author":"robbins","year":"1951","journal-title":"Proc Symp Math Stat Prob"},{"key":"ref20","first-page":"615","article-title":"on convergence proofs on perceptrons","volume":"xii","author":"novikoff","year":"1962","journal-title":"Proc Symp Math Theory Automata"},{"key":"ref22","author":"shalev-shwartz","year":"2007","journal-title":"Online learning Theory algorithms and applications"},{"key":"ref21","author":"shalev-shwartz","year":"2006","journal-title":"Advances in Neural Information Processing Systems 20"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1145\/307400.307405"},{"key":"ref23","first-page":"483","article-title":"tracking the best hyperplane with a simple budget perceptron","author":"cesa-bianchi","year":"2006","journal-title":"Proc 11th Annu Conf Computational Learning Theory"},{"key":"ref26","first-page":"551","article-title":"online passive aggressive algorithms","volume":"7","author":"crammer","year":"2006","journal-title":"J Mach Learn Res"},{"key":"ref25","author":"duda","year":"1973","journal-title":"Pattern Classification and Scene Analysis"}],"container-title":["IEEE Transactions on Information Theory"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/18\/5290270\/05290305.pdf?arnumber=5290305","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,10,10]],"date-time":"2021-10-10T23:52:23Z","timestamp":1633909943000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/5290305\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,11]]},"references-count":26,"journal-issue":{"issue":"11"},"URL":"https:\/\/doi.org\/10.1109\/tit.2009.2030460","relation":{},"ISSN":["0018-9448","1557-9654"],"issn-type":[{"value":"0018-9448","type":"print"},{"value":"1557-9654","type":"electronic"}],"subject":[],"published":{"date-parts":[[2009,11]]}}}