{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,1]],"date-time":"2026-05-01T05:40:51Z","timestamp":1777614051482,"version":"3.51.4"},"reference-count":40,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"3","license":[{"start":{"date-parts":[[2022,3,1]],"date-time":"2022-03-01T00:00:00Z","timestamp":1646092800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2022,3,1]],"date-time":"2022-03-01T00:00:00Z","timestamp":1646092800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2022,3,1]],"date-time":"2022-03-01T00:00:00Z","timestamp":1646092800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["U1836112"],"award-info":[{"award-number":["U1836112"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61876134"],"award-info":[{"award-number":["61876134"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["U1536204"],"award-info":[{"award-number":["U1536204"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61872275"],"award-info":[{"award-number":["61872275"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Knowl. Data Eng."],"published-print":{"date-parts":[[2022,3,1]]},"DOI":"10.1109\/tkde.2020.2995070","type":"journal-article","created":{"date-parts":[[2020,5,16]],"date-time":"2020-05-16T00:31:23Z","timestamp":1589589083000},"page":"1038-1052","source":"Crossref","is-referenced-by-count":17,"title":["An Effective Imbalanced JPEG Steganalysis Scheme Based on Adaptive Cost-Sensitive Feature Learning"],"prefix":"10.1109","volume":"34","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-1228-3274","authenticated-orcid":false,"given":"Ju","family":"Jia","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Liming","family":"Zhai","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Weixiang","family":"Ren","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8085-1312","authenticated-orcid":false,"given":"Lina","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0799-5082","authenticated-orcid":false,"given":"Yanzhen","family":"Ren","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1016\/j.sigpro.2009.08.010"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1145\/1288869.1288872"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1186\/1687-417X-2014-1"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1007\/s11042-017-5053-7"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/TCSVT.2018.2865537"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TIFS.2016.2555281"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1016\/j.patcog.2019.107105"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/TIFS.2012.2190402"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/TIFS.2014.2364918"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1145\/2756601.2756608"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1016\/j.jvcir.2017.09.016"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2015.2462355"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1016\/j.patcog.2017.12.017"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/TGRS.2018.2813366"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/TIFS.2013.2286682"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1016\/j.jvcir.2015.10.013"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1007\/s10489-017-0989-x"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2018.02.051"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2015.2458858"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.24963\/ijcai.2018\/290"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1016\/j.patcog.2015.04.009"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1587\/transfun.E100.A.2518"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1007\/s11042-018-6526-z"},{"key":"ref24","first-page":"1404","article-title":"An exact algorithm for F-measure maximization","volume-title":"Proc. Int. Conf. Neural Inf. Process. Syst.","author":"Dembczynski"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1016\/j.patcog.2016.08.008"},{"key":"ref26","first-page":"1245","article-title":"From cost-sensitive to tight F-measure bounds","volume-title":"Proc. 22nd Int. Conf. Artif. Intell. Statist.","author":"Bascol"},{"key":"ref27","first-page":"199","article-title":"Optimizing non-decomposable performance measures: A tale of two classes","volume-title":"Proc. 32nd Int. Conf. Mach. Learn.","author":"Narasimhan"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2009.23"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2018.2836440"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2013.102"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2015.2497686"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2017.2682249"},{"key":"ref33","first-page":"605","article-title":"Globally optimal gradient descent for a convnet with gaussian inputs","volume-title":"Proc. 34th Int. Conf. Mach. Learn.","author":"Brutzkus"},{"key":"ref34","first-page":"5977","article-title":"The convergence of sparsified gradient methods","volume-title":"Proc. Int. Conf. Neural Inf. Process. Syst.","author":"Alistarh"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1137\/16M1062016"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2016.2599168"},{"key":"ref37","article-title":"Boss (break our stegnography system).","author":"Filler","year":"2010"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v31i1.10739"},{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1109\/TCYB.2017.2682418"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2019.01.041"}],"container-title":["IEEE Transactions on Knowledge and Data Engineering"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/69\/9702896\/09094308.pdf?arnumber=9094308","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,1,9]],"date-time":"2024-01-09T22:20:23Z","timestamp":1704838823000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9094308\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,3,1]]},"references-count":40,"journal-issue":{"issue":"3"},"URL":"https:\/\/doi.org\/10.1109\/tkde.2020.2995070","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":[[2022,3,1]]}}}