{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,4]],"date-time":"2022-04-04T09:33:09Z","timestamp":1649064789823},"reference-count":13,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"7","license":[{"start":{"date-parts":[[2013,4,1]],"date-time":"2013-04-01T00:00:00Z","timestamp":1364774400000},"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. Signal Process."],"published-print":{"date-parts":[[2013,4]]},"DOI":"10.1109\/tsp.2012.2234742","type":"journal-article","created":{"date-parts":[[2013,3,8]],"date-time":"2013-03-08T19:42:37Z","timestamp":1362771757000},"page":"1595-1604","source":"Crossref","is-referenced-by-count":0,"title":["Adaptive Universal Linear Filtering"],"prefix":"10.1109","volume":"61","author":[{"given":"Dan","family":"Garber","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Elad","family":"Hazan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref10","first-page":"928","article-title":"Online convex programming and generalized infinitesimal gradient ascent","author":"zinkevich","year":"2003","journal-title":"Proc Int Conf Machine Learning (ICML97)"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1007\/s10994-007-5016-8"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1145\/1553374.1553425"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2011.2164053"},{"key":"ref4","doi-asserted-by":"crossref","DOI":"10.7551\/mitpress\/2946.001.0001","author":"wiener","year":"1949","journal-title":"Extrapolation Interpolation and Smoothing of Stationary Time Series with Engineering Applications"},{"key":"ref3","first-page":"421","article-title":"Beyond the regret minimization barrier: an optimal algorithm for stochastic strongly-convex optimization","volume":"19","author":"hazan","year":"2011","journal-title":"Journal of Machine Learning Research-Proc Track"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.1980.1102349"},{"key":"ref5","author":"kailath","year":"2000","journal-title":"Linear Estimation"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2004.831144"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2004.828931"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2011.2176931"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2008.2009894"},{"key":"ref9","author":"haykin","year":"2000","journal-title":"Unsupervised Adaptive Filtering Volume I II"}],"container-title":["IEEE Transactions on Signal Processing"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/78\/6476733\/06384815.pdf?arnumber=6384815","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,11,29]],"date-time":"2021-11-29T20:55:55Z","timestamp":1638219355000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/6384815\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,4]]},"references-count":13,"journal-issue":{"issue":"7"},"URL":"https:\/\/doi.org\/10.1109\/tsp.2012.2234742","relation":{},"ISSN":["1053-587X","1941-0476"],"issn-type":[{"value":"1053-587X","type":"print"},{"value":"1941-0476","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,4]]}}}