{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,25]],"date-time":"2025-07-25T10:22:24Z","timestamp":1753438944516,"version":"3.37.3"},"reference-count":44,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/OAPA.html"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61202439","61302159","61602059","61872448"],"award-info":[{"award-number":["61202439","61302159","61602059","61872448"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Scientific Research Foundation of Hunan Provincial Education Department of China","award":["16A008"],"award-info":[{"award-number":["16A008"]}]},{"name":"Hunan Key Laboratory of Smart Roadway and Cooperative Vehicle-Infrastructure Systems","award":["2017TP1016"],"award-info":[{"award-number":["2017TP1016"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Access"],"published-print":{"date-parts":[[2018]]},"DOI":"10.1109\/access.2018.2878273","type":"journal-article","created":{"date-parts":[[2018,10,26]],"date-time":"2018-10-26T19:21:42Z","timestamp":1540581702000},"page":"64131-64141","source":"Crossref","is-referenced-by-count":20,"title":["A Word-Embedding-Based Steganalysis Method for Linguistic Steganography via Synonym Substitution"],"prefix":"10.1109","volume":"6","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-7396-0908","authenticated-orcid":false,"given":"Lingyun","family":"Xiang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jingmin","family":"Yu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6487-379X","authenticated-orcid":false,"given":"Chunfang","family":"Yang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Daojian","family":"Zeng","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xiaobo","family":"Shen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.21437\/Interspeech.2010-343"},{"key":"ref38","first-page":"1137","article-title":"A neural probabilistic language model","volume":"3","author":"bengio","year":"2003","journal-title":"J Mach Learn Res"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2013.50"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1016\/j.diin.2011.03.001"},{"key":"ref31","first-page":"21","article-title":"Steganalysis of synonym-substitution based natural language watermarking","volume":"4","author":"yu","year":"2009","journal-title":"Int J Multimedia Ubiquitous Eng"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1007\/s11042-012-1313-8"},{"key":"ref37","first-page":"1","article-title":"Learning distributed representations of concepts","author":"hinton","year":"1986","journal-title":"Proc 8th Conf Cognit Sci Soc (CSS)"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/D15-1303"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/N16-1030"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2018.2791525"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/TCYB.2016.2606441"},{"key":"ref40","first-page":"3111","article-title":"Distributed representations of words and phrases and their compositionality","author":"mikolov","year":"2013","journal-title":"Proc Int Conf Neural Inf Process Syst (NIPS)"},{"key":"ref11","article-title":"Discrete multi-graph hashing for large-scale visual search","author":"xiang","year":"0","journal-title":"Neural Process Lett"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/TNNLS.2017.2763967"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/TIFS.2017.2710946"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1117\/12.711325"},{"key":"ref15","doi-asserted-by":"crossref","first-page":"86","DOI":"10.1145\/2566590.2566610","article-title":"Trends in steganography","volume":"57","author":"mazurczyk","year":"2014","journal-title":"Commun ACM"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/D15-1307"},{"key":"ref17","first-page":"67","article-title":"Performance analysis on text steganalysis method using a computational intelligence approach","author":"din","year":"2015","journal-title":"Proc Int Conf Electr Eng Comput Sci Inf (EECSI)"},{"journal-title":"Lexical steganography through adaptive modulation of the word choice hash","year":"1998","author":"winstein","key":"ref18"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1162\/COLI_a_00176"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/FGCN.2008.39"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2018.2817508"},{"key":"ref27","first-page":"607209-1","article-title":"Attacks on lexical natural language steganography systems","volume":"6072","author":"taskiran","year":"2006","journal-title":"Proc SPIE"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1016\/j.sigpro.2018.01.011"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1007\/s11432-017-9328-2"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1016\/j.compeleceng.2011.07.004"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1016\/j.commatsci.2018.07.031"},{"key":"ref8","article-title":"Improved PTAS for the constrained k-means problem","author":"feng","year":"0","journal-title":"J Combinat Optim"},{"key":"ref7","article-title":"An improved linear kernel for complementary maximal strip recovery: Simpler and smaller","author":"li","year":"0","journal-title":"Theor Comput Sci"},{"key":"ref2","first-page":"1","article-title":"A fusion steganographic algorithm based on faster R-CNN","volume":"55","author":"meng","year":"2018","journal-title":"CMC Comput Mater Continua"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2018.2847037"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1080\/13658816.2015.1049541"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/ICITCS.2016.7740349"},{"key":"ref22","first-page":"1296","article-title":"Synonym substitution-based steganographic algorithm with matrix coding","volume":"36","author":"yang","year":"2015","journal-title":"J Chin Comput Syst"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1587\/transinf.2016EDP7358"},{"key":"ref42","first-page":"1810","article-title":"Learning character-level representations for part-of speech tagging","author":"zadrozny","year":"2014","journal-title":"Proc Int Mach Learn Conf (ML)"},{"key":"ref24","first-page":"541","article-title":"Reversible natural language watermarking using synonym substitution and arithmetic coding","volume":"55","author":"xiang","year":"2018","journal-title":"CMC Comput Mater Continua"},{"journal-title":"Efficient Estimation of Word Representations in Vector Space","year":"2013","author":"mikolov","key":"ref41"},{"key":"ref23","first-page":"145","article-title":"Adaptive text steganography by exploring statistical and linguistical distortion","author":"hu","year":"2017","journal-title":"Proc IEEE Int Conf Data Sci Cyberspace (DSC)"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-39804-2_12"},{"key":"ref26","article-title":"Selection of rich model steganalysis features based on decision rough set \n$\\alpha$\n-positive region reduction","author":"ma","year":"0","journal-title":"IEEE Trans Circuits Syst Video Technol"},{"key":"ref43","first-page":"121","article-title":"Adversarial learning for distant supervised relation extraction","volume":"55","author":"zeng","year":"2018","journal-title":"CMC Comput Mater Continua"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1007\/s11042-018-6072-8"}],"container-title":["IEEE Access"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6287639\/8274985\/08510794.pdf?arnumber=8510794","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,27]],"date-time":"2022-01-27T02:41:58Z","timestamp":1643251318000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8510794\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"references-count":44,"URL":"https:\/\/doi.org\/10.1109\/access.2018.2878273","relation":{},"ISSN":["2169-3536"],"issn-type":[{"type":"electronic","value":"2169-3536"}],"subject":[],"published":{"date-parts":[[2018]]}}}