{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,19]],"date-time":"2025-12-19T09:40:30Z","timestamp":1766137230747},"reference-count":46,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"name":"Hong Kong Research Grants Council","award":["GRF152201\/14E"],"award-info":[{"award-number":["GRF152201\/14E"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Knowl. Data Eng."],"published-print":{"date-parts":[[2019]]},"DOI":"10.1109\/tkde.2019.2931969","type":"journal-article","created":{"date-parts":[[2019,7,30]],"date-time":"2019-07-30T20:19:26Z","timestamp":1564517966000},"page":"1-1","source":"Crossref","is-referenced-by-count":5,"title":["The Power of Bounds: Answering Approximate Earth Mover's Distance with Parametric Bounds"],"prefix":"10.1109","author":[{"given":"Tsz Nam","family":"Chan","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Man Lung","family":"Yiu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Leong Hou","family":"U","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.14778\/2732240.2732249"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1007\/BF00130487"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1023\/A:1026543900054"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1109\/ICCV.1998.710701"},{"key":"ref31","first-page":"6:1","article-title":"Approximating optimal transport with linear programs","author":"quanrud","year":"2019","journal-title":"Proc 2nd Symp Simplicity Algorithms (SOSA)"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/ICCV.2009.5459199"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1109\/34.895972"},{"key":"ref36","first-page":"1","article-title":"Approximate earth mover's distance in linear time","author":"shirdhonkar","year":"2008","journal-title":"Proc IEEE Conf Comput Vis Pattern Recognit"},{"key":"ref35","first-page":"772","article-title":"Generalized preconditioning and undirected minimum-cost flow","author":"sherman","year":"2017","journal-title":"Proceedings of the 5th Annual ACM-SIAM Symposium on Discrete Algorithms"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.14778\/2078331.2078336"},{"key":"ref10","first-page":"231","article-title":"Comparing clusterings in space","author":"coen","year":"2010","journal-title":"Proc 27th Int Conf Mach Learn"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-33718-5_32"},{"key":"ref11","article-title":"The earth mover's distance: Lower bounds and invariance under translation technical report","author":"cohen","year":"1997"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1007\/s10791-007-9039-3"},{"key":"ref13","article-title":"The PASCAL visual object classes challenge 2007 (VOC2007) Results","author":"everingham","year":"2007"},{"key":"ref14","article-title":"Caltech-256 object category dataset","author":"griffin","year":"2007"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/34.391417"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2014.6816702"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/TPDS.2015.2462354"},{"key":"ref18","doi-asserted-by":"crossref","first-page":"39","DOI":"10.1145\/1460096.1460104","article-title":"The MIR flickr retrieval evaluation","author":"huiskes","year":"2008","journal-title":"Proc 1st ACM Int Conf Multimedia Inf Retrieval"},{"key":"ref19","first-page":"39","article-title":"A near linear time constant factor approximation for Euclidean bichromatic matching (cost)","author":"indyk","year":"2007","journal-title":"Proc 18th Annu ACM-SIAM Symp Discr Algorithms"},{"key":"ref28","first-page":"2429","article-title":"Matching node embeddings for graph similarity","author":"nikolentzos","year":"2017","journal-title":"Proc 31st AAAI Conf Artif Intell"},{"key":"ref4","first-page":"343","article-title":"Earth mover distance over high-dimensional spaces","author":"andoni","year":"2008","journal-title":"Proc 19th Annu ACM-SIAM Symp Discr Algorithms"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-004-0552-5"},{"key":"ref3","first-page":"1961","article-title":"Near-linear time approximation algorithms for optimal transport via sinkhorn iteration","author":"altschuler","year":"2017","journal-title":"Proc 31st Int Conf Neural Inf Process Syst"},{"key":"ref6","first-page":"11","article-title":"Approximation techniques for indexing the earth mover's distance in multimedia databases","author":"assent","year":"2006","journal-title":"Proc 2nd Int Conf Data Eng"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1145\/62212.62249"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1145\/2020408.2020508"},{"key":"ref8","article-title":"Towards optimal running times for optimal transport","author":"blanchet","year":"2018","journal-title":"CoRR"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2008.4497439"},{"key":"ref2","author":"ahuja","year":"1993","journal-title":"Network Flows - Theory Algorithms and Applications"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511804441"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1145\/2591796.2591844"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2008.299"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1145\/2063576.2063652"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1007\/s11263-006-9794-4"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/TIP.2004.826125"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1007\/s11390-014-1417-x"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1145\/1376616.1376639"},{"key":"ref24","first-page":"545","article-title":"NNS lower bounds via metric expansion for l $\\infty$? and EMD","author":"kapralov","year":"2012","journal-title":"Proc Colloq Autom Lang Program"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1109\/34.955109"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/TCSVT.2004.826775"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.14778\/1920841.1920938"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1007\/11687238_51"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2015.2411281"},{"key":"ref25","first-page":"957","article-title":"From word embeddings to document distances","author":"kusner","year":"2015","journal-title":"Proc 32nd Int Conf Mach Learn"}],"container-title":["IEEE Transactions on Knowledge and Data Engineering"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/69\/4358933\/08781913.pdf?arnumber=8781913","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,5,10]],"date-time":"2022-05-10T14:50:47Z","timestamp":1652194247000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8781913\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"references-count":46,"URL":"https:\/\/doi.org\/10.1109\/tkde.2019.2931969","relation":{},"ISSN":["1041-4347","1558-2191","2326-3865"],"issn-type":[{"value":"1041-4347","type":"print"},{"value":"1558-2191","type":"electronic"},{"value":"2326-3865","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019]]}}}