{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T17:56:10Z","timestamp":1775066170473,"version":"3.50.1"},"reference-count":34,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/legalcode"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Science Foundation of China","doi-asserted-by":"publisher","award":["61806166"],"award-info":[{"award-number":["61806166"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Science Foundation of China","doi-asserted-by":"publisher","award":["61801362"],"award-info":[{"award-number":["61801362"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100007128","name":"Natural Science Foundation of Shaanxi Province","doi-asserted-by":"publisher","award":["2020JQ-197"],"award-info":[{"award-number":["2020JQ-197"]}],"id":[{"id":"10.13039\/501100007128","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100012226","name":"Fundamental Research Funds for the Central Universities, Northwestern Polytechnical University","doi-asserted-by":"publisher","award":["G2018KY0303"],"award-info":[{"award-number":["G2018KY0303"]}],"id":[{"id":"10.13039\/501100012226","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Access"],"published-print":{"date-parts":[[2021]]},"DOI":"10.1109\/access.2021.3051190","type":"journal-article","created":{"date-parts":[[2021,1,13]],"date-time":"2021-01-13T19:18:10Z","timestamp":1610565490000},"page":"14351-14357","source":"Crossref","is-referenced-by-count":4,"title":["Optimizing Non-Differentiable Metrics for Hashing"],"prefix":"10.1109","volume":"9","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-8216-6156","authenticated-orcid":false,"given":"Yiwen","family":"Wei","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5830-0650","authenticated-orcid":false,"given":"Dayong","family":"Tian","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1124-6738","authenticated-orcid":false,"given":"Jiao","family":"Shi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9892-4460","authenticated-orcid":false,"given":"Yu","family":"Lei","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2018.00464"},{"key":"ref32","first-page":"832","article-title":"Scalable learning of non-decomposable objectives","volume":"54","author":"eban","year":"2017","journal-title":"Mach Learn Res"},{"key":"ref31","first-page":"1341","article-title":"Deep value networks learn to evaluate and iteratively refine structured outputs","volume":"70","author":"gygli","year":"2017","journal-title":"Proc 34th Int Conf Mach Learn"},{"key":"ref30","first-page":"1245","article-title":"From cost-sensitive classification to tight F-measure bounds","volume":"89","author":"bascol","year":"2019","journal-title":"Proc Int Conf Artif Intell Statist (AISTATS)"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1109\/TIP.2016.2617081"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2011.103"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/TIP.2015.2421443"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2013.205"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/TIP.2015.2405340"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2020.2988923"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2014.267"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/TIP.2016.2627801"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/TNNLS.2019.2954856"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/TNNLS.2018.2827036"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2016.133"},{"key":"ref28","first-page":"2744","article-title":"Consistent binary classification with generalized performance metrics","author":"natarajan","year":"2014","journal-title":"Proc Neural Inf Process Syst (NIPS)"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1145\/1327452.1327494"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-44851-9_15"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2011.5995432"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1145\/509961.509965"},{"key":"ref29","first-page":"2123","article-title":"Optimizing F-measures by cost-sensitive classification","volume":"2","author":"parambath","year":"2014","journal-title":"Proc 27th Int Conf Neural Inf Process Syst"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2011.219"},{"key":"ref8","article-title":"Hashing with graphs","author":"liu","year":"2011","journal-title":"Proc Int Conf Mach Learn"},{"key":"ref7","first-page":"1753","article-title":"Spectral hashing","author":"weiss","year":"2008","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref2","article-title":"Learning surrogate losses","author":"grabocka","year":"2019"},{"key":"ref9","first-page":"1646","article-title":"Isotropic hashing","author":"kong","year":"2012","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref1","first-page":"659","article-title":"Predict and constrain: Modeling cardinality in deep structured prediction","volume":"80","author":"brukhim","year":"2018","journal-title":"Proc 35th Int Conf Mach Learn"},{"key":"ref20","article-title":"Very deep convolutional networks for large-scale image recognition","author":"simonyan","year":"2014"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.24963\/ijcai.2018\/148"},{"key":"ref21","first-page":"913","article-title":"Stochastic generative hashing","volume":"70","author":"dai","year":"2017","journal-title":"Proc Int Conf Mach Learn (ICML)"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/TNNLS.2019.2927868"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2019.00306"},{"key":"ref26","first-page":"289","article-title":"Optimizing f-measures: A tale of two approaches","author":"ye","year":"2012","journal-title":"Proc 29th Int Conf Mach Learn"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR42600.2020.00289"}],"container-title":["IEEE Access"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6287639\/9312710\/09319875.pdf?arnumber=9319875","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,12,17]],"date-time":"2021-12-17T19:56:09Z","timestamp":1639770969000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9319875\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"references-count":34,"URL":"https:\/\/doi.org\/10.1109\/access.2021.3051190","relation":{},"ISSN":["2169-3536"],"issn-type":[{"value":"2169-3536","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021]]}}}