{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,19]],"date-time":"2025-11-19T07:07:36Z","timestamp":1763536056501,"version":"3.37.3"},"reference-count":46,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"6","license":[{"start":{"date-parts":[[2024,6,1]],"date-time":"2024-06-01T00:00:00Z","timestamp":1717200000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2024,6,1]],"date-time":"2024-06-01T00:00:00Z","timestamp":1717200000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2024,6,1]],"date-time":"2024-06-01T00:00:00Z","timestamp":1717200000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"name":"National Key Research and Development Program of China","award":["2021ZD0112501","2021ZD0112502"],"award-info":[{"award-number":["2021ZD0112501","2021ZD0112502"]}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["62276113","61976102","U19A2065"],"award-info":[{"award-number":["62276113","61976102","U19A2065"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Fundamental Research Funds for the Central Universities, Jilin University"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Neural Netw. Learning Syst."],"published-print":{"date-parts":[[2024,6]]},"DOI":"10.1109\/tnnls.2022.3222336","type":"journal-article","created":{"date-parts":[[2022,11,24]],"date-time":"2022-11-24T16:39:20Z","timestamp":1669307960000},"page":"7936-7948","source":"Crossref","is-referenced-by-count":2,"title":["Eliminating Negative Word Similarities for Measuring Document Distances: A Thoroughly Empirical Study on Word Mover\u2019s Distance"],"prefix":"10.1109","volume":"35","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-3209-4342","authenticated-orcid":false,"given":"Bo","family":"Cheng","sequence":"first","affiliation":[{"name":"School of Artificial Intelligence, Jilin University, Changchun, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8190-5087","authenticated-orcid":false,"given":"Ximing","family":"Li","sequence":"additional","affiliation":[{"name":"College of Computer Science and Technology, Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education, Jilin University, Changchun, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2697-8093","authenticated-orcid":false,"given":"Yi","family":"Chang","sequence":"additional","affiliation":[{"name":"School of Artificial Intelligence, Jilin University, Changchun, China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1145\/1143844.1143892"},{"key":"ref2","first-page":"77","article-title":"Web-search ranking with initialized gradient boosted regression trees","volume-title":"Proc. Int. Conf. Yahoo! Learn. Rank Challenge","author":"Mohan"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1145\/3233186"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1016\/0306-4573(88)90021-0"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-36755-1_44"},{"key":"ref6","first-page":"957","article-title":"From word embeddings to document distances","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Kusner"},{"key":"ref7","first-page":"1","article-title":"Efficient estimation of word representations in vector space","volume-title":"Proc. Int. Conf. Learn. Represent.","author":"Mikolov"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/ICCV.1998.710701"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/BigData.2017.8258005"},{"key":"ref10","first-page":"364","article-title":"Linear-complexity data-parallel earth mover\u2019s distance approximations","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Atasu"},{"key":"ref11","first-page":"1","article-title":"Speeding up word mover\u2019s distance and its variants via properties of distances between embeddings","volume-title":"Proc. Eur. Conf. Artif. Intell.","author":"Werner"},{"key":"ref12","first-page":"1599","article-title":"Hierarchical optimal transport for document representation","volume-title":"Proc. Neural Inf. Process. Syst.","author":"Yurochkin"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4471-2099-5_24"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1145\/860435.860545"},{"key":"ref15","first-page":"763","article-title":"Proposing a new term weighting scheme for text categorization","volume-title":"Proc. AAAI Conf. Artif. Intell.","author":"Lan"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2008.110"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipm.2018.05.009"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1002\/(SICI)1097-4571(199009)41:6<391::AID-ASI1>3.0.CO;2-9"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1038\/44565"},{"key":"ref20","first-page":"993","article-title":"Latent Dirichlet allocation","volume":"3","author":"Blei","year":"2003","journal-title":"J. Mach. Learn. Res."},{"key":"ref21","first-page":"10","article-title":"Documents as multiple overlapping windows into grids of counts","volume-title":"Proc. Neural Inf. Process. Syst.","author":"Perina"},{"key":"ref22","first-page":"2177","article-title":"Neural word embedding as implicit matrix factorization","volume-title":"Proc. Neural Inf. Process. Syst.","volume":"2014","author":"Levy"},{"key":"ref23","first-page":"1","article-title":"Words are not equal: Graded weighting model for building composite document vectors","volume-title":"Proc. Int. Conf. Natural Lang. Process.","author":"Singh"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/P16-1063"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v29i1.9522"},{"key":"ref26","first-page":"1","article-title":"A simple but tough-to-beat baseline for sentence embeddings","volume-title":"Proc. Int. Conf. Learn. Represent.","author":"Arora"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v34i05.6292"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/N18-1202"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/n18-1049"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.48550\/arXiv.1810.04805"},{"key":"ref31","article-title":"DocBERT: BERT for document classification","author":"Adhikari","year":"2019","journal-title":"arXiv:1904.08398"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/D19-1053"},{"key":"ref33","article-title":"BERTScore: Evaluating text generation with BERT","author":"Zhang","year":"2019","journal-title":"arXiv:1904.09675"},{"key":"ref34","article-title":"Longformer: The long-document transformer","author":"Beltagy","year":"2020","journal-title":"arXiv:2004.05150"},{"key":"ref35","first-page":"2292","article-title":"Lightspeed computation of optimal transport","volume-title":"Proc. Neural Inf. Process. Syst.","author":"Cuturi"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/p19-1264"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/W19-5356"},{"key":"ref38","first-page":"3440","article-title":"Stochastic optimization for large-scale optimal transport","volume-title":"Proc. Neural Inf. Process. Syst.","author":"Genevay"},{"key":"ref39","first-page":"1","article-title":"Large-scale optimal transport and mapping estimation","volume-title":"Proc. Int. Conf. Learn. Represent.","author":"Seguy"},{"key":"ref40","first-page":"4869","article-title":"Supervised word mover\u2019s distance","volume-title":"Proc. Neural Inf. Process. Syst.","author":"Huang"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.3115\/v1\/D14-1162"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1109\/ICCV.2009.5459199"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1016\/j.patcog.2006.12.019"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1109\/TPC.1972.6591971"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/2020.emnlp-main.733"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/D18-1045"}],"container-title":["IEEE Transactions on Neural Networks and Learning Systems"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/5962385\/10547160\/09961102.pdf?arnumber=9961102","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,9,3]],"date-time":"2024-09-03T04:40:26Z","timestamp":1725338426000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9961102\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,6]]},"references-count":46,"journal-issue":{"issue":"6"},"URL":"https:\/\/doi.org\/10.1109\/tnnls.2022.3222336","relation":{},"ISSN":["2162-237X","2162-2388"],"issn-type":[{"type":"print","value":"2162-237X"},{"type":"electronic","value":"2162-2388"}],"subject":[],"published":{"date-parts":[[2024,6]]}}}