{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,10]],"date-time":"2026-02-10T19:17:53Z","timestamp":1770751073319,"version":"3.50.0"},"reference-count":41,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"9","license":[{"start":{"date-parts":[[2014,9,1]],"date-time":"2014-09-01T00:00:00Z","timestamp":1409529600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"}],"funder":[{"DOI":"10.13039\/501100003977","name":"Israel Science Foundation","doi-asserted-by":"publisher","award":["1141\/12"],"award-info":[{"award-number":["1141\/12"]}],"id":[{"id":"10.13039\/501100003977","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Yahoo Faculty Award"},{"DOI":"10.13039\/501100003977","name":"Israel Science Foundation","doi-asserted-by":"crossref","award":["452\/08"],"award-info":[{"award-number":["452\/08"]}],"id":[{"id":"10.13039\/501100003977","id-type":"DOI","asserted-by":"crossref"}]},{"name":"U.S.-Israel Binational Science Foundation","award":["2010418"],"award-info":[{"award-number":["2010418"]}]},{"name":"Minerva Grant"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Inform. Theory"],"published-print":{"date-parts":[[2014,9]]},"DOI":"10.1109\/tit.2014.2339840","type":"journal-article","created":{"date-parts":[[2014,7,29]],"date-time":"2014-07-29T14:36:27Z","timestamp":1406644587000},"page":"5750-5759","source":"Crossref","is-referenced-by-count":38,"title":["Efficient Classification for Metric Data"],"prefix":"10.1109","volume":"60","author":[{"given":"Lee-Ad","family":"Gottlieb","sequence":"first","affiliation":[]},{"given":"Aryeh","family":"Kontorovich","sequence":"additional","affiliation":[]},{"given":"Robert","family":"Krauthgamer","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref39","first-page":"201","article-title":"Efficient retrieval of similar time sequences under time warping","author":"yi","year":"1998","journal-title":"Proc 14th Int Conf Data Eng (ICDE)"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.14778\/2536360.2536375"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9781107298019"},{"key":"ref32","author":"sch\u00f6lkopf","year":"2002","journal-title":"Learning With Kernels Support Vector Machines Regularization Optimization and Beyond"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1023\/A:1026543900054"},{"key":"ref30","first-page":"495","article-title":"A linear time histogram metric for improved sift matching","author":"pele","year":"2008","journal-title":"Proc 10th Eur Conf Comput Vis (ECCV)"},{"key":"ref37","article-title":"Breaking the Coppersmith-Winograd barrier","author":"williams","year":"2012","journal-title":"Proc 44th Annu ACM Symp Theory Comput (STOC)"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.2307\/1989708"},{"key":"ref35","author":"wasserman","year":"2006","journal-title":"All of Nonparametric Statistics (Statistics)"},{"key":"ref34","first-page":"669","article-title":"Distance-based classification with Lipschitz functions","volume":"5","author":"von luxburg","year":"2004","journal-title":"J Mach Learn Res"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1145\/1132516.1132599"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1109\/IJCNN.2009.5179093"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1007\/BF00994018"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1967.1053964"},{"key":"ref13","first-page":"91","article-title":"Large-margin classification in Banach spaces","author":"der","year":"2007","journal-title":"Proc 11th Int Conf Artif Intell Statist (AISTATS)"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1007\/BF02589549"},{"key":"ref15","first-page":"1","article-title":"Multi-dimensional sparse time series: Feature extraction","author":"franciosi","year":"2008","journal-title":"Proc CoRR"},{"key":"ref16","first-page":"433","article-title":"Efficient classification for metric data","author":"gottlieb","year":"2010","journal-title":"Proc COLT"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1137\/120874242"},{"key":"ref18","first-page":"1","article-title":"Classification of sparse time series via supervised matrix factorization","author":"grabocka","year":"2012","journal-title":"Proc AAAI"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2004.1315035"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2004.40"},{"key":"ref4","first-page":"43","article-title":"Generalization performance of support vector machines and other pattern classifiers","author":"bartlett","year":"1999","journal-title":"Advances in Kernel Methods Support Vector Learning"},{"key":"ref27","author":"mohri","year":"2012","journal-title":"Foundations of Machine Learning"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1016\/0196-6774(81)90020-1"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1145\/780587.780590"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1137\/05064206X"},{"key":"ref5","first-page":"463","article-title":"Rademacher and Gaussian complexities: Risk bounds and structural results","volume":"3","author":"bartlett","year":"2003","journal-title":"J Mach Learn Res"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1016\/j.jcss.2009.01.003"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1145\/1143844.1143857"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1137\/080716530"},{"key":"ref9","first-page":"792","article-title":"On the marriage of \\(L_{p}\\) -norms and edit distance","volume":"30","author":"chen","year":"2004","journal-title":"Proc 30th Int Conf Very Large Data Bases"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1145\/263867.263927"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/ICCV.2005.239"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539704446281"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.2003.1238226"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1186\/1687-4722-2013-3"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1109\/ACSSC.2010.5757677"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1016\/j.jcss.2004.10.013"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1090\/S0002-9904-1934-05978-0"},{"key":"ref25","first-page":"798","article-title":"Navigating nets: Simple algorithms for proximity search","author":"krauthgamer","year":"2004","journal-title":"Proc 15th Annu ACM-SIAM Symp Discrete Algorithms"}],"container-title":["IEEE Transactions on Information Theory"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/18\/6878505\/06867374.pdf?arnumber=6867374","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,12]],"date-time":"2022-01-12T11:50:27Z","timestamp":1641988227000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/6867374\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,9]]},"references-count":41,"journal-issue":{"issue":"9"},"URL":"https:\/\/doi.org\/10.1109\/tit.2014.2339840","relation":{},"ISSN":["0018-9448","1557-9654"],"issn-type":[{"value":"0018-9448","type":"print"},{"value":"1557-9654","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,9]]}}}