<?xml version="1.0" encoding="UTF-8"?>
<!DOCTYPE article PUBLIC "-//NLM//DTD JATS (Z39.96) Journal Publishing DTD v1.1 20151215//EN" "http://jats.nlm.nih.gov/publishing/1.1/JATS-journalpublishing1.dtd">
<article xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:mml="http://www.w3.org/1998/Math/MathML" xml:lang="en" article-type="research-article" dtd-version="1.1">
<front>
<journal-meta>
<journal-id journal-id-type="pmc">CSSE</journal-id>
<journal-id journal-id-type="nlm-ta">CSSE</journal-id>
<journal-id journal-id-type="publisher-id">CSSE</journal-id>
<journal-title-group>
<journal-title>Computer Systems Science &#x0026; Engineering</journal-title>
</journal-title-group>
<issn pub-type="ppub">0267-6192</issn>
<publisher>
<publisher-name>Tech Science Press</publisher-name>
<publisher-loc>USA</publisher-loc>
</publisher>
</journal-meta>
<article-meta>
<article-id pub-id-type="publisher-id">37067</article-id>
<article-id pub-id-type="doi">10.32604/csse.2023.037067</article-id>
<article-categories>
<subj-group subj-group-type="heading">
<subject>Article</subject>
</subj-group>
</article-categories>
<title-group>
<article-title>A General Linguistic Steganalysis Framework Using Multi-Task Learning</article-title>
<alt-title alt-title-type="left-running-head">A General Linguistic Steganalysis Framework Using Multi-Task Learning</alt-title>
<alt-title alt-title-type="right-running-head">A General Linguistic Steganalysis Framework Using Multi-Task Learning</alt-title>
</title-group>
<contrib-group>
<contrib id="author-1" contrib-type="author" corresp="yes">
<name name-style="western"><surname>Xiang</surname><given-names>Lingyun</given-names></name><xref ref-type="aff" rid="aff-1">1</xref><email>xiangly210@163.com</email></contrib>
<contrib id="author-2" contrib-type="author">
<name name-style="western"><surname>Wang</surname><given-names>Rong</given-names></name><xref ref-type="aff" rid="aff-1">1</xref></contrib>
<contrib id="author-3" contrib-type="author">
<name name-style="western"><surname>Liu</surname><given-names>Yuhang</given-names></name><xref ref-type="aff" rid="aff-1">1</xref></contrib>
<contrib id="author-4" contrib-type="author">
<name name-style="western"><surname>Liu</surname><given-names>Yangfan</given-names></name><xref ref-type="aff" rid="aff-1">1</xref></contrib>
<contrib id="author-5" contrib-type="author">
<name name-style="western"><surname>Tan</surname><given-names>Lina</given-names></name><xref ref-type="aff" rid="aff-2">2</xref>
<xref ref-type="aff" rid="aff-3">3</xref></contrib>
<aff id="aff-1"><label>1</label><institution>School of Computer and Communication Engineering, Changsha University of Science and Technology</institution>, <addr-line>Changsha, 410114</addr-line>, <country>China</country></aff>
<aff id="aff-2"><label>2</label><institution>School of Computer Science and Electronic Engineering, University of Essex</institution>, <addr-line>Colchester, CO4 3SQ</addr-line>, <country>UK</country></aff>
<aff id="aff-3"><label>3</label><institution>School of Computer Science, Hunan University of Technology and Business</institution>, <addr-line>Changsha, 410205</addr-line>, <country>China</country></aff>
</contrib-group>
<author-notes>
<corresp id="cor1"><label>&#x002A;</label>Corresponding Author: Lingyun Xiang. Email: <email>xiangly210@163.com</email></corresp>
</author-notes>
<pub-date date-type="collection" publication-format="electronic">
<year>2023</year></pub-date>
<pub-date date-type="pub" publication-format="electronic"><day>6</day>
<month>2</month>
<year>2023</year></pub-date>
<volume>46</volume>
<issue>2</issue>
<fpage>2383</fpage>
<lpage>2399</lpage>
<history>
<date date-type="received"><day>21</day><month>10</month><year>2022</year></date>
<date date-type="accepted"><day>21</day><month>12</month><year>2022</year></date>
</history>
<permissions>
<copyright-statement>&#x00A9; 2023 Xiang et al.</copyright-statement>
<copyright-year>2023</copyright-year>
<copyright-holder>Xiang et al.</copyright-holder>
<license xlink:href="https://creativecommons.org/licenses/by/4.0/">
<license-p>This work is licensed under a <ext-link ext-link-type="uri" xlink:type="simple" xlink:href="https://creativecommons.org/licenses/by/4.0/">Creative Commons Attribution 4.0 International License</ext-link>, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.</license-p>
</license>
</permissions>
<self-uri content-type="pdf" xlink:href="TSP_CSSE_37067.pdf"></self-uri>
<abstract>
<p>Prevailing linguistic steganalysis approaches focus on learning sensitive features to distinguish a particular category of steganographic texts from non-steganographic texts, by performing binary classification. While it remains an unsolved problem and poses a significant threat to the security of cyberspace when various categories of non-steganographic or steganographic texts coexist. In this paper, we propose a general linguistic steganalysis framework named LS-MTL, which introduces the idea of multi-task learning to deal with the classification of various categories of steganographic and non-steganographic texts. LS-MTL captures sensitive linguistic features from multiple related linguistic steganalysis tasks and can concurrently handle diverse tasks with a constructed model. In the proposed framework, convolutional neural networks (CNNs) are utilized as private base models to extract sensitive features for each steganalysis task. Besides, a shared CNN is built to capture potential interaction information and share linguistic features among all tasks. Finally, LS-MTL incorporates the private and shared sensitive features to identify the detected text as steganographic or non-steganographic. Experimental results demonstrate that the proposed framework LS-MTL outperforms the baseline in the multi-category linguistic steganalysis task, while average Acc, Pre, and Rec are increased by 0.5&#x0025;, 1.4&#x0025;, and 0.4&#x0025;, respectively. More ablation experimental results show that LS-MTL with the shared module has robust generalization capability and achieves good detection performance even in the case of spare data.</p>
</abstract>
<kwd-group kwd-group-type="author">
<kwd>Linguistic steganalysis</kwd>
<kwd>multi-task learning</kwd>
<kwd>convolutional neural network (CNN)</kwd>
<kwd>feature extraction</kwd>
<kwd>detection performance</kwd>
</kwd-group>
</article-meta>
</front>
<body>
<sec id="s1"><label>1</label><title>Introduction</title>
<p>Steganography [<xref ref-type="bibr" rid="ref-1">1</xref>,<xref ref-type="bibr" rid="ref-2">2</xref>] conceals secret messages within a carrier and then transmits them through public channels, so that prospective eavesdroppers are unaware of the existence of the hidden confidential information. Since the text is the most popular and frequently used information interaction media in people&#x2019;s daily lives, linguistic steganography [<xref ref-type="bibr" rid="ref-3">3</xref>&#x2013;<xref ref-type="bibr" rid="ref-5">5</xref>], using text as the carrier for covert communication, has excellent research value and practical significance.</p>
<p>Currently, linguistic steganography has attracted wide attention from researchers and emerged as an intriguing area. It mainly includes two types of methods modification-based [<xref ref-type="bibr" rid="ref-6">6</xref>] and generation-based [<xref ref-type="bibr" rid="ref-7">7</xref>]. In modification-based methods, such as synonym substitution, the content of natural texts is selected by a human and slightly modified to achieve the purpose of hiding information. Nevertheless, it has the disadvantage of low hiding capacity due to the low redundancy of the texts. The generation-based steganography automatically generates steganographic texts with the assistance of the trained neural network-based language model, which increases the hiding capacity by generating unlimited text. Moreover, texts generated by a well-trained language model are more natural, implying that generation-based steganographic methods can generate higher-quality steganographic texts [<xref ref-type="bibr" rid="ref-8">8</xref>]. At present, generation-based linguistic steganography is the dominant and promising branch of linguistic steganography.</p>
<p>As the counter-technique of linguistic steganography, linguistic steganalysis [<xref ref-type="bibr" rid="ref-9">9</xref>] aims to reveal whether secret messages are hidden in detected texts (a text that carries secret information is called a steganographic text, and a text that does not is a non-steganographic text), preventing the seemingly regular communication between criminal offenders. Namely, linguistic steganalysis methods need to find out as much as possible about the difference in linguistic characteristics between steganographic and non-steganographic texts, and then classify them correctly. Over the past decades, linguistic steganalysis has proliferated. Early methods [<xref ref-type="bibr" rid="ref-10">10</xref>] mainly relied on manually designed statistical features to capture the artifacts of embedding operations, such as context fitness and word frequency distribution. However, they are developed based on the statistical changes targeted by specific steganography and required various heuristic features designed by the domain specialists, which hinders their performance and universality. In particular, the prevailing generation-based linguistic steganography can automatically generate higher-quality steganographic texts that are so statistically and linguistically close to natural texts, thus, it is much more difficult to distinguish them using hand-crafted features [<xref ref-type="bibr" rid="ref-11">11</xref>].</p>
<p>Due to the unprecedented success of deep learning, neural network models have been widely introduced in linguistic steganalysis [<xref ref-type="bibr" rid="ref-12">12</xref>]. The strong capability of models to automatically learn and extract discriminative features, such as the semantic and syntactic features inside detected texts, drives the detection performance of linguistic steganalysis tasks. Although these approaches achieve excellent performance and demonstrate tremendous potential for detecting generation-based linguistic steganographic methods, they perform almost a single binary steganalysis task to distinguish between steganographic and non-steganographic texts targeted by specific steganography. In more detail, different kinds of steganographic and non-steganographic texts are obtained by multiple means. For example, generated non-steganographic texts (generated without secret messages) and natural non-steganographic texts (selected from text corpora) are both referred to as non-steganographic texts; at the same time, steganographic texts also can be classified as generative steganographic texts (generated under the control of secret messages [<xref ref-type="bibr" rid="ref-4">4</xref>]) or modified steganographic texts (created by linguistic steganography through slightly modifying a natural text [<xref ref-type="bibr" rid="ref-13">13</xref>]). However, existing works in this field have yet to perform steganalysis tasks for a mixture of four categories of steganographic or non-steganographic texts. In summary, the detection performance of the prevailing binary classification methods will be limited when various types of texts coexist.</p>
<p>Intuitively, steganographic and non-steganographic texts from different sources carry various text properties, which may provide helpful information with varying characteristics for steganalysis tasks. For example, modified steganographic texts are obtained by slightly modifying natural non-steganographic texts. In contrast, generative steganographic texts are automatically generated under the constraint of secret messages, meaning they contain statistical and linguistic properties specific to the texts. When the number of tasks is large, and the learned features are required for each task, multitask learning is an appropriate approach, which provides a convenient way to combine information from multiple tasks and uses the correlation features between these related tasks to help improve the classification performance of a single task. Given the above point, we opt to use multi-task learning [<xref ref-type="bibr" rid="ref-14">14</xref>&#x2013;<xref ref-type="bibr" rid="ref-16">16</xref>] to mine potential correlation information among several steganalysis tasks. Experimental results demonstrate that the proposed approach enhances the feature learning and generalization ability of the prevailing single-task-based methods and improves the detection performance of each steganalysis task in a general framework. In summary, the main contributions of this paper are as follows:
<list list-type="bullet">
<list-item><p>We incorporate multi-task learning into linguistic steganalysis to enhance the performance of detecting steganographic texts and propose a novel general linguistic steganalysis framework, which takes advantage of the private and shared features with CNNs from multiple categories of tasks. Furthermore, the interactive shared features between tasks can effectively alleviate the data sparsity issue.</p></list-item>
<list-item><p>To the best of our knowledge, this paper is the first to perform a four-category linguistic steganalysis task in a general framework, improving the universality and generalization of linguistic steganalysis methods.</p></list-item>
<list-item><p>Experimental results show that the proposed framework can simultaneously detect various texts by training a separate model and achieve excellent steganalysis detection performance.</p></list-item>
</list></p>
</sec>
<sec id="s2"><label>2</label><title>Related Work</title>
<p>Benefiting the rapid development of deep learning, the steganographic texts generated by generation-based linguistic steganographic methods are increasingly statistically similar to non-steganographic texts. Thus, the traditional steganalysis that relies solely on the use of hand-crafted features becomes a less feasible solution for detecting steganographic texts. Considering the decisive role played by linguistic features on classification accuracy, researchers have begun to introduce deep learning into linguistic steganalysis and employ neural network models to automatically capture linguistic features for text detection. The current linguistic steganalysis methods based on the neural networks are summarized in <xref ref-type="table" rid="table-1">Table 1</xref> below, where steganographic texts are called stego texts, and non-steganographic texts are represented as non-stego texts. Subsequently, the methods mentioned in <xref ref-type="table" rid="table-1">Table 1</xref> will be elaborated.</p>
<table-wrap id="table-1"><label>Table 1</label><caption><title>The comparison and analysis of the existing linguistic steganalysis methods</title></caption>
<table frame="hsides" >
<colgroup>
<col align="left"/>
<col align="left"/>
<col align="left"/>
<col align="left"/>
</colgroup>
<thead>
<tr>
<th align="left" rowspan="2">Method</th>
<th align="center" colspan="2">Detected texts</th>
<th align="left">Characteristics</th>
</tr>
<tr>
<th align="left">Types of texts</th>
<th align="left">Stego texts</th>
</tr>
</thead>
<tbody>
<tr>
<td align="left">TS-CNN [<xref ref-type="bibr" rid="ref-17">17</xref>]</td>
<td align="left" rowspan="9">Generative stego texts and natural non-stego texts.</td>
<td align="left">CT-stega [<xref ref-type="bibr" rid="ref-17">17</xref>]</td>
<td align="left">&#x2022; Exploring the sentence-level and whole poem-level linguistic features; collecting a large corpus of steganographic poetries;<break/>&#x2022; The pooling layer of CNN only retains significant semantic features, so most of the subtle differences will be filtered in the low embedding rate; specifical for steganographic poetry, which is not universal.</td>
</tr>
<tr>
<td align="left">TS-CSW [<xref ref-type="bibr" rid="ref-18">18</xref>]</td>
<td align="left">T-stega [<xref ref-type="bibr" rid="ref-18">18</xref>]</td>
<td align="left">&#x2022; Designing special convolutional sliding windows with multiple sizes to obtain anomalous word association features triggered by secret information embedding; estimating the amount of secret information in steganographic texts; collecting a large corpus of steganographic poetries and texts;<break/>&#x2022; Specifical for steganographic poetry, not universal.</td>
</tr>
<tr>
<td align="left">GCN [<xref ref-type="bibr" rid="ref-11">11</xref>]</td>
<td align="left">T-stega [<xref ref-type="bibr" rid="ref-18">18</xref>]</td>
<td align="left">&#x2022; Using GCN to extract global information first;<break/>&#x2022; Building graphs for each text, which is costly.</td>
</tr>
<tr>
<td align="left">LSTM-Pyramid [<xref ref-type="bibr" rid="ref-20">20</xref>]</td>
<td align="left">T-stega [<xref ref-type="bibr" rid="ref-18">18</xref>]</td>
<td align="left">&#x2022; Employing LSTM with feature pyramids to incorporate more low-level features;<break/>&#x2022; Neglecting the coarse granularity of semantic text units, such as sentences.</td>
</tr>
<tr>
<td align="left">Pre-train [<xref ref-type="bibr" rid="ref-21">21</xref>]</td>
<td align="left">T-stega [<xref ref-type="bibr" rid="ref-18">18</xref>], RNN-based [<xref ref-type="bibr" rid="ref-4">4</xref>]</td>
<td align="left">&#x2022; Introducing pre-train methods by pre-training a language model based on RNN or a sequence autoencoder;<break/>&#x2022; Analyzing statistical distribution differences of texts, without considering semantic features.</td>
</tr>
<tr>
<td align="left">Dynamic-routing [<xref ref-type="bibr" rid="ref-22">22</xref>]</td>
<td align="left">RNN-based [<xref ref-type="bibr" rid="ref-4">4</xref>]</td>
<td align="left">&#x2022; Employing capsule network with dynamic routing to extract subtle differences of semantic distribution in the low embedding rate;<break/>&#x2022; Ignoring the apparent difference in texts, such as syntactic features.</td>
</tr>
<tr>
<td align="left">LSTM-CNN [<xref ref-type="bibr" rid="ref-25">25</xref>]</td>
<td align="left">T-stega [<xref ref-type="bibr" rid="ref-18">18</xref>]</td>
<td align="left">&#x2022; Employing an attention mechanism to identify important cues in suspicious sentences; extracting the contextual and semantic features;<break/>&#x2022; Relying on CNN to extract high-level local features from the global semantic space and neglecting the coarse granularity of semantic text units such as words, sentences, etc.</td>
</tr>
<tr>
<td align="left">Multi-Attention [<xref ref-type="bibr" rid="ref-26">26</xref>]</td>
<td align="left">T-stega [<xref ref-type="bibr" rid="ref-18">18</xref>]</td>
<td align="left">&#x2022; Adding the attention mechanism to extract correlation linguistic features;<break/>&#x2022; Only considering semantic interactions between words.</td>
</tr>
<tr>
<td align="left">HLS [<xref ref-type="bibr" rid="ref-27">27</xref>]</td>
<td align="left">T-stega [<xref ref-type="bibr" rid="ref-18">18</xref>]</td>
<td align="left">&#x2022; Locating where secret information may be embedded; employing BERT or Glove as an embedding layer;<break/>&#x2022; Focusing on contextualized association relationships of words and context information, but ignoring inter-sentence semantic relationships.</td>
</tr>
<tr>
<td align="left">CNN-Syn [<xref ref-type="bibr" rid="ref-19">19</xref>]</td>
<td align="left" rowspan="2">Modified stego texts and natural non-stego texts.</td>
<td align="left">T-lex</td>
<td align="left">&#x2022; Propounding a two-stage CNN, a sentence-level, and a text-level CNN;<break/>&#x2022; Only applicable to linguistic steganography based on synonyms, not universal.</td>
</tr>
<tr>
<td align="left">LSTM-GNN [<xref ref-type="bibr" rid="ref-23">23</xref>]</td>
<td align="left">T-lex</td>
<td align="left">&#x2022; Proposing two phrases to extract intra-sentential and inter-sentential features;<break/>&#x2022; Only extensive extracting features, without more fine-grained extraction of the text&#x2019;s semantic, syntactic, or statistical features.</td>
</tr>
<tr>
<td align="left">LS-CNN [<xref ref-type="bibr" rid="ref-12">12</xref>]</td>
<td align="left" colspan="2">Generative stego text (Markov-based) and natural stego texts; modified stego (T-lex) texts and natural stego texts.</td>
<td align="left">&#x2022; Utilizing CNN with a decision strategy to capture the semantic and synaptic features of long texts;<break/>&#x2022; The effectively extracted features are local.</td>
</tr>
<tr>
<td align="left">R-BILSTM-C [<xref ref-type="bibr" rid="ref-24">24</xref>]</td>
<td align="left" colspan="2">Generative stego text (T-stega [<xref ref-type="bibr" rid="ref-18">18</xref>]) and natural stego texts; modified stego (T-lex) texts and natural stego texts.</td>
<td align="left">&#x2022; Capturing local features and long-term semantic text features by asymmetric convolution kernels and residual shortcuts block;<break/>&#x2022; Neglect the coarse granularity of semantic text units, such as words.</td>
</tr>
<tr>
<td align="left">BERT-LSTM [<xref ref-type="bibr" rid="ref-28">28</xref>]</td>
<td align="left" colspan="2">Conducting a three-category task, generative (T-stega [<xref ref-type="bibr" rid="ref-18">18</xref>]), modified stego texts (T-lex), and natural non-stego texts.</td>
<td align="left">&#x2022; Introducing the idea of transfer learning;<break/>&#x2022; Increasing data noise when multiple types of steganographic texts are mixed.</td>
</tr>
</tbody>
</table>
</table-wrap>
<p>CNN is the most representative one among the many existing neural network models. The success of CNN-based generative linguistic steganographic methods has motivated researchers to apply CNN to linguistic steganalysis. Wen&#x00A0;et&#x00A0;al.&#x00A0;[<xref ref-type="bibr" rid="ref-12">12</xref>] used the word embedding layer to retrieve semantic and syntax features and employed rectangular convolution kernels of varying sizes to extract discriminative features for steganalysis tasks. To detect the generated steganographic poetry, Yang&#x00A0;et&#x00A0;al.&#x00A0;[<xref ref-type="bibr" rid="ref-17">17</xref>] proposed the single-feature and multi-feature fusion TS-CNN to capture the distribution differences in the semantic space before and after the information is hidden. In addition, Yang&#x00A0;et&#x00A0;al.&#x00A0;[<xref ref-type="bibr" rid="ref-18">18</xref>] used convolutional sliding windows of multiple sizes to obtain relevant features, distorted before and after embedding between the generated non-steganographic and steganographic texts. Xiang&#x00A0;et&#x00A0;al.&#x00A0;[<xref ref-type="bibr" rid="ref-19">19</xref>] presented a two-stage cascaded CNN-based linguistic steganalysis to improve the system&#x2019;s ability to recognize steganographic texts generated via synonym substitution.</p>
<p>Moreover, other neural networks have also been applied to tasks of linguistic steganalysis. Yang&#x00A0;et&#x00A0;al.&#x00A0;[<xref ref-type="bibr" rid="ref-20">20</xref>] introduced the idea of feature pyramids into steganalysis, developing an approach that employs densely connected Long Short-Term Memory networks (LSTMs) with feature pyramids to incorporate more low-level features and thereby achieve effective detection of steganographic texts. To capture the differences in conditional probability distributions, Yi&#x00A0;et&#x00A0;al.&#x00A0;[<xref ref-type="bibr" rid="ref-21">21</xref>] proposed two pre-trained methods for linguistic steganalysis, based on recurrent neural network (RNN) or a sequence autoencoder, to improve the detection performance. To address the shortcomings of traditional networks, Li&#x00A0;et&#x00A0;al.&#x00A0;[<xref ref-type="bibr" rid="ref-22">22</xref>] presented insightful explorations of using capsule network-based dynamic routing to extract and analyze semantic feature differences. To fully consider the global information of the text, Wu&#x00A0;et&#x00A0;al.&#x00A0;[<xref ref-type="bibr" rid="ref-11">11</xref>] introduced a Graph Convolutional Neural Network (GCN) to collect contextual information to update the node representation and further employed a global shared matrix to obtain better text representation.</p>
<p>The linguistic steganalysis methods described above primarily employ a single neural network to construct a steganalysis model that can detect whether the text is steganographic or non-steganographic. To further improve the detection accuracy, some researchers opted to combine multiple neural network models to design steganalysis methods. Li&#x00A0;et&#x00A0;al.&#x00A0;[<xref ref-type="bibr" rid="ref-23">23</xref>] proposed a two-stage text steganalysis method, which employs Bi-LSTM to obtain sentence vectors that preserve the strong correlations between word information, and also uses Graph Neural Network (GNN) to extract anomalous features from both intra-sentence and inter-sentence levels. To address the limitations of RNN and CNN in preserving semantic features, Niu&#x00A0;et&#x00A0;al.&#x00A0;[<xref ref-type="bibr" rid="ref-24">24</xref>] proposed a hybrid linguistic steganalysis scheme by combining Bi-LSTM and CNN to capture both local features and long-term semantic information. For their part, Bao&#x00A0;et&#x00A0;al.&#x00A0;[<xref ref-type="bibr" rid="ref-25">25</xref>] introduced an attention mechanism to facilitate an additional focus on suspicious information. Jiao&#x00A0;et&#x00A0;al.&#x00A0;[<xref ref-type="bibr" rid="ref-26">26</xref>] took this a step further by introducing a multi-head attention mechanism, connecting word representations with a multi-headed self-attentive representation for further classification. Subsequently, Zou&#x00A0;et&#x00A0;al.&#x00A0;[<xref ref-type="bibr" rid="ref-27">27</xref>] employed Bidirectional Encoder Representation from Transformers (BERT) and Global Vectors for Word Representation (Glove) to capture inter-sentence contextual association relationships, then extracted context information using Bi-LSTM and finally obtained the sensitive semantic features via the attention mechanism for steganographic text detection. Xu&#x00A0;et&#x00A0;al.&#x00A0;[<xref ref-type="bibr" rid="ref-28">28</xref>] employed a pre-trained BERT language model to obtain initial contextually relevant word representation, after which the extracted features were fed into an LSTM with attention to obtain the final sentence representation used to classify the detected texts. Besides, [<xref ref-type="bibr" rid="ref-28">28</xref>] also mixes the steganographic texts generated by several steganographic methods.</p>
<p>In general, there are multiple kinds of steganographic and non-steganographic texts (i.e., several steganalysis tasks). However, as shown in <xref ref-type="table" rid="table-1">Table 1</xref>, the above-mentioned linguistic steganalysis methods implement only a single binary steganalysis task, which strictly limits the generalizability of the classification model. Accordingly, motivated by multi-task learning, this paper proposes a linguistic steganalysis framework named LS-MTL, which extends the binary steganalysis task into a four-category task to enable the detection of multiple steganalysis tasks. The proposed framework can be used to implement steganalysis tasks by employing various neural networks. Benefiting from the tremendous development in the field of deep neural networks in the past two years, related researchers have used CNN to extract high-level semantic features and subtle distribution differences of different categories of texts [<xref ref-type="bibr" rid="ref-17">17</xref>]; CNN can capture complex dependencies and automatically learn feature representations from the texts. Thus, LS-MTL employs the CNN as the base model, enhancing the extraction and generalization ability by fusing the private and shared features of various categories of steganalysis tasks, thus reducing the impact of data sparsity on detection performance. It is experimentally demonstrated that the proposed steganalysis method can achieve superior detection performance.</p>

</sec>
<sec id="s3"><label>3</label><title>Proposed Method</title>
<p>Supposing that a complex problem needs to be solved, it can be decomposed into several simple and mutually independent subproblems; multiple results can then be integrated to obtain the results of the initial complex problem. We observed that the individual subproblems are interrelated, and the rich correlation information enriched between the problems is ignored when treating the problems as a single independent task. Existing linguistic steganalysis tasks typically detect a single category of steganographic and non-steganographic texts. In contrast, multiple categories of steganographic and non-steganographic texts coexist, and we need to use various steganalysis models to achieve multi-category text detection. Notably, it is worth noting that it ignores the interactive sensitive linguistic features, which still need to perform better detection performance.</p>
<p>To alleviate the problem mentioned above, this paper introduces the idea of multi-task learning to share the interaction information and sensitive linguistic features among multiple linguistic steganalysis tasks while aiding the private features of each steganalysis task. By obtaining more comprehensive and meaningful auxiliary details in this way, LS-MTL can significantly enhance the detection performance of each task in a multi-category steganalysis method. If there are <italic>M</italic> categories of steganographic texts and <italic>N</italic> categories of non-steganographic texts, LS-MTL will build <italic>k</italic> steganalysis tasks, and <inline-formula id="ieqn-1"><mml:math id="mml-ieqn-1"><mml:mi>k</mml:mi><mml:mo>=</mml:mo><mml:mi>M</mml:mi><mml:mo>&#x2217;</mml:mo><mml:mi>N</mml:mi></mml:math></inline-formula>. In this paper, we construct four linguistic steganalysis tasks by considering the four categories of texts (generative and modified steganographic texts, generative and natural non-steganographic texts). As shown in <xref ref-type="fig" rid="fig-1">Fig. 1</xref>, LS-MTL obtains the word embedding representation at the pre-processing step; then constructs private and shared feature spaces by CNNs for steganalysis tasks; finally, the globally comprehensive features are obtained by fusing each steganalysis task&#x2019;s private and shared features of each steganalysis task, which are used by the classifier to determine whether the detected text is a steganographic text (stego text) or a non-steganographic text (non-stego text). It is worth adding that the private feature space is employed to retain the linguistic features specific to each task, which are extracted by a private CNN severally; while another is utilized to capture shared inter-textual interaction features in the corpus of all steganalysis tasks, which a shared CNN constructs. The proposed general framework of LS-MTL is presented in more detail below.</p>
<fig id="fig-1"><label>Figure 1</label><caption><title>The overall framework of the proposed linguistic steganalysis framework, LS-MTL</title></caption><graphic mimetype="image" mime-subtype="tif" xlink:href="CSSE_37067-fig-1.tif"/></fig>
<sec id="s3_1"><label>3.1</label><title>Pre-Processing</title>
<p>LS-MTL first uses a word embedding model to preprocess the corpus and then obtains the word vector matrix <inline-formula id="ieqn-2"><mml:math id="mml-ieqn-2"><mml:msup><mml:mi>x</mml:mi><mml:mrow><mml:mi>k</mml:mi></mml:mrow></mml:msup></mml:math></inline-formula> based on the text of the <inline-formula id="ieqn-3"><mml:math id="mml-ieqn-3"><mml:mi>k</mml:mi></mml:math></inline-formula>-th steganalysis task, as shown in <xref ref-type="disp-formula" rid="eqn-1">Eqs. (1)</xref> and <xref ref-type="disp-formula" rid="eqn-2">(2)</xref> below:
<disp-formula id="eqn-1"><label>(1)</label><mml:math id="mml-eqn-1" display="block"><mml:msub><mml:mi>D</mml:mi><mml:mrow><mml:mi>k</mml:mi></mml:mrow></mml:msub><mml:mo>=</mml:mo><mml:msubsup><mml:mrow><mml:mrow><mml:mo>{</mml:mo><mml:mrow><mml:mo>(</mml:mo><mml:msubsup><mml:mrow><mml:mi>x</mml:mi></mml:mrow><mml:mrow><mml:mi>i</mml:mi></mml:mrow><mml:mrow><mml:mi>k</mml:mi></mml:mrow></mml:msubsup><mml:mo>,</mml:mo><mml:msubsup><mml:mrow><mml:mi>y</mml:mi></mml:mrow><mml:mrow><mml:mi>i</mml:mi></mml:mrow><mml:mrow><mml:mi>k</mml:mi></mml:mrow></mml:msubsup><mml:mo>)</mml:mo></mml:mrow><mml:mo>}</mml:mo></mml:mrow></mml:mrow><mml:mrow><mml:mi>i</mml:mi><mml:mo>=</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mrow><mml:mi>N</mml:mi></mml:mrow></mml:msubsup><mml:mo>,</mml:mo></mml:math></disp-formula>
<disp-formula id="eqn-2"><label>(2)</label><mml:math id="mml-eqn-2" display="block"><mml:msubsup><mml:mrow><mml:mi>x</mml:mi></mml:mrow><mml:mrow><mml:mi>i</mml:mi></mml:mrow><mml:mrow><mml:mi>k</mml:mi></mml:mrow></mml:msubsup><mml:mo>=</mml:mo><mml:mrow><mml:mo>[</mml:mo><mml:msubsup><mml:mrow><mml:mi>V</mml:mi></mml:mrow><mml:mrow><mml:mn>1</mml:mn></mml:mrow><mml:mrow><mml:mi>k</mml:mi></mml:mrow></mml:msubsup><mml:mo>,</mml:mo><mml:mo>&#x2026;</mml:mo><mml:mo>,</mml:mo><mml:msubsup><mml:mrow><mml:mi>V</mml:mi></mml:mrow><mml:mrow><mml:mi>l</mml:mi></mml:mrow><mml:mrow><mml:mi>k</mml:mi></mml:mrow></mml:msubsup><mml:mo>]</mml:mo></mml:mrow><mml:mrow><mml:mo>(</mml:mo><mml:msubsup><mml:mrow><mml:mi>V</mml:mi></mml:mrow><mml:mrow><mml:mi>j</mml:mi></mml:mrow><mml:mrow><mml:mi>k</mml:mi></mml:mrow></mml:msubsup><mml:mo>&#x2208;</mml:mo><mml:msup><mml:mrow><mml:mrow><mml:mi mathvariant="double-struck">R</mml:mi></mml:mrow></mml:mrow><mml:mrow><mml:mi>d</mml:mi></mml:mrow></mml:msup><mml:mo>,</mml:mo><mml:mn>1</mml:mn><mml:mo>&#x2264;</mml:mo><mml:mi>j</mml:mi><mml:mo>&#x2264;</mml:mo><mml:mi>l</mml:mi><mml:mo>)</mml:mo></mml:mrow><mml:mo>,</mml:mo></mml:math></disp-formula>where <italic>k</italic> represents the <inline-formula id="ieqn-4"><mml:math id="mml-ieqn-4"><mml:mi>k</mml:mi></mml:math></inline-formula>-th steganalysis task; <italic>N</italic> represents the number of texts; <inline-formula id="ieqn-5"><mml:math id="mml-ieqn-5"><mml:msub><mml:mi>D</mml:mi><mml:mrow><mml:mi>k</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> denotes a corpus containing <inline-formula id="ieqn-6"><mml:math id="mml-ieqn-6"><mml:msub><mml:mi>N</mml:mi><mml:mrow><mml:mi>k</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> texts for the <inline-formula id="ieqn-7"><mml:math id="mml-ieqn-7"><mml:mi>k</mml:mi></mml:math></inline-formula>-th steganalysis task; <inline-formula id="ieqn-8"><mml:math id="mml-ieqn-8"><mml:msubsup><mml:mrow><mml:mi>x</mml:mi></mml:mrow><mml:mrow><mml:mi>i</mml:mi></mml:mrow><mml:mrow><mml:mi>k</mml:mi></mml:mrow></mml:msubsup></mml:math></inline-formula> and <inline-formula id="ieqn-9"><mml:math id="mml-ieqn-9"><mml:msubsup><mml:mrow><mml:mi>y</mml:mi></mml:mrow><mml:mrow><mml:mi>i</mml:mi></mml:mrow><mml:mrow><mml:mi>k</mml:mi></mml:mrow></mml:msubsup></mml:math></inline-formula> indicate the detected text and the corresponding label of the text <inline-formula id="ieqn-10"><mml:math id="mml-ieqn-10"><mml:msubsup><mml:mrow><mml:mi>x</mml:mi></mml:mrow><mml:mrow><mml:mi>i</mml:mi></mml:mrow><mml:mrow><mml:mi>k</mml:mi></mml:mrow></mml:msubsup></mml:math></inline-formula> in the <inline-formula id="ieqn-11"><mml:math id="mml-ieqn-11"><mml:mi>k</mml:mi></mml:math></inline-formula>-th steganalysis task, respectively; <inline-formula id="ieqn-12"><mml:math id="mml-ieqn-12"><mml:msubsup><mml:mrow><mml:mi>V</mml:mi></mml:mrow><mml:mrow><mml:mi>j</mml:mi></mml:mrow><mml:mrow><mml:mi>k</mml:mi></mml:mrow></mml:msubsup></mml:math></inline-formula> is the vector representation of the <inline-formula id="ieqn-13"><mml:math id="mml-ieqn-13"><mml:mi>j</mml:mi></mml:math></inline-formula>-th word in the <inline-formula id="ieqn-14"><mml:math id="mml-ieqn-14"><mml:mi>i</mml:mi></mml:math></inline-formula>-th text for the <inline-formula id="ieqn-15"><mml:math id="mml-ieqn-15"><mml:mi>k</mml:mi></mml:math></inline-formula>-th steganalysis task, and all the <inline-formula id="ieqn-16"><mml:math id="mml-ieqn-16"><mml:msubsup><mml:mrow><mml:mi>V</mml:mi></mml:mrow><mml:mrow><mml:mi>j</mml:mi></mml:mrow><mml:mrow><mml:mi>k</mml:mi></mml:mrow></mml:msubsup></mml:math></inline-formula> denotes the representation of the detected text <inline-formula id="ieqn-17"><mml:math id="mml-ieqn-17"><mml:msubsup><mml:mrow><mml:mi>x</mml:mi></mml:mrow><mml:mrow><mml:mi>i</mml:mi></mml:mrow><mml:mrow><mml:mi>k</mml:mi></mml:mrow></mml:msubsup></mml:math></inline-formula>; <italic>l</italic> is the length of the text; <inline-formula id="ieqn-18"><mml:math id="mml-ieqn-18"><mml:msup><mml:mrow><mml:mrow><mml:mi mathvariant="double-struck">R</mml:mi></mml:mrow></mml:mrow><mml:mrow><mml:mi>d</mml:mi></mml:mrow></mml:msup></mml:math></inline-formula> is the vector space with d dimension.</p>
</sec>
<sec id="s3_2"><label>3.2</label><title>Private Feature Extraction</title>
<p>For obtaining the specific features contained in the <inline-formula id="ieqn-19"><mml:math id="mml-ieqn-19"><mml:mi>k</mml:mi></mml:math></inline-formula>-th single steganalysis task, this paper employs <italic>k</italic> CNNs to get the respective private feature representation of the texts for each steganalysis task respectively, as outlined in more detail below.</p>
<p>First, the word vector matrix of the detected text is input into the private CNN of the steganalysis task to which the text belongs. LS-MTL then leverages multiple convolutional kernels of various widths to extract features and generate the candidate feature representation for the <inline-formula id="ieqn-20"><mml:math id="mml-ieqn-20"><mml:mi>k</mml:mi></mml:math></inline-formula>-th steganalysis task. <inline-formula id="ieqn-21"><mml:math id="mml-ieqn-21"><mml:msubsup><mml:mrow><mml:mi>c</mml:mi></mml:mrow><mml:mrow><mml:mi>i</mml:mi></mml:mrow><mml:mrow><mml:mi>k</mml:mi></mml:mrow></mml:msubsup></mml:math></inline-formula> is denoted as in <xref ref-type="disp-formula" rid="eqn-3">Eq. (3)</xref>:
<disp-formula id="eqn-3"><label>(3)</label><mml:math id="mml-eqn-3" display="block"><mml:msubsup><mml:mrow><mml:mi>c</mml:mi></mml:mrow><mml:mrow><mml:mi>i</mml:mi></mml:mrow><mml:mrow><mml:mi>k</mml:mi></mml:mrow></mml:msubsup><mml:mo>=</mml:mo><mml:mi>f</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mi>W</mml:mi><mml:mo>&#x22C5;</mml:mo><mml:msubsup><mml:mrow><mml:mi>x</mml:mi></mml:mrow><mml:mrow><mml:mi>i</mml:mi><mml:mo>:</mml:mo><mml:mi>i</mml:mi><mml:mo>+</mml:mo><mml:mi>h</mml:mi><mml:mo>&#x2212;</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mrow><mml:mi>k</mml:mi></mml:mrow></mml:msubsup><mml:mo>+</mml:mo><mml:mi>b</mml:mi><mml:mo>)</mml:mo></mml:mrow><mml:mo>,</mml:mo></mml:math></disp-formula>where <italic>k</italic> represents the <inline-formula id="ieqn-22"><mml:math id="mml-ieqn-22"><mml:mi>k</mml:mi></mml:math></inline-formula>-th steganalysis task; <inline-formula id="ieqn-23"><mml:math id="mml-ieqn-23"><mml:msubsup><mml:mrow><mml:mi>c</mml:mi></mml:mrow><mml:mrow><mml:mi>i</mml:mi></mml:mrow><mml:mrow><mml:mi>k</mml:mi></mml:mrow></mml:msubsup></mml:math></inline-formula> is the candidate feature representation for the <inline-formula id="ieqn-24"><mml:math id="mml-ieqn-24"><mml:mi>k</mml:mi></mml:math></inline-formula>-th steganalysis task; <italic>W</italic> is a convolutional kernel weight matrix; <italic>h</italic> is the width of the convolutional kernel matrix; <inline-formula id="ieqn-25"><mml:math id="mml-ieqn-25"><mml:msubsup><mml:mrow><mml:mi>x</mml:mi></mml:mrow><mml:mrow><mml:mi>i</mml:mi><mml:mo>:</mml:mo><mml:mi>i</mml:mi><mml:mo>+</mml:mo><mml:mi>h</mml:mi><mml:mo>&#x2212;</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mrow><mml:mi>k</mml:mi></mml:mrow></mml:msubsup></mml:math></inline-formula> represents the candidate feature representation of the selected text to be detected controlled by the convolutional kernel; <italic>b</italic> is the bias term; <inline-formula id="ieqn-26"><mml:math id="mml-ieqn-26"><mml:mi>f</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mo>&#x22C5;</mml:mo><mml:mo>)</mml:mo></mml:mrow></mml:math></inline-formula> is the nonlinear activation function.</p>
<p>For the features obtained from the different convolution kernel matrices, a maximization pooling operation <inline-formula id="ieqn-27"><mml:math id="mml-ieqn-27"><mml:mo movablelimits="true" form="prefix">max</mml:mo><mml:mrow><mml:mo>(</mml:mo><mml:mo>&#x22C5;</mml:mo><mml:mo>)</mml:mo></mml:mrow></mml:math></inline-formula> is performed, respectively. In short, the maximum value is taken for each candidate feature representation to obtain the maximum pooled feature <inline-formula id="ieqn-28"><mml:math id="mml-ieqn-28"><mml:msup><mml:mrow><mml:msub><mml:mrow><mml:mover><mml:mi>c</mml:mi><mml:mo stretchy="false">&#x005E;</mml:mo></mml:mover></mml:mrow><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub></mml:mrow><mml:mrow><mml:mi>k</mml:mi></mml:mrow></mml:msup></mml:math></inline-formula> for the <inline-formula id="ieqn-29"><mml:math id="mml-ieqn-29"><mml:mi>k</mml:mi></mml:math></inline-formula>-th steganalysis task in <xref ref-type="disp-formula" rid="eqn-4">Eq. (4)</xref>:
<disp-formula id="eqn-4"><label>(4)</label><mml:math id="mml-eqn-4" display="block"><mml:msup><mml:mrow><mml:msub><mml:mrow><mml:mover><mml:mi>c</mml:mi><mml:mo stretchy="false">&#x005E;</mml:mo></mml:mover></mml:mrow><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub></mml:mrow><mml:mrow><mml:mi>k</mml:mi></mml:mrow></mml:msup><mml:mo>=</mml:mo><mml:mo movablelimits="true" form="prefix">max</mml:mo><mml:mrow><mml:mo>(</mml:mo><mml:msubsup><mml:mrow><mml:mi>c</mml:mi></mml:mrow><mml:mrow><mml:mn>1</mml:mn></mml:mrow><mml:mrow><mml:mi>k</mml:mi></mml:mrow></mml:msubsup><mml:mo>,</mml:mo><mml:mo>&#x2026;</mml:mo><mml:mo>,</mml:mo><mml:msubsup><mml:mrow><mml:mi>c</mml:mi></mml:mrow><mml:mrow><mml:mi>l</mml:mi><mml:mo>&#x2212;</mml:mo><mml:mi>h</mml:mi><mml:mo>+</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mrow><mml:mi>k</mml:mi></mml:mrow></mml:msubsup><mml:mo>)</mml:mo></mml:mrow><mml:mspace width="negativethinmathspace" /><mml:mo>.</mml:mo></mml:math></disp-formula></p>
<p>The private feature representation <inline-formula id="ieqn-30"><mml:math id="mml-ieqn-30"><mml:msup><mml:mi>z</mml:mi><mml:mrow><mml:mi>k</mml:mi></mml:mrow></mml:msup></mml:math></inline-formula> of the detected text for the <inline-formula id="ieqn-31"><mml:math id="mml-ieqn-31"><mml:mi>k</mml:mi></mml:math></inline-formula>-th steganalysis task is obtained by concatenating the maximum pooled features obtained from convolution kernel matrices together. Meanwhile, <inline-formula id="ieqn-32"><mml:math id="mml-ieqn-32"><mml:msup><mml:mi>z</mml:mi><mml:mrow><mml:mi>k</mml:mi></mml:mrow></mml:msup></mml:math></inline-formula> is represented as following <xref ref-type="disp-formula" rid="eqn-5">Eq. (5)</xref>:
<disp-formula id="eqn-5"><label>(5)</label><mml:math id="mml-eqn-5" display="block"><mml:msup><mml:mi>z</mml:mi><mml:mrow><mml:mi>k</mml:mi></mml:mrow></mml:msup><mml:mo>=</mml:mo><mml:mrow><mml:mo>[</mml:mo><mml:msubsup><mml:mrow><mml:mrow><mml:mover><mml:mi>c</mml:mi><mml:mo stretchy="false">&#x005E;</mml:mo></mml:mover></mml:mrow></mml:mrow><mml:mrow><mml:mn>1</mml:mn></mml:mrow><mml:mrow><mml:mi>k</mml:mi></mml:mrow></mml:msubsup><mml:mo>,</mml:mo><mml:mo>&#x2026;</mml:mo><mml:mo>,</mml:mo><mml:msubsup><mml:mrow><mml:mrow><mml:mover><mml:mi>c</mml:mi><mml:mo stretchy="false">&#x005E;</mml:mo></mml:mover></mml:mrow></mml:mrow><mml:mrow><mml:mi>m</mml:mi></mml:mrow><mml:mrow><mml:mi>k</mml:mi></mml:mrow></mml:msubsup><mml:mo>]</mml:mo></mml:mrow><mml:mo>,</mml:mo></mml:math></disp-formula>where <italic>m</italic> is the number of convolutional kernel matrices of the private CNN.</p>
</sec>
<sec id="s3_3"><label>3.3</label><title>Shared Feature Extraction</title>
<p>Multi-task learning aims to enhance detection performance by learning tasks in parallel, leveraging the correlative features between multiple-category steganalysis tasks. Thus, to simultaneously obtain the sensitive interaction features between each steganalysis task and other related tasks, this paper designs a shared CNN to extract shared features for multiple linguistic steganalysis tasks, while simultaneously stabilizing the impact of diverse data on the detection performance of steganalysis tasks. The shared features are obtained by following the steps presented below.</p>
<p>When the word vector matrix <inline-formula id="ieqn-33"><mml:math id="mml-ieqn-33"><mml:msup><mml:mi>x</mml:mi><mml:mrow><mml:mi>k</mml:mi></mml:mrow></mml:msup></mml:math></inline-formula> of the detected text for a specific steganalysis task is input to the corresponding private CNN, <inline-formula id="ieqn-34"><mml:math id="mml-ieqn-34"><mml:msup><mml:mi>x</mml:mi><mml:mrow><mml:mi>k</mml:mi></mml:mrow></mml:msup></mml:math></inline-formula> will also be input to the pre-constructed shared CNN. The shared CNN employs multiple convolutional kernel matrices of different widths to extract features and simultaneously generate the candidate feature representations. <inline-formula id="ieqn-35"><mml:math id="mml-ieqn-35"><mml:msub><mml:mi>s</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> is calculated by <xref ref-type="disp-formula" rid="eqn-6">Eq. (6)</xref>:
<disp-formula id="eqn-6"><label>(6)</label><mml:math id="mml-eqn-6" display="block"><mml:msub><mml:mi>s</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub><mml:mo>=</mml:mo><mml:mi>f</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mi>W</mml:mi><mml:mo>&#x22C5;</mml:mo><mml:msub><mml:mi>x</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mo>:</mml:mo><mml:mi>i</mml:mi><mml:mo>+</mml:mo><mml:mi>h</mml:mi><mml:mo>&#x2212;</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:msub><mml:mo>+</mml:mo><mml:mi>b</mml:mi><mml:mo>)</mml:mo></mml:mrow><mml:mspace width="negativethinmathspace" /><mml:mo>,</mml:mo></mml:math></disp-formula>where <inline-formula id="ieqn-36"><mml:math id="mml-ieqn-36"><mml:msub><mml:mi>s</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> is the candidate feature representations; <italic>W</italic> is a convolutional kernel weight matrix; <italic>x</italic> represents the word vector matrix of the selected text to be detected; <inline-formula id="ieqn-37"><mml:math id="mml-ieqn-37"><mml:msubsup><mml:mrow><mml:mi>x</mml:mi></mml:mrow><mml:mrow><mml:mi>i</mml:mi><mml:mo>:</mml:mo><mml:mi>i</mml:mi><mml:mo>+</mml:mo><mml:mi>h</mml:mi><mml:mo>&#x2212;</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mrow><mml:mi>k</mml:mi></mml:mrow></mml:msubsup></mml:math></inline-formula> represents the candidate feature representation of the selected text to be detected controlled by the convolutional kernel, and <italic>h</italic> is the width of the convolutional kernel matrix; <italic>b</italic> is the bias term; <inline-formula id="ieqn-38"><mml:math id="mml-ieqn-38"><mml:mi>f</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mo>&#x22C5;</mml:mo><mml:mo>)</mml:mo></mml:mrow></mml:math></inline-formula> is the nonlinear activation function.</p>
<p>A maximization pooling operation is performed for the features obtained from the convolution kernel matrices. Briefly, each candidate feature is represented by taking the maximum value to obtain the maximum pooled feature <inline-formula id="ieqn-39"><mml:math id="mml-ieqn-39"><mml:mrow><mml:mover><mml:mi>s</mml:mi><mml:mo stretchy="false">&#x005E;</mml:mo></mml:mover></mml:mrow></mml:math></inline-formula>, which can be described as <xref ref-type="disp-formula" rid="eqn-7">Eq. (7)</xref>:
<disp-formula id="eqn-7"><label>(7)</label><mml:math id="mml-eqn-7" display="block"><mml:mrow><mml:mover><mml:mi>s</mml:mi><mml:mo stretchy="false">&#x005E;</mml:mo></mml:mover></mml:mrow><mml:mo>=</mml:mo><mml:mo movablelimits="true" form="prefix">max</mml:mo><mml:mrow><mml:mo>(</mml:mo><mml:msub><mml:mi>s</mml:mi><mml:mrow><mml:mn>1</mml:mn></mml:mrow></mml:msub><mml:mo>,</mml:mo><mml:mo>&#x2026;</mml:mo><mml:mo>,</mml:mo><mml:msub><mml:mi>s</mml:mi><mml:mrow><mml:mi>l</mml:mi><mml:mo>&#x2212;</mml:mo><mml:mi>h</mml:mi><mml:mo>+</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:msub><mml:mo>)</mml:mo></mml:mrow><mml:mspace width="negativethinmathspace" /><mml:mo>.</mml:mo></mml:math></disp-formula></p>
<p>The maximum pooled features obtained from convolutional kernel matrices are concatenated together to obtain a shared feature representation <italic>o</italic> for all steganalysis tasks, which is expressed as <xref ref-type="disp-formula" rid="eqn-8">Eq. (8)</xref>:
<disp-formula id="eqn-8"><label>(8)</label><mml:math id="mml-eqn-8" display="block"><mml:mi>o</mml:mi><mml:mo>=</mml:mo><mml:mrow><mml:mo>[</mml:mo><mml:msub><mml:mrow><mml:mover><mml:mi>s</mml:mi><mml:mo stretchy="false">&#x005E;</mml:mo></mml:mover></mml:mrow><mml:mrow><mml:mn>1</mml:mn></mml:mrow></mml:msub><mml:mo>,</mml:mo><mml:mo>&#x2026;</mml:mo><mml:mo>,</mml:mo><mml:msub><mml:mrow><mml:mover><mml:mi>s</mml:mi><mml:mo stretchy="false">&#x005E;</mml:mo></mml:mover></mml:mrow><mml:mrow><mml:mi>n</mml:mi></mml:mrow></mml:msub><mml:mo>]</mml:mo></mml:mrow><mml:mspace width="negativethinmathspace" /><mml:mo>,</mml:mo></mml:math></disp-formula>where <italic>n</italic> is the number of shared convolutional kernel matrices of the CNN.</p>
</sec>
<sec id="s3_4"><label>3.4</label><title>Feature Fusion and Classification</title>
<p>After obtaining the private features <inline-formula id="ieqn-40"><mml:math id="mml-ieqn-40"><mml:msup><mml:mi>z</mml:mi><mml:mrow><mml:mi>k</mml:mi></mml:mrow></mml:msup></mml:math></inline-formula> for the <inline-formula id="ieqn-41"><mml:math id="mml-ieqn-41"><mml:mi>k</mml:mi></mml:math></inline-formula>-th steganalysis task and the shared features <italic>o</italic>, LS-MTL concatenates the two types of features to form the combined feature vector for the <inline-formula id="ieqn-42"><mml:math id="mml-ieqn-42"><mml:mi>k</mml:mi></mml:math></inline-formula>-th steganalysis task in <xref ref-type="disp-formula" rid="eqn-9">Eq. (9)</xref>, that is:
<disp-formula id="eqn-9"><label>(9)</label><mml:math id="mml-eqn-9" display="block"><mml:msup><mml:mi>H</mml:mi><mml:mrow><mml:mi>k</mml:mi></mml:mrow></mml:msup><mml:mo>=</mml:mo><mml:msup><mml:mi>z</mml:mi><mml:mrow><mml:mi>k</mml:mi></mml:mrow></mml:msup><mml:mo>&#x2295;</mml:mo><mml:mi>o</mml:mi><mml:mo>,</mml:mo></mml:math></disp-formula>where <inline-formula id="ieqn-43"><mml:math id="mml-ieqn-43"><mml:mo>&#x2295;</mml:mo></mml:math></inline-formula> is the concatenation operator; the <inline-formula id="ieqn-44"><mml:math id="mml-ieqn-44"><mml:msup><mml:mi>H</mml:mi><mml:mrow><mml:mi>k</mml:mi></mml:mrow></mml:msup></mml:math></inline-formula> refers to the concatenation of the private features <inline-formula id="ieqn-45"><mml:math id="mml-ieqn-45"><mml:msup><mml:mi>z</mml:mi><mml:mrow><mml:mi>k</mml:mi></mml:mrow></mml:msup></mml:math></inline-formula> for the <inline-formula id="ieqn-46"><mml:math id="mml-ieqn-46"><mml:mi>k</mml:mi></mml:math></inline-formula>-th steganalysis task and the shared features <italic>o</italic>.</p>
<p>Next, the combined feature vector <inline-formula id="ieqn-47"><mml:math id="mml-ieqn-47"><mml:msup><mml:mi>H</mml:mi><mml:mrow><mml:mi>k</mml:mi></mml:mrow></mml:msup></mml:math></inline-formula> is processed by a specific classifier, and the detection probability distribution can be obtained by an activation function <inline-formula id="ieqn-48"><mml:math id="mml-ieqn-48"><mml:mrow><mml:mtext mathvariant="italic">soft</mml:mtext></mml:mrow><mml:mrow><mml:mtext mathvariant="italic">max</mml:mtext></mml:mrow></mml:math></inline-formula>. The computation is performed as <xref ref-type="disp-formula" rid="eqn-10">Eq. (10)</xref>:
<disp-formula id="eqn-10"><label>(10)</label><mml:math id="mml-eqn-10" display="block"><mml:msup><mml:mrow><mml:mover><mml:mi>y</mml:mi><mml:mo stretchy="false">&#x005E;</mml:mo></mml:mover></mml:mrow><mml:mrow><mml:mi>k</mml:mi></mml:mrow></mml:msup><mml:mo>=</mml:mo><mml:mrow><mml:mtext mathvariant="italic">softmax</mml:mtext></mml:mrow><mml:mrow><mml:mo>(</mml:mo><mml:mi>W</mml:mi><mml:mo>&#x22C5;</mml:mo><mml:msup><mml:mi>H</mml:mi><mml:mrow><mml:mi>k</mml:mi></mml:mrow></mml:msup><mml:mo>+</mml:mo><mml:mi>b</mml:mi><mml:mo>)</mml:mo></mml:mrow><mml:mspace width="negativethinmathspace" /><mml:mo>,</mml:mo></mml:math></disp-formula>where <inline-formula id="ieqn-49"><mml:math id="mml-ieqn-49"><mml:msup><mml:mrow><mml:mover><mml:mi>y</mml:mi><mml:mo stretchy="false">&#x005E;</mml:mo></mml:mover></mml:mrow><mml:mrow><mml:mi>k</mml:mi></mml:mrow></mml:msup></mml:math></inline-formula> is the probability distribution of the text to be detected for the <inline-formula id="ieqn-50"><mml:math id="mml-ieqn-50"><mml:mi>k</mml:mi></mml:math></inline-formula>-th steganalysis task; <inline-formula id="ieqn-51"><mml:math id="mml-ieqn-51"><mml:msup><mml:mi>H</mml:mi><mml:mrow><mml:mi>k</mml:mi></mml:mrow></mml:msup></mml:math></inline-formula> denotes the combined feature vector of private and shared features; <italic>W</italic> and <italic>b</italic> are the trainable model parameters. Finally, the predicted label will be obtained by comparing the probability distributions of the categories.</p>
<p>This paper leverages a supervised learning framework and minimizes the loss function via back-propagation iterative optimization to obtain the best model. The loss function calculates the average cross-entropy between the predicted and actual label as the prediction error, is defined as follows in <xref ref-type="disp-formula" rid="eqn-11">Eq. (11)</xref>:
<disp-formula id="eqn-11"><label>(11)</label><mml:math id="mml-eqn-11" display="block"><mml:mi>L</mml:mi><mml:mi>o</mml:mi><mml:mi>s</mml:mi><mml:mi>s</mml:mi><mml:mo>=</mml:mo><mml:mo>&#x2212;</mml:mo><mml:munderover><mml:mo>&#x2211;</mml:mo><mml:mrow><mml:mi>k</mml:mi><mml:mo>=</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mrow><mml:mi>K</mml:mi></mml:mrow></mml:munderover><mml:munderover><mml:mo>&#x2211;</mml:mo><mml:mrow><mml:mi>i</mml:mi><mml:mo>=</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mrow><mml:msub><mml:mi>N</mml:mi><mml:mrow><mml:mi>k</mml:mi></mml:mrow></mml:msub></mml:mrow></mml:munderover><mml:msub><mml:mi>&#x03B2;</mml:mi><mml:mrow><mml:mi>k</mml:mi></mml:mrow></mml:msub><mml:msubsup><mml:mrow><mml:mi>y</mml:mi></mml:mrow><mml:mrow><mml:mi>i</mml:mi></mml:mrow><mml:mrow><mml:mi>k</mml:mi></mml:mrow></mml:msubsup><mml:mi>log</mml:mi><mml:mo>&#x2061;</mml:mo><mml:mrow><mml:mo>(</mml:mo><mml:msubsup><mml:mrow><mml:mrow><mml:mover><mml:mi>y</mml:mi><mml:mo stretchy="false">&#x005E;</mml:mo></mml:mover></mml:mrow></mml:mrow><mml:mrow><mml:mi>i</mml:mi></mml:mrow><mml:mrow><mml:mi>k</mml:mi></mml:mrow></mml:msubsup><mml:mo>)</mml:mo></mml:mrow><mml:mspace width="negativethinmathspace" /><mml:mo>,</mml:mo></mml:math></disp-formula>where <italic>K</italic> denotes the number of steganalysis tasks; <inline-formula id="ieqn-52"><mml:math id="mml-ieqn-52"><mml:msub><mml:mi>N</mml:mi><mml:mrow><mml:mi>k</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> represents the number of samples in the corpus of the <inline-formula id="ieqn-53"><mml:math id="mml-ieqn-53"><mml:mi>k</mml:mi></mml:math></inline-formula>-th steganalysis task; <inline-formula id="ieqn-54"><mml:math id="mml-ieqn-54"><mml:msub><mml:mi>&#x03B2;</mml:mi><mml:mrow><mml:mi>k</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> is the weight of the <inline-formula id="ieqn-55"><mml:math id="mml-ieqn-55"><mml:mi>k</mml:mi></mml:math></inline-formula>-th steganalysis task; <inline-formula id="ieqn-56"><mml:math id="mml-ieqn-56"><mml:msubsup><mml:mrow><mml:mi>y</mml:mi></mml:mrow><mml:mrow><mml:mi>i</mml:mi></mml:mrow><mml:mrow><mml:mi>k</mml:mi></mml:mrow></mml:msubsup></mml:math></inline-formula> is the actual label of the <inline-formula id="ieqn-57"><mml:math id="mml-ieqn-57"><mml:mi>i</mml:mi></mml:math></inline-formula>-th sample in the <inline-formula id="ieqn-58"><mml:math id="mml-ieqn-58"><mml:mi>k</mml:mi></mml:math></inline-formula>-th steganalysis task; and <inline-formula id="ieqn-59"><mml:math id="mml-ieqn-59"><mml:msubsup><mml:mrow><mml:mrow><mml:mover><mml:mi>y</mml:mi><mml:mo stretchy="false">&#x005E;</mml:mo></mml:mover></mml:mrow></mml:mrow><mml:mrow><mml:mi>i</mml:mi></mml:mrow><mml:mrow><mml:mi>k</mml:mi></mml:mrow></mml:msubsup></mml:math></inline-formula> denotes the predicted label of the <inline-formula id="ieqn-60"><mml:math id="mml-ieqn-60"><mml:mi>i</mml:mi></mml:math></inline-formula>-th sample in the <inline-formula id="ieqn-61"><mml:math id="mml-ieqn-61"><mml:mi>k</mml:mi></mml:math></inline-formula>-th steganalysis task. The prediction error will be progressively smaller through the model, meaning that the prediction result will be closer to the actual label.</p>
</sec>
</sec>
<sec id="s4"><label>4</label><title>Experimental Results and Analysis</title>
<sec id="s4_1"><label>4.1</label><title>Datasets</title>
<p>In the experiments, this paper utilized the current promising steganographic methods to produce the corresponding categories of steganographic texts, which are universal, highly concealed, and challenging to be detected by statistical analysis. The detected texts are referred into four categories: modified steganographic texts, generative steganographic texts, generated non-steganographic texts, and natural non-steganographic texts. Modified steganographic texts are produced by a steganographic tool T-Lex [<xref ref-type="bibr" rid="ref-19">19</xref>], which modifies natural texts from the Gutenberg corpus by synonym substitutions to hide secret messages. Generative steganographic texts are automatically generated by the generative linguistic steganography in [<xref ref-type="bibr" rid="ref-4">4</xref>], using the steganographic encoding methods FLC and VLC with the Movie dataset. Texts generated by the same method proposed in [<xref ref-type="bibr" rid="ref-4">4</xref>], but without embedding secret messages, are treated as generated non-steganographic texts. While natural non-steganographic texts are randomly selected from the original Movie dataset. For each steganalysis task, we choose 10,000 steganographic texts and 10,000 non-steganographic texts, for generative steganographic texts, we selected 5,000 generated by each of the two encoding methods (FLC and VLC) to form the whole generative steganographic text dataset. Notably, we choose and mix 8,000 steganographic texts and 8,000 non-steganographic texts as the training set, and other steganographic texts and non-steganographic texts are blended as well.</p>
<p>We constructed four-category steganalysis tasks, corresponding to four types of datasets, to detect whether a text is a steganographic text. The first type of dataset, named Dataset 1, includes generative steganographic texts and generated non-steganographic ones; Dataset 2 consists of generative steganographic texts and natural non-steganographic ones; Dataset 3 is composed of modified steganographic texts and generated non-steganographic ones; the dataset that comprises of modified steganographic texts and natural non-steganographic texts is called Dataset 4. In our experiments, we train LS-MTL with all four categories of datasets one time and input the test texts into the trained LS-MTL to distinguish whether the corresponding tested text is steganographic or non-steganographic text.</p>
</sec>
<sec id="s4_2"><label>4.2</label><title>Setup and Metrics</title>
<p>In this paper, the structure of the CNN used in this paper is as follows: an embedding layer, we pre-trained a word embedding model, Word2vec, on the Google News corpus to produce a 300-dimensional dense vector for each word; a convolutional layer with 3, 4, 5 three different sizes of convolutional kernels, and each size has 100 convolutional kernels; a pooling layer and a fully connected layer following with a softmax classifier. Besides, the learning algorithm is the minibatch gradient descent with the Adam algorithm, and the learning rate is initialized as 0.00001 and the epoch as 100. Note that the hyper-parameters are finally obtained through training, and we adopted the model performing best during the training process to evaluate test sets.</p>
<p>To evaluate the performance of our method, we employ several evaluation metrics commonly used in linguistic steganalysis tasks: Accuracy (Acc), Precision (Pre), and Recall (Rec). Among them, Acc reflects the ratio of the number of correctly detected texts to the total number of samples; Pre is the ratio of the detection accuracy to actual detection, and Rec reflects the percentage of correct detection to what should have been detected. These metrics are calculated as shown in <xref ref-type="disp-formula" rid="eqn-12">Eqs. (12)</xref>&#x2013;<xref ref-type="disp-formula" rid="eqn-14">(14)</xref> below:
<disp-formula id="eqn-12"><label>(12)</label><mml:math id="mml-eqn-12" display="block"><mml:mrow><mml:mtext>Acc</mml:mtext></mml:mrow><mml:mo>=</mml:mo><mml:mfrac><mml:mrow><mml:mi>T</mml:mi><mml:mi>P</mml:mi><mml:mo>+</mml:mo><mml:mi>T</mml:mi><mml:mi>N</mml:mi></mml:mrow><mml:mrow><mml:mi>T</mml:mi><mml:mi>P</mml:mi><mml:mo>+</mml:mo><mml:mi>F</mml:mi><mml:mi>P</mml:mi><mml:mo>+</mml:mo><mml:mi>F</mml:mi><mml:mi>N</mml:mi><mml:mo>+</mml:mo><mml:mi>T</mml:mi><mml:mi>N</mml:mi></mml:mrow></mml:mfrac><mml:mo>,</mml:mo></mml:math></disp-formula>
<disp-formula id="eqn-13"><label>(13)</label><mml:math id="mml-eqn-13" display="block"><mml:mrow><mml:mtext>Pre</mml:mtext></mml:mrow><mml:mo>=</mml:mo><mml:mfrac><mml:mrow><mml:mi>T</mml:mi><mml:mi>P</mml:mi></mml:mrow><mml:mrow><mml:mi>T</mml:mi><mml:mi>P</mml:mi><mml:mo>+</mml:mo><mml:mi>F</mml:mi><mml:mi>P</mml:mi></mml:mrow></mml:mfrac><mml:mo>,</mml:mo></mml:math></disp-formula>
<disp-formula id="eqn-14"><label>(14)</label><mml:math id="mml-eqn-14" display="block"><mml:mrow><mml:mtext>Rec</mml:mtext></mml:mrow><mml:mo>=</mml:mo><mml:mfrac><mml:mrow><mml:mi>T</mml:mi><mml:mi>P</mml:mi></mml:mrow><mml:mrow><mml:mi>T</mml:mi><mml:mi>P</mml:mi><mml:mo>+</mml:mo><mml:mi>F</mml:mi><mml:mi>N</mml:mi></mml:mrow></mml:mfrac><mml:mo>,</mml:mo></mml:math></disp-formula></p>
<p>For each steganalysis task, TP (True Positive) is the number of steganographic texts that are correctly detected as steganographic ones; TN (True Negative) is the number of non-steganographic texts that are rightly detected as non-steganographic ones; FP (False Positive) denotes the number of non-steganographic texts that are incorrectly detected as steganographic ones; FN (False Negative) represents the number of steganographic texts that are incorrectly detected as non-steganographic ones.</p>
</sec>
<sec id="s4_3"><label>4.3</label><title>Results and Analysis</title>
<sec id="s4_3_1"><label>4.3.1</label><title>Comparison Experiments</title>
<p>To verify the effectiveness of the proposed LS-MTL in this paper, we opt to use the linguistic steganalysis proposed in [<xref ref-type="bibr" rid="ref-12">12</xref>], referred to as S-CNN, as the comparison method. S-CNN employs CNN as its primary neural network to learn features for the detection of generative steganographic texts, which is dedicated to linguistic steganalysis for single-based binary classification. In this paper, we trained and tested for each steganalysis task with the corresponding dataset, while we trained LS-MTL with all the datasets and tested with the corresponding dataset for each steganalysis task. The results of the comparison experiments between LS-MTL and S-CNN on the four categories of datasets for linguistic steganalysis are shown in <xref ref-type="table" rid="table-2">Table 2</xref> and <xref ref-type="fig" rid="fig-2">Fig. 2</xref>.</p>
<table-wrap id="table-2"><label>Table 2</label><caption><title>The comparison of experimental results between LS-MTL and S-CNN on different steganalysis tasks</title></caption>
<table frame="hsides">
<colgroup>
<col align="left"/>
<col align="left"/>
<col align="left"/>
<col align="left"/>
<col align="left"/>
</colgroup>
<thead>
<tr>
<th align="left">Datasets</th>
<th align="left">Model</th>
<th align="left">Acc</th>
<th align="left">Pre</th>
<th align="left">Rec</th>
</tr>
</thead>
<tbody>
<tr>
<td align="left">Datasets 1</td>
<td align="left">S-CNN</td>
<td align="left">0.927</td>
<td align="left"><bold>0.962</bold></td>
<td align="left">0.890</td>
</tr>
<tr>
<td/>
<td align="left">LS-MTL (Ours)</td>
<td align="left"><bold>0.943</bold></td>
<td align="left">0.947</td>
<td align="left"><bold>0.938</bold></td>
</tr>
<tr>
<td align="left">Datasets 2</td>
<td align="left">S-CNN</td>
<td align="left">0.878</td>
<td align="left">0.857</td>
<td align="left"><bold>0.908</bold></td>
</tr>
<tr>
<td/>
<td align="left">LS-MTL (Ours)</td>
<td align="left"><bold>0.888</bold></td>
<td align="left"><bold>0.927</bold></td>
<td align="left">0.841</td>
</tr>
<tr>
<td align="left">Datasets 3</td>
<td align="left">S-CNN</td>
<td align="left">0.996</td>
<td align="left"><bold>0.998</bold></td>
<td align="left">0.994</td>
</tr>
<tr>
<td/>
<td align="left">LS-MTL (Ours)</td>
<td align="left"><bold>0.997</bold></td>
<td align="left">0.996</td>
<td align="left"><bold>0.998</bold></td>
</tr>
<tr>
<td align="left">Datasets 4</td>
<td align="left">S-CNN</td>
<td align="left"><bold>0.940</bold></td>
<td align="left">0.945</td>
<td align="left">0.935</td>
</tr>
<tr>
<td/>
<td align="left">LS-MTL (Ours)</td>
<td align="left">0.937</td>
<td align="left"><bold>0.948</bold></td>
<td align="left"><bold>0.967</bold></td>
</tr>
<tr>
<td align="left">Average</td>
<td align="left">S-CNN</td>
<td align="left">0.936</td>
<td align="left">0.941</td>
<td align="left">0.932</td>
</tr>
<tr>
<td/>
<td align="left">LS-MTL (Ours)</td>
<td align="left"><bold>0.941</bold></td>
<td align="left"><bold>0.955</bold></td>
<td align="left"><bold>0.936</bold></td>
</tr>
</tbody>
</table>
</table-wrap><fig id="fig-2"><label>Figure 2</label><caption><title>The comparison results of S-CNN and LS-MTL</title></caption><graphic mimetype="image" mime-subtype="tif" xlink:href="CSSE_37067-fig-2.tif"/></fig>
<p>As shown in <xref ref-type="table" rid="table-2">Table 2</xref>, S-CNN is demonstrated excellent detection performance on certain metrics on datasets. We analyze that S-CNN is a single-based binary classification specifically for linguistic steganalysis, which purposefully extracts linguistic features for particular steganalysis tasks. Therefore, S-CNN also achieves excellent detection performance, the average Acc is 93.53&#x0025;, the average Pre is 94.05&#x0025; and the average Rec is 93.175&#x0025;. Meanwhile, as illustrated in <xref ref-type="table" rid="table-2">Table 2</xref> and <xref ref-type="fig" rid="fig-2">Fig. 2</xref>, the proposed method achieves an average Acc of 94.10&#x0025;, an average Pre is 95.5&#x0025; and average Rec is 93.60&#x0025;, which exhibits better average detection performance for all metrics compared to the baseline, with Acc improving by 0.5&#x0025;, Pre by 1.4&#x0025;, and Rec by 0.4&#x0025;. LS-MTL is proven to detect steganographic and non-steganographic texts more correctly by obtaining the higher Acc in Datasets 1, 2, and 3 of steganalysis tasks, and it achieves the highest Acc of 99.7&#x0025;. In the steganalysis tasks on Datasets 3 and 4, LS-MTL and S-CNN achieve detection performance of Pre that is not very different from each other. However, in the steganalysis task on Dataset 2, our method is far ahead of the baseline by 7&#x0025; Pre improvement. For Rec, LS-MTL exceeds the baseline by about 3&#x0025; in most cases, achieving better detection performance than S-CNN. Generally, results convincingly show that LS-MTL can effectively improve detection performance by obtaining relevant interaction linguistic features from multiple steganalysis tasks. Besides, it implements multiple linguistic steganalysis tasks in the same model LS-MTL and improves detection performance, which is sufficient to prove that the proposed framework has robust generalization capability.</p>

<p>It is worth noting that LS-MTL and S-CNN exhibit varying detection performance on several steganalysis tasks. However, both methods achieve remarkable detection performance in the steganalysis tasks on Datasets 3. We determine that the two datasets are extremely easy to classify due to the significant differences in their text style and linguistic features. Specifically, the modified steganographic texts are derived from the Gutenberg corpus, while the generated non-steganographic texts are from the Movie dataset. Moreover, the writing styles used in these datasets are distinctive, making them very easy to detect and distinguish.</p>
</sec>
<sec id="s4_3_2"><label>4.3.2</label><title>Ablation Experiments</title>
<p>To analyze the effect of different factors on the detection performance of LS-MTL, we conduct the ablation experiments mainly from two perspectives: model structure and dataset. First, to measure the practical effectiveness of the shared module in LS-MTL on the detection performance, we constructed two models based on LS-MTL: the LS-MTL prototype and the LS-MTL variant without the shared CNN module. Since the LS-MTL without the shared module does not share mutual information among multiple tasks, it implements a single binary classification task on the corresponding dataset, so we train a separate model with the corresponding dataset for the eliminated shared CNN to implement the corresponding separate binary classification task. Meanwhile, we named the LS-MTL variant as the single-task, and the prototype of LS-MTL as the multi-task. Theoretically, the shared feature capturing from multi-category steganalysis tasks can effectively mitigate the impact of data sparsity on detection performance. To argue the above issue, we simulate the existing data sparsity situation by cropping the number of steganographic and non-steganographic texts to 5,000 for each steganalysis task separately. In this paper, we train the LS-MTL model on the cropped and uncropped datasets, respectively. While the model trained on the cropped dataset is denoted as task-1, the model trained on the uncropped dataset is represented as task-2. In summary, we implemented the comparison experiments in four scenarios: single-task-1, single-task-2, multi-task-1, and multi-task-2. The experimental results are presented in <xref ref-type="table" rid="table-3">Table 3</xref> and <xref ref-type="fig" rid="fig-3">Fig. 3</xref>.</p>
<table-wrap id="table-3"><label>Table 3</label><caption><title>Comparison results of ablation experiments for LS-MTL on four categories of datasets</title></caption>
<table frame="hsides">
<colgroup>
<col align="left"/>
<col align="left"/>
<col align="left"/>
<col align="left"/>
<col align="left"/>
</colgroup>
<thead>
<tr>
<th align="left">Datasets</th>
<th align="left">Models</th>
<th align="left">Acc</th>
<th align="left">Pre</th>
<th align="left">Rec</th>
</tr>
</thead>
<tbody>
<tr>
<td align="left">Datasets 1</td>
<td align="left">Single-task-1</td>
<td align="left">0.883</td>
<td align="left">0.914</td>
<td align="left">0.846</td>
</tr>
<tr>
<td/>
<td align="left">Single-task-2</td>
<td align="left">0.904</td>
<td align="left">0.920</td>
<td align="left">0.884</td>
</tr>
<tr>
<td/>
<td align="left"><bold>Multi-task-1</bold></td>
<td align="left"><bold>0.922</bold></td>
<td align="left"><bold>0.902</bold></td>
<td align="left"><bold>0.947</bold></td>
</tr>
<tr>
<td/>
<td align="left"><bold>Multi-task-2</bold></td>
<td align="left"><bold>0.943</bold></td>
<td align="left"><bold>0.947</bold></td>
<td align="left"><bold>0.938</bold></td>
</tr>
<tr>
<td align="left">Datasets 2</td>
<td align="left">Single-task-1</td>
<td align="left">0.810</td>
<td align="left">0.886</td>
<td align="left">0.711</td>
</tr>
<tr>
<td/>
<td align="left">Single-task-2</td>
<td align="left">0.838</td>
<td align="left">0.940</td>
<td align="left">0.722</td>
</tr>
<tr>
<td/>
<td align="left"><bold>Multi-task-1</bold></td>
<td align="left"><bold>0.872</bold></td>
<td align="left"><bold>0.914</bold></td>
<td align="left"><bold>0.821</bold></td>
</tr>
<tr>
<td/>
<td align="left"><bold>Multi-task-2</bold></td>
<td align="left"><bold>0.888</bold></td>
<td align="left"><bold>0.927</bold></td>
<td align="left"><bold>0.841</bold></td>
</tr>
<tr>
<td align="left">Datasets 3</td>
<td align="left">Single-task-1</td>
<td align="left">0.942</td>
<td align="left">0.997</td>
<td align="left">0.886</td>
</tr>
<tr>
<td/>
<td align="left">Single-task-2</td>
<td align="left">0.997</td>
<td align="left">0.997</td>
<td align="left">0.998</td>
</tr>
<tr>
<td/>
<td align="left"><bold>Multi-task-1</bold></td>
<td align="left"><bold>0.996</bold></td>
<td align="left"><bold>0.994</bold></td>
<td align="left"><bold>0.998</bold></td>
</tr>
<tr>
<td/>
<td align="left"><bold>Multi-task-2</bold></td>
<td align="left"><bold>0.997</bold></td>
<td align="left"><bold>0.996</bold></td>
<td align="left"><bold>0.998</bold></td>
</tr>
<tr>
<td align="left">Datasets 4</td>
<td align="left">Single-task-1</td>
<td align="left">0.884</td>
<td align="left">0.895</td>
<td align="left">0.870</td>
</tr>
<tr>
<td/>
<td align="left">Single-task-2</td>
<td align="left">0.926</td>
<td align="left">0.930</td>
<td align="left">0.921</td>
</tr>
<tr>
<td/>
<td align="left"><bold>Multi-task-1</bold></td>
<td align="left"><bold>0.931</bold></td>
<td align="left"><bold>0.909</bold></td>
<td align="left"><bold>0.956</bold></td>
</tr>
<tr>
<td/>
<td align="left"><bold>Multi-task-2</bold></td>
<td align="left"><bold>0.937</bold></td>
<td align="left"><bold>0.948</bold></td>
<td align="left"><bold>0.967</bold></td>
</tr>
<tr>
<td align="left">Average</td>
<td align="left">Single-task-1</td>
<td align="left">0.900</td>
<td align="left">0.923</td>
<td align="left">0.828</td>
</tr>
<tr>
<td/>
<td align="left">Single-task-2</td>
<td align="left">0.916</td>
<td align="left">0.947</td>
<td align="left">0.881</td>
</tr>
<tr>
<td/>
<td align="left"><bold>Multi-task-1</bold></td>
<td align="left"><bold>0.930</bold></td>
<td align="left"><bold>0.930</bold></td>
<td align="left"><bold>0.931</bold></td>
</tr>
<tr>
<td/>
<td align="left"><bold>Multi-task-2</bold></td>
<td align="left"><bold>0.941</bold></td>
<td align="left"><bold>0.955</bold></td>
<td align="left"><bold>0.936</bold></td>
</tr>
</tbody>
</table>
</table-wrap><fig id="fig-3"><label>Figure 3</label><caption><title>The comparison results of ablation experiments</title></caption><graphic mimetype="image" mime-subtype="tif" xlink:href="CSSE_37067-fig-3.tif"/></fig>
<p>As shown in <xref ref-type="fig" rid="fig-3">Figs. 3a</xref> and <xref ref-type="fig" rid="fig-3">3b</xref>, all the multi-task learning methods outperform single-task classification methods in all steganalysis tasks, i.e., the multi-task-1 methods are superior to single-task-1, and the multi-task-2 are preferable to single-task-2. As can be analyzed from <xref ref-type="table" rid="table-3">Table 3</xref>, the multi-task learning approaches achieved excellent detection performance compared to the single-task approaches, where multi-task-1 outperformed single-task-1 by 3&#x0025; in average Acc, 0.7&#x0025; in average Pre, and 10.3&#x0025; in average Rec; multi-task-2 outperformed single-task-2 by 2.5&#x0025; in Acc, 0.8&#x0025; in Pre, and 10.3&#x0025; in Rec higher. Experimental results demonstrate that shared features between multiple tasks by introducing the idea of multi-task learning can significantly and consistently enhance the performance of linguistic steganalysis methods and the generalization capability of the proposed framework.</p>

<p>From the experimental results in <xref ref-type="fig" rid="fig-3">Figs. 3c</xref> and <xref ref-type="fig" rid="fig-3">3d</xref>, we noticed that the detection performance of single-task-1 is lower than that of single-task-2, while the performance of multi-task-1 is also lower than that of multi-task-2. Experimental results indicate that data sparsity problem affects the performance of linguistic steganalysis tasks to some extent, regardless of single-task or multi-task text classification. From <xref ref-type="table" rid="table-3">Table 3</xref>, we find a big difference between the single-task-1 and single-task-2 models, with average variance values of 1.6&#x0025;, 1.6&#x0025;, and 5.3&#x0025; for the Acc, Pre, and Rec three indicators, respectively. Besides, it even shows a difference in Rec value of up to 11.2&#x0025; on Datasets 3 between single-task-1 and single-task-2.</p>

<p>From <xref ref-type="table" rid="table-3">Table 3</xref>, the difference in detection performance between the multi-task-1 and multi-task-2 models is relatively small, with an average difference of 1&#x0025;, 2&#x0025;, and 0.5&#x0025; for metrics, respectively. The differences in detection performance between the multi-task-1 and multi-task-2 models are far less than those between the single-task-1 and single-task-2 models under the reduced dataset. Notably, for the last two types of tasks in <xref ref-type="table" rid="table-3">Table 3</xref>, multi-task-1 achieves about the same detection performance as single-task-2 with fewer data. These findings conclusively demonstrate that steganalysis based on multi-task learning is less dependent on the amount of available data than single-task learning. The multi-task learning-based approach has better generalization ability and mitigates the data sparsity problem to a remarkable extent.</p>

</sec>
</sec>
</sec>
<sec id="s5"><label>5</label><title>Conclusion and Future Work</title>
<p>This paper presents a general multi-task learning-based framework for linguistic steganalysis, LS-MTL, which makes it possible to implement multi-category linguistic steganalysis tasks with a single model. Compared to related works, LS-MTL provides a solution for a real-world scenario where there are more types of steganographic and non-steganographic texts. LS-MTL exhibits better average detection performance for all metrics compared to the baseline, with Acc improving by 0.5&#x0025;, Pre by 1.4&#x0025;, and Rec by 0.4&#x0025;. Meanwhile, ablation experiments are conducted in terms of model structure, and it argues that the proposed framework has a strong generalization ability. In the case of sparse data, LS-MTL also achieves stable and promising detection performance. Although the proposed framework achieves excellent text detection performance, there are still some limitations. For example, the different linguistic features from multi-tasks are distinct, so using the same neural network CNN as the base model is inappropriate. In future work, we will employ diverse and appropriate neural networks to capture more effective and sensitive linguistic features for linguistic steganalysis.</p>
</sec>
</body>
<back>
<sec><title>Funding Statement</title>
<p>This paper is partly supported by the <funding-source>National Natural Science Foundation of China</funding-source> under Grants <award-id>61972057</award-id> and <award-id>62172059</award-id>, <funding-source>Hunan Provincial Natural Science Foundation of China</funding-source> under Grant <award-id>2022JJ30623</award-id> and <award-id>2019JJ50287</award-id>, <funding-source>Scientific Research Fund of Hunan Provincial Education Department of China</funding-source> under Grant <award-id>21A0211</award-id> and <award-id>19A265</award-id>.</p></sec>
<sec sec-type="COI-statement"><title>Conflicts of Interest</title>
<p>The authors declare that they have no conflicts of interest to report regarding the present study.</p></sec>
<ref-list content-type="authoryear">
<title>References</title>
<ref id="ref-1"><label>[1]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>C. F.</given-names> <surname>Yang</surname></string-name>, <string-name><given-names>X. Y.</given-names> <surname>Luo</surname></string-name>, <string-name><given-names>J. C.</given-names> <surname>Lu</surname></string-name> and <string-name><given-names>F. L.</given-names> <surname>Liu</surname></string-name></person-group>, &#x201C;<article-title>Extracting hidden messages of MLSB steganography based on optimal stego subset</article-title>,&#x201D; <source>Science China Information Sciences</source>, vol. <volume>61</volume>, no. <issue>11</issue>, pp. <fpage>237</fpage>&#x2013;<lpage>239</lpage>, <year>2018</year>.</mixed-citation></ref>
<ref id="ref-2"><label>[2]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>Y.</given-names> <surname>Luo</surname></string-name>, <string-name><given-names>J.</given-names> <surname>Qin</surname></string-name>, <string-name><given-names>X.</given-names> <surname>Xiang</surname></string-name> and <string-name><given-names>Y.</given-names> <surname>Tan</surname></string-name></person-group>, &#x201C;<article-title>Coverless image steganography based on multi-object recognition</article-title>,&#x201D; <source>IEEE Transactions on Circuits and Systems for Video Technology</source>, vol. <volume>31</volume>, no. <issue>7</issue>, pp. <fpage>2779</fpage>&#x2013;<lpage>2791</lpage>, <year>2021</year>.</mixed-citation></ref>
<ref id="ref-3"><label>[3]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>L. Y.</given-names> <surname>Xiang</surname></string-name>, <string-name><given-names>R.</given-names> <surname>Wang</surname></string-name>, <string-name><given-names>Z. L.</given-names> <surname>Yang</surname></string-name> and <string-name><given-names>Y. L.</given-names> <surname>Liu</surname></string-name></person-group>, &#x201C;<article-title>Generative linguistic steganography: A comprehensive review</article-title>,&#x201D; <source>KSII Transactions on Internet and Information Systems</source>, vol. <volume>16</volume>, no. <issue>3</issue>, pp. <fpage>986</fpage>&#x2013;<lpage>1005</lpage>, <year>2022</year>.</mixed-citation></ref>
<ref id="ref-4"><label>[4]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>Z. L.</given-names> <surname>Yang</surname></string-name>, <string-name><given-names>X. Q.</given-names> <surname>Guo</surname></string-name>, <string-name><given-names>Z. M.</given-names> <surname>Chen</surname></string-name>, <string-name><given-names>Y. F.</given-names> <surname>Huang</surname></string-name> and <string-name><given-names>Y. J.</given-names> <surname>Zhang</surname></string-name></person-group>, &#x201C;<article-title>RNN-stega: Linguistic steganography based on recurrent neural networks</article-title>,&#x201D; <source>IEEE Transactions on Information Forensics and Security</source>, vol. <volume>14</volume>, no. <issue>5</issue>, pp. <fpage>1280</fpage>&#x2013;<lpage>1295</lpage>, <year>2019</year>.</mixed-citation></ref>
<ref id="ref-5"><label>[5]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>C. L.</given-names> <surname>Wang</surname></string-name>, <string-name><given-names>Y. L.</given-names> <surname>Liu</surname></string-name>, <string-name><given-names>Y. J.</given-names> <surname>Tong</surname></string-name> and <string-name><given-names>J. W.</given-names> <surname>Wang</surname></string-name></person-group>, &#x201C;<article-title>GAN-GLS: Generative lyric steganography based on generative adversarial networks</article-title>,&#x201D; <source>Computers, Materials &#x0026; Continua</source>, vol. <volume>69</volume>, no. <issue>1</issue>, pp. <fpage>1375</fpage>&#x2013;<lpage>1390</lpage>, <year>2021</year>.</mixed-citation></ref>
<ref id="ref-6"><label>[6]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>C. Y.</given-names> <surname>Chang</surname></string-name> and <string-name><given-names>S.</given-names> <surname>Clark</surname></string-name></person-group>, &#x201C;<article-title>Practical linguistic steganography using contextual synonym substitution and a novel vertex coding method</article-title>,&#x201D; <source>Computational Linguistics</source>, vol. <volume>40</volume>, no. <issue>2</issue>, pp. <fpage>403</fpage>&#x2013;<lpage>448</lpage>, <year>2014</year>.</mixed-citation></ref>
<ref id="ref-7"><label>[7]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>Z. L.</given-names> <surname>Yang</surname></string-name>, <string-name><given-names>S. Y.</given-names> <surname>Zhang</surname></string-name>, <string-name><given-names>Y. T.</given-names> <surname>Hu</surname></string-name>, <string-name><given-names>Z. W.</given-names> <surname>Hu</surname></string-name> and <string-name><given-names>Y. F.</given-names> <surname>Huang</surname></string-name></person-group>, &#x201C;<article-title>VAE-stega: Linguistic steganography based on variational auto-encoder</article-title>,&#x201D; <source>IEEE Transactions on Information Forensics and Security</source>, vol. <volume>16</volume>, pp. <fpage>880</fpage>&#x2013;<lpage>895</lpage>, <year>2021</year>.</mixed-citation></ref>
<ref id="ref-8"><label>[8]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>X. J.</given-names> <surname>Zhou</surname></string-name>, <string-name><given-names>W. L.</given-names> <surname>Peng</surname></string-name>, <string-name><given-names>B. Y.</given-names> <surname>Yang</surname></string-name>, <string-name><given-names>J.</given-names> <surname>Wen</surname></string-name> and <string-name><given-names>Y. M.</given-names> <surname>Xue</surname></string-name> <etal>et al.,</etal></person-group> &#x201C;<article-title>Linguistic steganography based on adaptive probability distribution</article-title>,&#x201D; <source>IEEE Transactions on Dependable and Secure Computing</source>, vol. <volume>19</volume>, no. <issue>5</issue>, pp. <fpage>2982</fpage>&#x2013;<lpage>2997</lpage>, <year>2022</year>.</mixed-citation></ref>
<ref id="ref-9"><label>[9]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>M. T.</given-names> <surname>Ahvanooey</surname></string-name>, <string-name><given-names>Q. M.</given-names> <surname>Li</surname></string-name>, <string-name><given-names>J.</given-names> <surname>Hou</surname></string-name>, <string-name><given-names>A. R.</given-names> <surname>Rajput</surname></string-name> and <string-name><given-names>Y. N.</given-names> <surname>Chen</surname></string-name></person-group>, &#x201C;<article-title>Modern text hiding, text steganalysis, and applications: A comparative analysis</article-title>,&#x201D; <source>Entropy</source>, vol. <volume>21</volume>, no. <issue>4</issue>, pp. <fpage>355</fpage>, <year>2019</year>.</mixed-citation></ref>
<ref id="ref-10"><label>[10]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>H.</given-names> <surname>Yang</surname></string-name> and <string-name><given-names>X.</given-names> <surname>Cao</surname></string-name></person-group>, &#x201C;<article-title>Linguistic steganalysis based on meta features and immune mechanism</article-title>,&#x201D; <source>Chinese Journal of Electronics</source>, vol. <volume>19</volume>, no. <issue>4</issue>, pp. <fpage>661</fpage>&#x2013;<lpage>666</lpage>, <year>2010</year>.</mixed-citation></ref>
<ref id="ref-11"><label>[11]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>H. Z.</given-names> <surname>Wu</surname></string-name>, <string-name><given-names>B.</given-names> <surname>Yi</surname></string-name>, <string-name><given-names>F.</given-names> <surname>Ding</surname></string-name>, <string-name><given-names>G. R.</given-names> <surname>Feng</surname></string-name> and <string-name><given-names>X. P.</given-names> <surname>Zhang</surname></string-name></person-group>, &#x201C;<article-title>Linguistic steganalysis with graph neural networks</article-title>,&#x201D; <source>IEEE Signal Processing Letters</source>, vol. <volume>28</volume>, pp. <fpage>558</fpage>&#x2013;<lpage>562</lpage>, <year>2021</year>.</mixed-citation></ref>
<ref id="ref-12"><label>[12]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>J.</given-names> <surname>Wen</surname></string-name>, <string-name><given-names>X. J.</given-names> <surname>Zhou</surname></string-name>, <string-name><given-names>P.</given-names> <surname>Zhong</surname></string-name> and <string-name><given-names>Y. M.</given-names> <surname>Xue</surname></string-name></person-group>, &#x201C;<article-title>Convolutional neural network based text steganalysis</article-title>,&#x201D; <source>IEEE Signal Processing Letters</source>, vol. <volume>26</volume>, no. <issue>3</issue>, pp. <fpage>460</fpage>&#x2013;<lpage>464</lpage>, <year>2019</year>.</mixed-citation></ref>
<ref id="ref-13"><label>[13]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>T. Y.</given-names> <surname>Liu</surname></string-name> and <string-name><given-names>W. H.</given-names> <surname>Tsai</surname></string-name></person-group>, &#x201C;<article-title>A new steganographic method for data hiding in microsoft word documents by a change tracking technique</article-title>,&#x201D; <source>IEEE Transactions on Information Forensics and Security</source>, vol. <volume>2</volume>, no. <issue>1</issue>, pp. <fpage>24</fpage>&#x2013;<lpage>30</lpage>, <year>2007</year>.</mixed-citation></ref>
<ref id="ref-14"><label>[14]</label><mixed-citation publication-type="conf-proc"><person-group person-group-type="author"><string-name><given-names>P.</given-names> <surname>Liu</surname></string-name>, <string-name><given-names>X.</given-names> <surname>Qiu</surname></string-name> and <string-name><given-names>X.</given-names> <surname>Huang</surname></string-name></person-group>, &#x201C;<article-title>Recurrent neural network for text classification with multi-task learning</article-title>,&#x201D; in <conf-name>Proc. of the Twenty-Fifth Int. Joint Conf. on Artificial Intelligence (IJCAI)</conf-name>, <conf-loc>New York, NY, United States</conf-loc>, pp. <fpage>2873</fpage>&#x2013;<lpage>2879</lpage>, <year>2016</year>.</mixed-citation></ref>
<ref id="ref-15"><label>[15]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>G. Q.</given-names> <surname>Lu</surname></string-name>, <string-name><given-names>J. Z.</given-names> <surname>Gan</surname></string-name>, <string-name><given-names>J.</given-names> <surname>Yin</surname></string-name>, <string-name><given-names>Z. P.</given-names> <surname>Luo</surname></string-name>, <string-name><given-names>B.</given-names> <surname>Li</surname></string-name> <etal>et al.,</etal></person-group> &#x201C;<article-title>Multi-task learning using a hybrid representation for text classification</article-title>,&#x201D; <source>Neural Computing and Applications</source>, vol. <volume>32</volume>, pp. <fpage>6467</fpage>&#x2013;<lpage>6480</lpage>, <year>2020</year>.</mixed-citation></ref>
<ref id="ref-16"><label>[16]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>J.</given-names> <surname>Peng</surname></string-name>, <string-name><given-names>C.</given-names> <surname>Xia</surname></string-name>, <string-name><given-names>Y.</given-names> <surname>Xu</surname></string-name>, <string-name><given-names>X.</given-names> <surname>Li</surname></string-name>, <string-name><given-names>X.</given-names> <surname>Wu</surname></string-name> <etal>et al.,</etal></person-group> &#x201C;<article-title>A multi-task network for cardiac magnetic resonance image segmentation and classification</article-title>,&#x201D; <source>Intelligent Automation &#x0026; Soft Computing</source>, vol. <volume>30</volume>, no. <issue>1</issue>, pp. <fpage>259</fpage>&#x2013;<lpage>272</lpage>, <year>2021</year>.</mixed-citation></ref>
<ref id="ref-17"><label>[17]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>Z. L.</given-names> <surname>Yang</surname></string-name>, <string-name><given-names>N.</given-names> <surname>Wei</surname></string-name>, <string-name><given-names>J. Y.</given-names> <surname>Sheng</surname></string-name>, <string-name><given-names>Y. F.</given-names> <surname>Huang</surname></string-name> and <string-name><given-names>Y. J.</given-names> <surname>Zhang</surname></string-name></person-group>, &#x201C;<article-title>TS-CNN: Text steganalysis from semantic space based on convolutional neural network</article-title>,&#x201D; arXiv:1810.08136v1 [cs.CR], <year>2018</year>.</mixed-citation></ref>
<ref id="ref-18"><label>[18]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>Z. L.</given-names> <surname>Yang</surname></string-name>, <string-name><given-names>Y. F.</given-names> <surname>Huang</surname></string-name> and <string-name><given-names>Y. J.</given-names> <surname>Zhang</surname></string-name></person-group>, &#x201C;<article-title>TS-CSW: Text steganalysis and hidden capacity estimation based on convolutional sliding windows</article-title>,&#x201D; <source>Multimedia Tools and Applications</source>, vol. <volume>79</volume>, no. <issue>25</issue>, pp. <fpage>18293</fpage>&#x2013;<lpage>18316</lpage>, <year>2020</year>.</mixed-citation></ref>
<ref id="ref-19"><label>[19]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>L. Y.</given-names> <surname>Xiang</surname></string-name>, <string-name><given-names>G. Q.</given-names> <surname>Guo</surname></string-name>, <string-name><given-names>J. M.</given-names> <surname>Yu</surname></string-name>, <string-name><given-names>V. S.</given-names> <surname>Sheng</surname></string-name> and <string-name><given-names>P.</given-names> <surname>Yang</surname></string-name></person-group>, &#x201C;<article-title>A convolutional neural network-based linguistic steganalysis for synonym substitution steganography</article-title>,&#x201D; <source>Mathematical Biosciences and Engineering</source>, vol. <volume>17</volume>, no. <issue>2</issue>, pp. <fpage>1041</fpage>&#x2013;<lpage>1058</lpage>, <year>2020</year>.</mixed-citation></ref>
<ref id="ref-20"><label>[20]</label><mixed-citation publication-type="conf-proc"><person-group person-group-type="author"><string-name><given-names>H.</given-names> <surname>Yang</surname></string-name>, <string-name><given-names>Y. J.</given-names> <surname>Bao</surname></string-name>, <string-name><given-names>Z. L.</given-names> <surname>Yang</surname></string-name>, <string-name><given-names>S.</given-names> <surname>Liu</surname></string-name>, <string-name><given-names>Y. F.</given-names> <surname>Huang</surname></string-name> <etal>et al.,</etal></person-group> &#x201C;<article-title>Linguistic steganalysis via densely connected LSTM with feature pyramid</article-title>,&#x201D; in <conf-name>Proc. of the 2020 ACM Workshop on Information Hiding and Multimedia Security</conf-name>, <conf-loc>New York, NY, United States</conf-loc>, pp. <fpage>5</fpage>&#x2013;<lpage>10</lpage>, <year>2020</year>.</mixed-citation></ref>
<ref id="ref-21"><label>[21]</label><mixed-citation publication-type="conf-proc"><person-group person-group-type="author"><string-name><given-names>B.</given-names> <surname>Yi</surname></string-name>, <string-name><given-names>H. Z.</given-names> <surname>Wu</surname></string-name>, <string-name><given-names>G. R.</given-names> <surname>Feng</surname></string-name> and <string-name><given-names>X. P.</given-names> <surname>Zhang</surname></string-name></person-group>, &#x201C;<article-title>Exploiting language model for efficient linguistic steganalysis: An empirical study</article-title>,&#x201D; in <conf-name>2022 IEEE Int. Conf. on Acoustics, Speech and Signal Processing (ICASSP)</conf-name>, <conf-loc>Singapore</conf-loc>, pp. <fpage>3074</fpage>&#x2013;<lpage>3078</lpage>, <year>2022</year>.</mixed-citation></ref>
<ref id="ref-22"><label>[22]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>H.</given-names> <surname>Li</surname></string-name> and <string-name><given-names>S.</given-names> <surname>Jin</surname></string-name></person-group>, &#x201C;<article-title>Text steganalysis based on capsule network with dynamic routing</article-title>,&#x201D; <source>IETE Technical Review</source>, vol. <volume>38</volume>, no. <issue>1</issue>, pp. <fpage>72</fpage>&#x2013;<lpage>81</lpage>, <year>2021</year>.</mixed-citation></ref>
<ref id="ref-23"><label>[23]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>E. L.</given-names> <surname>Li</surname></string-name>, <string-name><given-names>Z. J.</given-names> <surname>Fu</surname></string-name>, <string-name><given-names>S. Y.</given-names> <surname>Chen</surname></string-name> and <string-name><given-names>J. F.</given-names> <surname>Chen</surname></string-name></person-group>, &#x201C;<article-title>A two-stage highly robust text steganalysis model</article-title>,&#x201D; <source>Journal of Cybersecurity</source>, vol. <volume>2</volume>, no. <issue>4</issue>, pp. <fpage>183</fpage>&#x2013;<lpage>190</lpage>, <year>2020</year>.</mixed-citation></ref>
<ref id="ref-24"><label>[24]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>Y.</given-names> <surname>Niu</surname></string-name>, <string-name><given-names>J.</given-names> <surname>Wen</surname></string-name>, <string-name><given-names>P.</given-names> <surname>Zhong</surname></string-name>, and <string-name><given-names>Y. M.</given-names> <surname>Xue</surname></string-name></person-group>, &#x201C;<article-title>A hybrid R-bilstm-C neural network based text steganalysis</article-title>,&#x201D; <source>IEEE Signal Processing Letters</source>, vol. <volume>26</volume>, no. <issue>12</issue>, pp. <fpage>1907</fpage>&#x2013;<lpage>1911</lpage>, <year>2019</year>.</mixed-citation></ref>
<ref id="ref-25"><label>[25]</label><mixed-citation publication-type="conf-proc"><person-group person-group-type="author"><string-name><given-names>Y. J.</given-names> <surname>Bao</surname></string-name>, <string-name><given-names>H.</given-names> <surname>Yang</surname></string-name>, <string-name><given-names>Z. L.</given-names> <surname>Yang</surname></string-name>, <string-name><given-names>S.</given-names> <surname>Liu</surname></string-name> and <string-name><given-names>Y. F.</given-names> <surname>Huang</surname></string-name></person-group>, &#x201C;<article-title>Text steganalysis with attentional LSTM-CNN</article-title>,&#x201D; in <conf-name>2020 5th Int. Conf. on Computer and Communication Systems (ICCCS)</conf-name>, <conf-loc>Shanghai, China</conf-loc>, pp. <fpage>138</fpage>&#x2013;<lpage>142</lpage>, <year>2020</year>.</mixed-citation></ref>
<ref id="ref-26"><label>[26]</label><mixed-citation publication-type="other"><person-group person-group-type="author"><string-name><given-names>S. M.</given-names> <surname>Jiao</surname></string-name>, <string-name><given-names>H. F.</given-names> <surname>Wang</surname></string-name>, <string-name><given-names>K.</given-names> <surname>Zhang</surname></string-name> and <string-name><given-names>Y. Q.</given-names> <surname>Hu</surname></string-name></person-group>, &#x201C;<article-title>Neural linguistic steganalysis via multi-head self-attention</article-title>,&#x201D; <source>Journal of Electrical and Computer Engineering</source>, vol. <volume>2021</volume>, Article ID 6668369, 5 pages, <year>2021</year>.</mixed-citation></ref>
<ref id="ref-27"><label>[27]</label><mixed-citation publication-type="conf-proc"><person-group person-group-type="author"><string-name><given-names>J.</given-names> <surname>Zou</surname></string-name>, <string-name><given-names>Z. L.</given-names> <surname>Yang</surname></string-name>, <string-name><given-names>S. Y.</given-names> <surname>Zhang</surname></string-name>, <string-name><given-names>S. U.</given-names> <surname>Rehman</surname></string-name> and <string-name><given-names>Y. F.</given-names> <surname>Huang</surname></string-name></person-group>, &#x201C;<article-title>High-performance linguistic steganalysis, capacity estimation, and steganographic positioning</article-title>,&#x201D; in <conf-name>Int. Workshop on Digital Watermarking</conf-name>, <conf-loc>Melbourne, VIC, Australia</conf-loc>, pp. <fpage>80</fpage>&#x2013;<lpage>93</lpage>, <year>2020</year>.</mixed-citation></ref>
<ref id="ref-28"><label>[28]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>M.</given-names> <surname>Xu</surname></string-name>, <string-name><given-names>L. R.</given-names> <surname>Yang</surname></string-name>, <string-name><given-names>T. Y.</given-names> <surname>Zhao</surname></string-name> and <string-name><given-names>P.</given-names> <surname>Zhong</surname></string-name></person-group>, &#x201C;<article-title>A novel linguistic steganalysis method for hybrid steganographic texts</article-title>,&#x201D; <source>Journal of Physics Conference Series</source>, vol. <volume>1873</volume>, no. <issue>1</issue>, pp. <fpage>012053</fpage>, <year>2021</year>.</mixed-citation></ref>
</ref-list>
</back>
</article>