{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,7]],"date-time":"2026-02-07T09:01:56Z","timestamp":1770454916637,"version":"3.49.0"},"reference-count":64,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/501100000923","name":"Australian Research Council","doi-asserted-by":"publisher","award":["DE170101081"],"award-info":[{"award-number":["DE170101081"]}],"id":[{"id":"10.13039\/501100000923","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100000923","name":"Australian Research Council","doi-asserted-by":"publisher","award":["DP180100106"],"award-info":[{"award-number":["DP180100106"]}],"id":[{"id":"10.13039\/501100000923","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100000923","name":"Australian Research Council","doi-asserted-by":"publisher","award":["DP200101328"],"award-info":[{"award-number":["DP200101328"]}],"id":[{"id":"10.13039\/501100000923","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans.Inform.Forensic Secur."],"published-print":{"date-parts":[[2020]]},"DOI":"10.1109\/tifs.2020.2997183","type":"journal-article","created":{"date-parts":[[2020,5,25]],"date-time":"2020-05-25T22:11:51Z","timestamp":1590444711000},"page":"3640-3652","source":"Crossref","is-referenced-by-count":3,"title":["Secure Metric Learning via Differential Pairwise Privacy"],"prefix":"10.1109","volume":"15","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-7584-1240","authenticated-orcid":false,"given":"Jing","family":"Li","sequence":"first","affiliation":[]},{"given":"Yuangang","family":"Pan","sequence":"additional","affiliation":[]},{"given":"Yulei","family":"Sui","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2211-8176","authenticated-orcid":false,"given":"Ivor W.","family":"Tsang","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.24963\/ijcai.2017\/548"},{"key":"ref38","first-page":"1069","article-title":"Differentially private empirical risk minimization","volume":"12","author":"chaudhuri","year":"2011","journal-title":"J Mach Learn Res"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1109\/GLOCOMW.2017.8269219"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.14722\/ndss.2016.23279"},{"key":"ref31","doi-asserted-by":"crossref","first-page":"229","DOI":"10.1109\/TIFS.2014.2368363","article-title":"Correlated differential privacy: Hiding information in non-IID data set","volume":"10","author":"zhu","year":"2015","journal-title":"IEEE Trans Inf Forensics Security"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1145\/2723372.2737785"},{"key":"ref37","doi-asserted-by":"crossref","first-page":"211","DOI":"10.1561\/0400000042","article-title":"The algorithmic foundations of differential privacy","volume":"9","author":"dwork","year":"2014","journal-title":"Found Trends Theor Comput Sci"},{"key":"ref36","first-page":"1315","article-title":"Preventing privacy disclosure from hostility attack base on associated attributes","author":"zhao","year":"2019","journal-title":"Proc Int Conf Appl Techn Cybern Secur Intell"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2019.8849381"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1145\/1250790.1250803"},{"key":"ref60","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2013.07.004"},{"key":"ref62","first-page":"1109","article-title":"Large scale online learning of image similarity through ranking","volume":"11","author":"chechik","year":"2010","journal-title":"J Mach Learn Res"},{"key":"ref61","doi-asserted-by":"publisher","DOI":"10.1080\/01621459.2017.1389735"},{"key":"ref63","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2016.434"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2009.11"},{"key":"ref64","first-page":"1895","article-title":"Evaluating differentially private machine learning in practice","author":"jayaraman","year":"2019","journal-title":"Proc 28th USENIX Secur Symp (USENIX Secur )"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.14778\/3402707.3402749"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1145\/1559795.1559812"},{"key":"ref2","first-page":"521","article-title":"Distance metric learning with application to clustering with side-information","author":"xing","year":"2003","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref1","article-title":"A survey on metric learning for feature vectors and structured data","author":"bellet","year":"2013","journal-title":"arXiv 1306 6709"},{"key":"ref20","article-title":"Differential privacy by sampling","author":"joy","year":"2017","journal-title":"arXiv 1708 01884"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/BigData.2018.8622635"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1145\/3133956.3134086"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1145\/1989323.1989345"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-67786-6_6"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1145\/3035918.3064025"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1145\/2213556.2213571"},{"key":"ref50","first-page":"831","article-title":"Principles of risk minimization for learning theory","author":"vapnik","year":"1992","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref51","doi-asserted-by":"publisher","DOI":"10.1016\/S0012-365X(00)00088-1"},{"key":"ref59","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-36594-2_26"},{"key":"ref58","author":"ruggles","year":"2004","journal-title":"Integrated public use microdata series minnesota population center"},{"key":"ref57","author":"dua","year":"2017","journal-title":"UCI Machine Learning Repository"},{"key":"ref56","doi-asserted-by":"publisher","DOI":"10.1145\/3219819.3220076"},{"key":"ref55","doi-asserted-by":"publisher","DOI":"10.1016\/j.patcog.2016.11.010"},{"key":"ref54","doi-asserted-by":"publisher","DOI":"10.1145\/1559845.1559850"},{"key":"ref53","first-page":"862","article-title":"Regularized distance metric learning: Theory and algorithm","author":"jin","year":"2009","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref52","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2005.202"},{"key":"ref10","first-page":"5409","article-title":"Nonoverlap-promoting variable selection","author":"xie","year":"2018","journal-title":"Proc Int Conf Mach Learn"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611972818.6"},{"key":"ref40","first-page":"289","article-title":"Privacy-preserving logistic regression","author":"chaudhuri","year":"2009","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611975321.31"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.24963\/ijcai.2019\/490"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1007\/11681878_14"},{"key":"ref15","article-title":"Differential privacy and machine learning: A survey and review","author":"ji","year":"2014","journal-title":"arXiv 1412 7584 [cs]"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/SP.2008.33"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.2139\/ssrn.2289850"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1080\/01621459.1965.10480775"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611974973.75"},{"key":"ref4","first-page":"400","article-title":"Learning with idealized kernels","author":"kwok","year":"2003","journal-title":"Proc Int Conf Mach Learn"},{"key":"ref3","first-page":"126","article-title":"Distance metric learning with kernels","author":"tsang","year":"2003","journal-title":"Proc Int Conf Artif Neural Netw"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/ICCV.2009.5459197"},{"key":"ref5","first-page":"207","article-title":"Distance metric learning for large margin nearest neighbor classification","volume":"10","author":"weinberger","year":"2009","journal-title":"J Mach Learn Res"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2014.242"},{"key":"ref7","first-page":"1","article-title":"Distance metric learning with eigenvalue optimization","volume":"13","author":"ying","year":"2012","journal-title":"J Mach Learn Res"},{"key":"ref49","article-title":"Online deep metric learning","author":"li","year":"2018","journal-title":"arXiv 1805 05510"},{"key":"ref9","first-page":"1857","article-title":"Improved deep metric learning with multi-class n-pair loss objective","author":"sohn","year":"2016","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref46","first-page":"3025","article-title":"Nearly optimal private lasso","author":"talwar","year":"2015","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2014.56"},{"key":"ref48","first-page":"2722","article-title":"Differentially private empirical risk minimization revisited: Faster and more general","author":"wang","year":"2017","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.1145\/2976749.2978318"},{"key":"ref42","article-title":"Private empirical risk minimization beyond the worst case: The effect of the constraint set geometry","author":"talwar","year":"2014","journal-title":"arXiv 1411 5417"},{"key":"ref41","first-page":"1","article-title":"Private convex empirical risk minimization and high-dimensional regression","author":"kifer","year":"2012","journal-title":"Proc Conf Learn Theory"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1109\/GlobalSIP.2013.6736861"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1109\/PAC.2017.12"}],"container-title":["IEEE Transactions on Information Forensics and Security"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/10206\/8833568\/09099300.pdf?arnumber=9099300","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,4,27]],"date-time":"2022-04-27T17:00:41Z","timestamp":1651078841000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9099300\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"references-count":64,"URL":"https:\/\/doi.org\/10.1109\/tifs.2020.2997183","relation":{},"ISSN":["1556-6013","1556-6021"],"issn-type":[{"value":"1556-6013","type":"print"},{"value":"1556-6021","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020]]}}}