<?xml version="1.0" encoding="UTF-8" standalone="no"?>
<!DOCTYPE article PUBLIC "-//NLM//DTD Journal Publishing DTD v2.3 20070202//EN" "journalpublishing.dtd">
<article xml:lang="EN" xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink" article-type="research-article">
<front>
<journal-meta>
<journal-id journal-id-type="publisher-id">Front. Public Health</journal-id>
<journal-title>Frontiers in Public Health</journal-title>
<abbrev-journal-title abbrev-type="pubmed">Front. Public Health</abbrev-journal-title>
<issn pub-type="epub">2296-2565</issn>
<publisher>
<publisher-name>Frontiers Media S.A.</publisher-name>
</publisher>
</journal-meta>
<article-meta>
<article-id pub-id-type="doi">10.3389/fpubh.2021.835960</article-id>
<article-categories>
<subj-group subj-group-type="heading">
<subject>Public Health</subject>
<subj-group>
<subject>Original Research</subject>
</subj-group>
</subj-group>
</article-categories>
<title-group>
<article-title>Improving Alzheimer&#x00027;s Disease Detection for Speech Based on Feature Purification Network</article-title>
</title-group>
<contrib-group>
<contrib contrib-type="author">
<name><surname>Liu</surname> <given-names>Ning</given-names></name>
<xref ref-type="aff" rid="aff1"><sup>1</sup></xref>
<xref ref-type="aff" rid="aff2"><sup>2</sup></xref>
<xref ref-type="aff" rid="aff3"><sup>3</sup></xref>
<uri xlink:href="http://loop.frontiersin.org/people/1066710/overview"/>
</contrib>
<contrib contrib-type="author" corresp="yes">
<name><surname>Yuan</surname> <given-names>Zhenming</given-names></name>
<xref ref-type="aff" rid="aff1"><sup>1</sup></xref>
<xref ref-type="aff" rid="aff4"><sup>4</sup></xref>
<xref ref-type="corresp" rid="c001"><sup>&#x0002A;</sup></xref>
<uri xlink:href="http://loop.frontiersin.org/people/1099059/overview"/>
</contrib>
<contrib contrib-type="author" corresp="yes">
<name><surname>Tang</surname> <given-names>Qingfeng</given-names></name>
<xref ref-type="aff" rid="aff5"><sup>5</sup></xref>
<xref ref-type="corresp" rid="c002"><sup>&#x0002A;</sup></xref>
<uri xlink:href="http://loop.frontiersin.org/people/1650279/overview"/>
</contrib>
</contrib-group>
<aff id="aff1"><sup>1</sup><institution>School of Public Health, Hangzhou Normal University</institution>, <addr-line>Hangzhou</addr-line>, <country>China</country></aff>
<aff id="aff2"><sup>2</sup><institution>Department of Mathematics and Computer Science, Quanzhou Normal University</institution>, <addr-line>Quanzhou</addr-line>, <country>China</country></aff>
<aff id="aff3"><sup>3</sup><institution>Fujian Provincial Key Laboratory of Data-Intensive Computing, Quanzhou Normal University</institution>, <addr-line>Quanzhou</addr-line>, <country>China</country></aff>
<aff id="aff4"><sup>4</sup><institution>School of Information Science and Technology, Hangzhou Normal University</institution>, <addr-line>Hangzhou</addr-line>, <country>China</country></aff>
<aff id="aff5"><sup>5</sup><institution>School of Computer and Information, Anqing Normal University</institution>, <addr-line>Anqing</addr-line>, <country>China</country></aff>
<author-notes>
<fn fn-type="edited-by"><p>Edited by: Thippa Reddy Gadekallu, VIT University, India</p></fn>
<fn fn-type="edited-by"><p>Reviewed by: Praveen Kumar, VIT University, India; Weizheng Wang, City University of Hong Kong, Hong Kong SAR, China</p></fn>
<corresp id="c001">&#x0002A;Correspondence: Zhenming Yuan <email>zmyuan&#x00040;hznu.edu.cn</email></corresp>
<corresp id="c002">Qingfeng Tang <email>tqf1013&#x00040;sina.com</email></corresp>
<fn fn-type="other" id="fn001"><p>This article was submitted to Digital Public Health, a section of the journal Frontiers in Public Health</p></fn></author-notes>
<pub-date pub-type="epub">
<day>03</day>
<month>03</month>
<year>2022</year>
</pub-date>
<pub-date pub-type="collection">
<year>2021</year>
</pub-date>
<volume>9</volume>
<elocation-id>835960</elocation-id>
<history>
<date date-type="received">
<day>15</day>
<month>12</month>
<year>2021</year>
</date>
<date date-type="accepted">
<day>28</day>
<month>12</month>
<year>2021</year>
</date>
</history>
<permissions>
<copyright-statement>Copyright &#x000A9; 2022 Liu, Yuan and Tang.</copyright-statement>
<copyright-year>2022</copyright-year>
<copyright-holder>Liu, Yuan and Tang</copyright-holder>
<license xlink:href="http://creativecommons.org/licenses/by/4.0/"><p>This is an open-access article distributed under the terms of the Creative Commons Attribution License (CC BY). The use, distribution or reproduction in other forums is permitted, provided the original author(s) and the copyright owner(s) are credited and that the original publication in this journal is cited, in accordance with accepted academic practice. No use, distribution or reproduction is permitted which does not comply with these terms.</p></license></permissions>
<abstract>
<p>Alzheimer&#x00027;s disease (AD) is a neurodegenerative disease involving the decline of cognitive ability with illness progresses. At present, the diagnosis of AD mainly depends on the interviews between patients and doctors, which is slow, expensive, and subjective, so it is not a better solution to recognize AD using the currently available neuropsychological examinations and clinical diagnostic criteria. A recent study has indicated the potential of language analysis for AD diagnosis. In this study, we proposed a novel feature purification network that can improve the representation learning of transformer model further. Though transformer has made great progress in generating discriminative features because of its long-distance reasoning ability, there is still room for improvement. There exist many common features that are not indicative of any specific class, and we rule out the influence of common features from traditional features extracted by transformer encoder and can get more discriminative features for classification. We apply this method to improve transformer&#x00027;s performance on three public dementia datasets and get improved classification results markedly. Specifically, the method on Pitt datasets gets state-of-the-art (SOTA) result.</p></abstract>
<kwd-group>
<kwd>Alzheimer&#x00027;s disease</kwd>
<kwd>natural language processing</kwd>
<kwd>deep learning</kwd>
<kwd>transformer</kwd>
<kwd>machine learning</kwd>
<kwd>speech and language</kwd>
<kwd>mild cognitive impairment</kwd>
</kwd-group>
<counts>
<fig-count count="1"/>
<table-count count="5"/>
<equation-count count="14"/>
<ref-count count="55"/>
<page-count count="9"/>
<word-count count="6591"/>
</counts>
</article-meta>
</front>
<body>
<sec sec-type="intro" id="s1">
<title>Introduction</title>
<p>Alzheimer&#x00027;s disease (AD) is a nervous degenerative disease with an insidious and irreversible onset, which is difficult to be detected in every stage. AD can influence patients&#x00027; daily living ability and social communicate ability and may even lead to disability (<xref ref-type="bibr" rid="B1">1</xref>, <xref ref-type="bibr" rid="B2">2</xref>). Researchers have found that AD has a profound impact on patients&#x00027; language function (<xref ref-type="bibr" rid="B3">3</xref>) in addition to mood, attention, memory, movement, and so on. Language is the representation of mental activities, which can clearly reflect the relationship among language, cognition, and communication (<xref ref-type="bibr" rid="B4">4</xref>). Language interference is a common manifestation of patients (<xref ref-type="bibr" rid="B5">5</xref>) with AD which may even earlier than orientation and memory difficulties (<xref ref-type="bibr" rid="B6">6</xref>, <xref ref-type="bibr" rid="B7">7</xref>). Picture description task, taken from Boston Aphasia Diagnostic Test (<xref ref-type="bibr" rid="B8">8</xref>), has already been verified sensitive to subtle cognitive deficits (<xref ref-type="bibr" rid="B9">9</xref>); therefore, valuable clinical information can be obtained from spontaneous speech to recognize AD. The transcripts of speech can be used to detect AD effectively.</p>
<p>The problem of AD recognition can be regarded as text classification problem in natural language processing (NLP). Deep learning models manifest better in classification as they can extract deep semantic features by effective model architecture automatically. For example, RNN can capture long-term dependencies within sentence, but it may neglect some important local words which may important for classification (<xref ref-type="bibr" rid="B10">10</xref>), and CNN can capture local and position-related features (<xref ref-type="bibr" rid="B11">11</xref>) but cannot give enough weight to some discriminative or special words. To solve the problem, attention mechanism was introduced. Transformer gives different weights to different words using attention mechanism, the performance of which is better than CNN and RNN. Although transformer has made great progress in producing discriminative features by powerful representation learning, there is still room to improve. There are few studies nowadays in this area to improve representation learning of deep learning. Based on GRL (<xref ref-type="bibr" rid="B12">12</xref>&#x02013;<xref ref-type="bibr" rid="B17">17</xref>) in extracting common features which are not discriminative for classification, this paper proposes a novel feature purification method to improve the representation learning of transformer to get a more discriminative feature vector to diagnose AD.</p>
<p>The original transcripts of speech are the description of a picture, which should be comprehensive and integrated for a normal individual. That is to say, the discriminative words or sentences, with relevant and less vague words, should be included. For example, accurate descriptive words, such as &#x0201C;mother&#x0201D;, &#x0201C;tap&#x0201D;, &#x0201C;the stool is tipping&#x0201D;, etc., are usually a better cognitive sign. Words or sentences such as &#x0201C;I do not know&#x0201D;, &#x0201C;um&#x0201D;, and &#x0201C;pause&#x0201D; should be an indicative of a bad cognitive condition, and they are discriminative for AD recognition. But some equivocal, inconsequential, and even irrelevant descriptions are unhelpful and may even interfere with the final classification, such as &#x0201C;is not that enough?&#x0201D;, &#x0201C;It is great&#x0201D;, &#x0201C;there may be a little breeze coming in&#x0201D;, et al. They can disturb the representation learning of deep learning by producing suboptimal representations. To solve this problem, transformer proposes a self-attention mechanism to give weight to words and usually can get better performance than RNN and CNN. Though attention may alleviate the influence by giving a higher or lower weight for those more or less relevant words, the classification problem cannot be solved properly with inaccurate attention mechanism or specificity of data. To solve the above problems, our study, inspired by the paper (<xref ref-type="bibr" rid="B17">17</xref>) which used feature projection method to purify the representation learning of deep learning, proposes a novel feature purification method to improve representation learning of transformer to get more discriminative features, which is GP-Net. It has two subnetworks, a common feature learning network called G-Net and a purification network called P-Net. G-Net uses gradient reverse layer (GRL) (<xref ref-type="bibr" rid="B12">12</xref>, <xref ref-type="bibr" rid="B13">13</xref>, <xref ref-type="bibr" rid="B18">18</xref>) to extract common features which are shared by classes and have no or few roles for classification. P-Net first uses transformer encoder to extract traditional feature vector for the sentence. Then, it rules out the common features from traditional feature vector to generate more purified features. It is clear that this operation gets rid of the effect of common features and makes the system only focus on discriminative features. We will explain the principle in Method Section.</p>
<p>The experiments on three datasets with our method get an improved performance which prove that the purified features are more discriminative. To the best of our knowledge, there have been still no studies to recognize AD from spontaneous speech by purifying representation learning of deep learning up to now.</p>
<p>The key contributions we have made in this work include the following:</p>
<list list-type="simple">
<list-item><p>(1) A whole process of AD screening method, based on linguistic data, was designed and implemented.</p></list-item>
<list-item><p>(2) We propose a novel feature purification network to improve representation learning of transformer and get state-of-the-art (SOTA) result on Pitt dataset.</p></list-item>
<list-item><p>(3) The proposed method has the advantage of low cost, reliable, and convenience, which can provide a feasible solution for the screening of AD with a better performance.</p></list-item>
</list>
</sec>
<sec id="s2">
<title>Related Work</title>
<p>Existing studies on AD diagnosis across spontaneous speech mainly focus on two aspects. One is feature extraction manually including acoustic features (<xref ref-type="bibr" rid="B19">19</xref>&#x02013;<xref ref-type="bibr" rid="B21">21</xref>), linguistic features (<xref ref-type="bibr" rid="B22">22</xref>&#x02013;<xref ref-type="bibr" rid="B25">25</xref>), or their combinations (<xref ref-type="bibr" rid="B21">21</xref>). This method is subjective and needs more professional knowledge. They are generally associated with a specific task scenario; once the scenario changes, these artificially designed features and prior settings cannot adapt to new scenarios and need to be redesigned, so the model has a low universality. The other is deep learning method which can extract deep semantic features automatically. Based on its powerful representation learning ability, the performance of deep learning is usually better than the first method. Additionally, deep learning improves the generalization ability of the classifiers which can be utilized further in different clinical environments. Deep neural network can process representation learning to extract deep semantic features using cascaded data of multilevel non-linear processing units without the need for feature engineering manually.</p>
<sec>
<title>AD Detection Based on Deep Learning</title>
<p>There are many studies to detect AD from oral speech with deep learning methods (<xref ref-type="bibr" rid="B26">26</xref>&#x02013;<xref ref-type="bibr" rid="B29">29</xref>), such as RNN, long&#x02013;short-term memory (LSTM) networks [e.g., ELMo (<xref ref-type="bibr" rid="B30">30</xref>)] and CNN. Recurrent convolutional neural Networks (RCNN) (<xref ref-type="bibr" rid="B31">31</xref>) uses Bi-LSTM to get contextual information and then concedes the hidden output of Bi-LSTM and word embedding for classification. DPCNN (<xref ref-type="bibr" rid="B32">32</xref>) is a simple network with 15 layers which likes a deep CNN, and it increases network depth of CNN but does not increase the computational cost. Attention mechanism is used in many NLP tasks such as text classification (<xref ref-type="bibr" rid="B33">33</xref>&#x02013;<xref ref-type="bibr" rid="B36">36</xref>). Transformer architecture [e.g., Bert (<xref ref-type="bibr" rid="B37">37</xref>)] uses attention mechanism to extract deep semantic features. Enhanced representation through knowledge integration (ERNIE) (<xref ref-type="bibr" rid="B38">38</xref>, <xref ref-type="bibr" rid="B39">39</xref>), proposed in 2019 by Baidu corporation, is optimized further based on Bert model. They usually have better performance than CNN, RNN, and LSTM.</p>
<p>Public Dementiabank datasets or ADReSS challenge (<xref ref-type="bibr" rid="B40">40</xref>) datasets are often used to recognize AD. For example, Orimaye et al. (<xref ref-type="bibr" rid="B41">41</xref>) proposed the combination of deep language models and deep neural network to predict mild cognitive impairment (MCI) and AD. The datasets used were public Dementiabank transcript with 37 healthy elderly and 37 MCI transcripts. The study did not use any handcrafted features; just the original transcripts were fed to the model, and n-gram word embedding method combined with deep neural network (DNN) got a best AUC of 0.83. Different from our dataset and classification, there was no comparability with our method. Karlekar et al. (<xref ref-type="bibr" rid="B23">23</xref>) used four types of interviews: story recall, sentence construction, cookie-theft picture description, and vocabulary fluency; the dataset included 243 normal controls and 1,017 AD transcripts. Three classifiers were used for comparison, that is, LSTM-RNN, CNN, and CNN-LSTM, and achieved a best accuracy of 91.1%, but the results were somewhat questionable as mentioned in the Discussion. These methods used deep learning algorithms or their linear combinations to recognize MCI and AD. Our work is much different clearly as none of these existing studies improve representation learning of deep learning by feature purification method.</p></sec>
<sec>
<title>Studies Related to GRL</title>
<p>Our study is related to some former work. Ganin and Lempitsky (<xref ref-type="bibr" rid="B13">13</xref>) first introduced GRL to extract common features which were sentiment-sensitive and domain shared in domain adaptation (DA). It embeds DA to the process of representation learning in order that the final classification result is more discriminative for the domain changes. Though we use GRL to extract common features, we do not use it in the area of DA, and they also do not use for feature purification. Belinkov et al. (<xref ref-type="bibr" rid="B14">14</xref>) used adversarial learning to encourage the model to process representation learning on SNLI dataset. Combining with aspect attention and GRL, Kai Zhang et al. (<xref ref-type="bibr" rid="B16">16</xref>) studied cross domain text classification problem, and common features across domains were extracted from the aspects for text classifications. The idea of generative adversarial networks (GANs) (<xref ref-type="bibr" rid="B42">42</xref>) was used to ensure that the common feature space did not mix with private features and only contained pure task-independent common feature representation. In these studies, they all used GRL to extract common features inseparable for two domains, and domain-shared features were generated in the shared space according to adversarial training, whereas our study is different from them clearly as this existing work does not improve representation learning of the model. The study (<xref ref-type="bibr" rid="B17">17</xref>) proposed a feature projection method to further improve representation learning of deep learning from a novel angle. The method projected existing features into the orthogonal space of the common features, so the resulting projection is perpendicular to the space that common features located in and thus more discriminative for text classification. Different from this study (<xref ref-type="bibr" rid="B17">17</xref>) which only deletes a section of common features, we rule out the influence of whole common features, which we believe that a better classification performance should be achieved. Also, we did the experiment with the method of study (<xref ref-type="bibr" rid="B17">17</xref>) on Pitt dataset, and the performance is not better than our method, just as shown in <xref ref-type="table" rid="T1">Table 1</xref>.</p>
<table-wrap position="float" id="T1">
<label>Table 1</label>
<caption><p>Relationship between predicted and true classes.</p></caption>
<table frame="hsides" rules="groups">
<thead>
<tr>
<th/>
<th valign="top" align="center" colspan="2"><bold>True class</bold></th>
</tr>
</thead>
<tbody>
<tr>
<td valign="top" align="left"><bold>Predicted class</bold></td>
<td valign="top" align="left">Positive</td>
<td valign="top" align="left">Negative</td>
</tr>
<tr>
<td valign="top" align="left">Positive</td>
<td valign="top" align="left">True positive (TP)</td>
<td valign="top" align="left">False positive (FP)</td>
</tr>
<tr>
<td valign="top" align="left">Negative</td>
<td valign="top" align="left">False negative (FN)</td>
<td valign="top" align="left">True negative (TN)</td>
</tr>
</tbody>
</table>
</table-wrap></sec></sec>
<sec sec-type="methods" id="s3">
<title>Methods</title>
<p>In this study, we propose a novel GP-Net framework to recognize AD from normal controls, which is indeed a binary classification problem in NLP.</p>
<sec>
<title>Feature Purification Network: GP-Net</title>
<p>This paper proposed a novel architecture, named GP-Net, to recognize AD, the network structure of which is shown in <xref ref-type="fig" rid="F1">Figure 1</xref>. The whole network includes two sections: G-Net and P-Net. The aim of G-Net is to extract common features by reversing the gradient direction in the training process, and these common features are shared by both classes and have no discriminative for classification. The aim of P-Net is to purify the features further by deleting the common features from traditional features extracted from transformer model. G-Net includes four sections, that is, the input layer X, feature extractor F<sub>c</sub>, GRL, and classifier layer C<sub>c</sub>. P-Net also includes four sections, which include the input layer X, feature extractor F<sub>p</sub> (the features extracted by F<sub>c</sub> and F<sub>p</sub> have no share parameters), purification network, and classifier layer C<sub>p</sub>. The main idea of proposed network is as follows: the feature vector, extracted by the feature extractor F<sub>p</sub>, deletes the common features got from G-Net, and then, more discriminative purified features have got for the final classification. Two operations, including G-Net and P-Net, are required in order for feature purification operation.</p>
<fig id="F1" position="float">
<label>Figure 1</label>
<caption><p>The architecture of GP-Net.</p></caption>
<graphic mimetype="image" mime-subtype="tiff" xlink:href="fpubh-09-835960-g0001.tif"/>
</fig></sec>
<sec>
<title>Transformer Extractor</title>
<p>This study uses transformer encoder as the feature extractor. Transformer is a SOTA model which has a novel architecture to solve sequence to sequence tasks. The model can capture long-distance dependencies and learn global semantic features of input text thoroughly through multihead self-attention mechanism. As transformer has some mechanisms as self-attention and location code, it has excellent feature extraction and semantic abstract competence. Like most Seq2Seq model, transformer model also uses encoder&#x02013;decoder structure, the encoder of which is a better feature extractor with multihead attention and feed forward neural network.</p>
<p>Supposing G-Net and P-Net have the same input <italic>X</italic>, the feature extractors of G-Net and P-Net are F<sub>c</sub> and F<sub>p</sub>, which can get the advanced features f<sub>p</sub> and f<sub>c</sub> from the input layer, respectively, but there are not any shared parameters between them. We refer to the features of P-Net and G-Net, respectively, as</p>
<disp-formula id="E1"><label>(1)</label><mml:math id="M1"><mml:mtable class="eqnarray" columnalign="left"><mml:mtr><mml:mtd><mml:msub><mml:mrow><mml:mi>f</mml:mi></mml:mrow><mml:mrow><mml:mi>p</mml:mi></mml:mrow></mml:msub><mml:mo>=</mml:mo><mml:mi>T</mml:mi><mml:mi>r</mml:mi><mml:mi>a</mml:mi><mml:mi>n</mml:mi><mml:mi>s</mml:mi><mml:mi>f</mml:mi><mml:mi>o</mml:mi><mml:mi>r</mml:mi><mml:mi>m</mml:mi><mml:mi>e</mml:mi><mml:msub><mml:mrow><mml:mi>r</mml:mi></mml:mrow><mml:mrow><mml:mi>p</mml:mi></mml:mrow></mml:msub><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mi>X</mml:mi></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow><mml:mo>,</mml:mo></mml:mtd></mml:mtr></mml:mtable></mml:math></disp-formula>
<disp-formula id="E2"><label>(2)</label><mml:math id="M2"><mml:mtable class="eqnarray" columnalign="left"><mml:mtr><mml:mtd><mml:msub><mml:mrow><mml:mi>f</mml:mi></mml:mrow><mml:mrow><mml:mi>c</mml:mi></mml:mrow></mml:msub><mml:mo>=</mml:mo><mml:mi>T</mml:mi><mml:mi>r</mml:mi><mml:mi>a</mml:mi><mml:mi>n</mml:mi><mml:mi>s</mml:mi><mml:mi>f</mml:mi><mml:mi>o</mml:mi><mml:mi>r</mml:mi><mml:mi>m</mml:mi><mml:mi>e</mml:mi><mml:msub><mml:mrow><mml:mi>r</mml:mi></mml:mrow><mml:mrow><mml:mi>c</mml:mi></mml:mrow></mml:msub><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mi>X</mml:mi></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow><mml:mo>,</mml:mo></mml:mtd></mml:mtr></mml:mtable></mml:math></disp-formula>
<p>Additional details of G-Net and P-Net will be introduced in G-Net and P-Net module.</p></sec>
<sec>
<title>G-Net Module</title>
<p>The main goal of G-Net module is to extract common features among datasets, which is not discriminative for the classification. As common features are those shared by all the classes, the classifier cannot use them to distinguish different classes effectively. To get common features, GRL (<xref ref-type="bibr" rid="B12">12</xref>, <xref ref-type="bibr" rid="B13">13</xref>, <xref ref-type="bibr" rid="B18">18</xref>) is added between the feature extractor F<sub>c</sub> and the classifier to reverse the gradient direction. The common features that are shared among different classes are obtained after the training module. G<sub>&#x003BB;</sub> can be thought as two incompatible equations that describe the forward and back propagation behaviors:</p>
<disp-formula id="E3"><label>(3)</label><mml:math id="M3"><mml:mtable class="eqnarray" columnalign="left"><mml:mtr><mml:mtd><mml:msub><mml:mrow><mml:mi>G</mml:mi></mml:mrow><mml:mrow><mml:mo>&#x003BB;</mml:mo></mml:mrow></mml:msub><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mi>x</mml:mi></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow><mml:mo>=</mml:mo><mml:mi>x</mml:mi><mml:mo>,</mml:mo></mml:mtd></mml:mtr></mml:mtable></mml:math></disp-formula>
<disp-formula id="E4"><label>(4)</label><mml:math id="M4"><mml:mtable class="eqnarray" columnalign="left"><mml:mtr><mml:mtd><mml:mfrac><mml:mrow><mml:mi>&#x02202;</mml:mi><mml:msub><mml:mrow><mml:mi>G</mml:mi></mml:mrow><mml:mrow><mml:mo>&#x003BB;</mml:mo></mml:mrow></mml:msub></mml:mrow><mml:mrow><mml:mi>&#x02202;</mml:mi><mml:mi>x</mml:mi></mml:mrow></mml:mfrac><mml:mo>=</mml:mo><mml:mo>-</mml:mo><mml:mo>&#x003BB;</mml:mo><mml:mi>I</mml:mi><mml:mo>,</mml:mo></mml:mtd></mml:mtr></mml:mtable></mml:math></disp-formula>
<p>where &#x003BB; is a hyper parameter. We process feature vector f<sub>c</sub> through GRL and get f<sub>c</sub>&#x00027;, for example, G<sub>&#x003BB;</sub> (f<sub>c</sub>) = f<sub>c</sub>&#x00027;. To make f<sub>c</sub>&#x00027; close to real common features, GRL acts as identity transform during the forward propagation and then takes the gradient from subsequent level and changes the value (i.e., multiplies it by -&#x003BB;) before passing it to the next layer during back propagation, and this operation can ensure that the feature distributions are similar and as indistinguishable as possible for the classifier. Only in this way we can get the common features sharing among classes. Finally, f<sub>c</sub>&#x00027; is fed to classifier C<sub>c</sub>.</p>
<disp-formula id="E5"><label>(5)</label><mml:math id="M5"><mml:mtable class="eqnarray" columnalign="left"><mml:mtr><mml:mtd><mml:msub><mml:mrow><mml:mi>Y</mml:mi></mml:mrow><mml:mrow><mml:mi>G</mml:mi><mml:mi>R</mml:mi><mml:mi>L</mml:mi></mml:mrow></mml:msub><mml:mo>=</mml:mo><mml:mi>s</mml:mi><mml:mi>o</mml:mi><mml:mi>f</mml:mi><mml:mi>t</mml:mi><mml:mi>m</mml:mi><mml:mi>a</mml:mi><mml:mi>x</mml:mi><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:msubsup><mml:mrow><mml:mi>W</mml:mi></mml:mrow><mml:mrow><mml:mi>c</mml:mi></mml:mrow><mml:mrow><mml:mo>*</mml:mo></mml:mrow></mml:msubsup><mml:msubsup><mml:mrow><mml:mi>f</mml:mi></mml:mrow><mml:mrow><mml:mi>c</mml:mi></mml:mrow><mml:mrow><mml:mi>&#x02032;</mml:mi></mml:mrow></mml:msubsup><mml:mo>&#x0002B;</mml:mo><mml:msub><mml:mrow><mml:mi>b</mml:mi></mml:mrow><mml:mrow><mml:mi>c</mml:mi></mml:mrow></mml:msub></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow><mml:mo>,</mml:mo></mml:mtd></mml:mtr></mml:mtable></mml:math></disp-formula>
<disp-formula id="E6"><label>(6)</label><mml:math id="M6"><mml:mtable class="eqnarray" columnalign="left"><mml:mtr><mml:mtd><mml:mi>L</mml:mi><mml:mi>o</mml:mi><mml:mi>s</mml:mi><mml:msub><mml:mrow><mml:mi>s</mml:mi></mml:mrow><mml:mrow><mml:mi>c</mml:mi></mml:mrow></mml:msub><mml:mo>=</mml:mo><mml:mi>C</mml:mi><mml:mi>r</mml:mi><mml:mi>o</mml:mi><mml:mi>s</mml:mi><mml:mi>s</mml:mi><mml:mi>E</mml:mi><mml:mi>n</mml:mi><mml:mi>t</mml:mi><mml:mi>r</mml:mi><mml:mi>o</mml:mi><mml:mi>p</mml:mi><mml:mi>y</mml:mi><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:msub><mml:mrow><mml:mi>Y</mml:mi></mml:mrow><mml:mrow><mml:mi>T</mml:mi><mml:mi>r</mml:mi><mml:mi>u</mml:mi><mml:mi>e</mml:mi></mml:mrow></mml:msub><mml:mo>,</mml:mo><mml:msub><mml:mrow><mml:mi>Y</mml:mi></mml:mrow><mml:mrow><mml:mi>G</mml:mi><mml:mi>R</mml:mi><mml:mi>L</mml:mi></mml:mrow></mml:msub></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow><mml:mo>,</mml:mo></mml:mtd></mml:mtr></mml:mtable></mml:math></disp-formula>
<p>where W<sub>c</sub> and b<sub>c</sub> are the weight and bias of classifier C<sub>c.</sub> By optimizing Loss<sub>c</sub>, the feature extractor F<sub>c</sub> can extract common features of different classes.</p></sec>
<sec>
<title>P-Net Model</title>
<p>The goal of P-Net is to extract the semantic information from input example first and then purify features for the classification. Supposing the traditional feature vector we extracted by transformer is f<sub>p</sub>, the common feature vector is f<sub>c</sub>. The final feature vector for classification is f<sub>w</sub>.</p>
<disp-formula id="E7"><label>(7)</label><mml:math id="M7"><mml:mtable class="eqnarray" columnalign="left"><mml:mtr><mml:mtd><mml:msub><mml:mrow><mml:mi>f</mml:mi></mml:mrow><mml:mrow><mml:mi>w</mml:mi></mml:mrow></mml:msub><mml:mo>=</mml:mo><mml:msub><mml:mrow><mml:mi>f</mml:mi></mml:mrow><mml:mrow><mml:mi>p</mml:mi></mml:mrow></mml:msub><mml:mo>-</mml:mo><mml:msub><mml:mrow><mml:mi>f</mml:mi></mml:mrow><mml:mrow><mml:mi>c</mml:mi></mml:mrow></mml:msub><mml:mo>,</mml:mo></mml:mtd></mml:mtr></mml:mtable></mml:math></disp-formula>
<p>As f<sub>c</sub> disturbs the classification result, we delete f<sub>c</sub> from f<sub>p</sub> to eliminate the influence of nondiscriminative feature vector (i.e., common features), so the feature vector f<sub>w</sub> is more discriminative than f<sub>p</sub>. Finally, the purification feature vector f<sub>w</sub> is fed to classifier C<sub>p</sub>.</p>
<disp-formula id="E8"><label>(8)</label><mml:math id="M8"><mml:mtable class="eqnarray" columnalign="left"><mml:mtr><mml:mtd><mml:msub><mml:mrow><mml:mi>Y</mml:mi></mml:mrow><mml:mrow><mml:mi>R</mml:mi><mml:mi>e</mml:mi><mml:mi>s</mml:mi><mml:mi>u</mml:mi><mml:mi>l</mml:mi><mml:mi>t</mml:mi></mml:mrow></mml:msub><mml:mo>=</mml:mo><mml:mi>s</mml:mi><mml:mi>o</mml:mi><mml:mi>f</mml:mi><mml:mi>t</mml:mi><mml:mtext>&#x000A0;</mml:mtext><mml:mi>m</mml:mi><mml:mi>a</mml:mi><mml:mi>x</mml:mi><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:msub><mml:mrow><mml:mi>W</mml:mi></mml:mrow><mml:mrow><mml:mi>p</mml:mi></mml:mrow></mml:msub><mml:mo>*</mml:mo><mml:msub><mml:mrow><mml:mi>f</mml:mi></mml:mrow><mml:mrow><mml:mi>w</mml:mi></mml:mrow></mml:msub><mml:mo>&#x0002B;</mml:mo><mml:msub><mml:mrow><mml:mi>b</mml:mi></mml:mrow><mml:mrow><mml:mi>p</mml:mi></mml:mrow></mml:msub></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow><mml:mo>,</mml:mo></mml:mtd></mml:mtr></mml:mtable></mml:math></disp-formula>
<disp-formula id="E9"><label>(9)</label><mml:math id="M9"><mml:mtable class="eqnarray" columnalign="left"><mml:mtr><mml:mtd><mml:mi>L</mml:mi><mml:mi>o</mml:mi><mml:mi>s</mml:mi><mml:msub><mml:mrow><mml:mi>s</mml:mi></mml:mrow><mml:mrow><mml:mi>p</mml:mi></mml:mrow></mml:msub><mml:mo>=</mml:mo><mml:mi>C</mml:mi><mml:mi>r</mml:mi><mml:mi>o</mml:mi><mml:mi>s</mml:mi><mml:mi>s</mml:mi><mml:mi>E</mml:mi><mml:mi>n</mml:mi><mml:mi>t</mml:mi><mml:mi>r</mml:mi><mml:mi>o</mml:mi><mml:mi>p</mml:mi><mml:mi>y</mml:mi><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:msub><mml:mrow><mml:mi>Y</mml:mi></mml:mrow><mml:mrow><mml:mi>T</mml:mi><mml:mi>r</mml:mi><mml:mi>u</mml:mi><mml:mi>e</mml:mi></mml:mrow></mml:msub><mml:mo>,</mml:mo><mml:msub><mml:mrow><mml:mi>Y</mml:mi></mml:mrow><mml:mrow><mml:mi>R</mml:mi><mml:mi>e</mml:mi><mml:mi>s</mml:mi><mml:mi>u</mml:mi><mml:mi>l</mml:mi><mml:mi>t</mml:mi></mml:mrow></mml:msub></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow><mml:mo>,</mml:mo></mml:mtd></mml:mtr></mml:mtable></mml:math></disp-formula>
<p>where W<sub>p</sub> and b<sub>p</sub> are the weight and bias of classifier C<sub>p</sub>. By optimizing Loss<sub>p</sub>, the feature extractor F<sub>p</sub> can purify the features, Loss<sub>c</sub> and Loss<sub>p</sub> are trained simultaneously, but they use different optimizers. Loss<sub>c</sub> use moment SGD optimizer because Ganin and Lempitsky (<xref ref-type="bibr" rid="B13">13</xref>) also used moment SGD, and Loss<sub>p</sub> use Adam optimizer. We also conducted the experiments using Adam optimizer for both G-Net and P-Net and found that the results made no difference when using two different optimizers. In terms of optimization targets of feature extractor F<sub>c</sub>, though the two losses are opposite to each other, a balance can be found to make the extracted feature f<sub>c</sub> closer to real common features. The algorithm description of the whole training process is shown in <xref ref-type="table" rid="A1">Algorithm 1</xref>:</p>
<table-wrap position="float" id="A1">
<label>Algorithm 1</label>
<caption><p>GP-Net</p></caption>
<table frame="hsides" rules="groups">
<tbody>
<tr>
<td align="left" valign="top">1: Input: Supposing the datasets are <inline-formula><mml:math id="M10"><mml:mi>D</mml:mi><mml:mo>=</mml:mo><mml:msubsup><mml:mrow><mml:mrow><mml:mo>{</mml:mo><mml:mrow><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:msub><mml:mrow><mml:mi>x</mml:mi></mml:mrow><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub><mml:mo>,</mml:mo><mml:msub><mml:mrow><mml:mi>y</mml:mi></mml:mrow><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow></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:math></inline-formula>, x<sub>i</sub> is the embedding matrix of deep learning, <inline-formula><mml:math id="M11"><mml:msub><mml:mrow><mml:mi>X</mml:mi></mml:mrow><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub><mml:mo>&#x02208;</mml:mo><mml:msup><mml:mrow><mml:mi>R</mml:mi></mml:mrow><mml:mrow><mml:mi>L</mml:mi><mml:mi>k</mml:mi></mml:mrow></mml:msup></mml:math></inline-formula>, y<sub>i</sub> is the corresponding classes; randomly initialized the parameters of GP-Net.<break/>2: <bold>For</bold> every iteration b=1, 2,...N, <bold>do</bold>:<break/>3:&#x000A0;&#x000A0;&#x000A0;&#x000A0;Sample one batch x<sub>b</sub> from D,<break/>4:&#x000A0;&#x000A0;&#x000A0;&#x000A0;<bold>G-Net section:</bold><break/>5:&#x000A0;&#x000A0;&#x000A0;&#x000A0;Generate common features (CFs) (Equation 1)<break/>6:&#x000A0;&#x000A0;&#x000A0;&#x000A0;CFs go through GRL and get the features closer to the common features (Equation 3)<break/>7:&#x000A0;&#x000A0;&#x000A0;&#x000A0;Do the classification (Equation 5)<break/>8:&#x000A0;&#x000A0;&#x000A0;&#x000A0;<bold>P-Net section:</bold><break/>9:&#x000A0;&#x000A0;&#x000A0;&#x000A0;Generate traditional features(tfs) (Equation 2)<break/>10:&#x000A0;&#x000A0;&#x000A0;Get purified features (Equation 7)<break/>11:&#x000A0;&#x000A0;&#x000A0;Do the classification (Equation 8)<break/>12:&#x000A0;&#x000A0;&#x000A0;<bold>Update parameters:</bold><break/>13:&#x000A0;&#x000A0;&#x000A0;The parameters of P-Net and G-Net are updated together (Equation 6 and Equation 9)<break/>14: <bold>End for</bold></td>
</tr> 
</tbody>
</table>
</table-wrap></sec></sec>
<sec id="s4">
<title>Experiment</title>
<sec>
<title>Datasets</title>
<p>Three datasets are used to carry out the experiments which are all the dialogues of picture description task, including English and Chinese.</p>
<sec>
<title>Pitt Datasets</title>
<p>This is a Pitt corpus (<xref ref-type="bibr" rid="B43">43</xref>) from Dementiabank dataset (<xref ref-type="bibr" rid="B43">43</xref>), which comes from a study at School of Medicine in Pittsburgh University and is gathered longitudinally every year. More detailed description about the dataset can refer to the study (<xref ref-type="bibr" rid="B43">43</xref>). After deleting some unqualified datasets such as unknown label, memory impairment, and other dementia diagnose, for example, vascular dementia, there are 498 participants enrolled in our study after data preprocessing, which is composed of 242 controls and 256 possible or probable AD. Both categories are balanced basically.</p></sec>
<sec>
<title>ADReSS Datasets</title>
<p>The datasets include 78 dementia patients and 78 normal controls from ADReSS challenge in 2020. The speech is segmented using a voice activity detect method based on signal energy value. All datasets have already been preprocessed by removing noise.</p></sec>
<sec>
<title>iFLY Datasets</title>
<p>The Chinese datasets include 111 CTRL and 68 AD, with 60 women and 51 men in CTRL group and 38 women and 30 men in AD group, respectively. More details can refer to the website: <ext-link ext-link-type="uri" xlink:href="http://challenge.xfyun.cn/2019/gamedetail?blockId=978">http://challenge.xfyun.cn/2019/gamedetail?blockId=978</ext-link>.</p></sec></sec>
<sec>
<title>Feature Parameters</title>
<p>In the training stage of GP-Net module, a stochastic gradient of 0.9 is used as momentum, and annealing learning rate can be calculated by the following formula:</p>
<disp-formula id="E10"><label>(10)</label><mml:math id="M12"><mml:mtable class="eqnarray" columnalign="left"><mml:mtr><mml:mtd><mml:msub><mml:mrow><mml:mi>l</mml:mi></mml:mrow><mml:mrow><mml:mi>p</mml:mi></mml:mrow></mml:msub><mml:mo>=</mml:mo><mml:mfrac><mml:mrow><mml:msub><mml:mrow><mml:mi>l</mml:mi></mml:mrow><mml:mrow><mml:mn>0</mml:mn></mml:mrow></mml:msub></mml:mrow><mml:mrow><mml:msup><mml:mrow><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mn>1</mml:mn><mml:mo>&#x0002B;</mml:mo><mml:msup><mml:mrow><mml:mi>&#x003B1;</mml:mi></mml:mrow><mml:mrow><mml:mo>*</mml:mo></mml:mrow></mml:msup><mml:mi>p</mml:mi></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:mrow><mml:mrow><mml:mi>&#x003B2;</mml:mi></mml:mrow></mml:msup></mml:mrow></mml:mfrac></mml:mtd></mml:mtr></mml:mtable></mml:math></disp-formula>
<p>where <italic>l</italic><sub>0</sub>= 0.01, &#x003B1;= 10, &#x003B2;=0.75, <italic>p</italic> is training progress linearly changing from 0 to 1. In Equation (4), the parameter &#x003BB; is set as [0.05, 0.1, 0.2, 0.4, 0.8, and 1.0]. Transformer encoder is used as the feature extractor, with three blocks and single head specifically.</p></sec>
<sec>
<title>Experiment Results</title>
<p>For our model, 5-fold cross validation was used for training dataset. The dataset was divided into five parts randomly, of which four parts were used for training, and one part was used for test. We repeat the process five times using different test dataset every time. Finally, the results of five times were summarized, and the average value was used as the estimation of model performance index. The classification of our model adopts the following indexes: accuracy, precision, recall, and F1 score are used as the final index (<xref ref-type="bibr" rid="B44">44</xref>). The relationship between the actual class and predicted class is shown in <xref ref-type="table" rid="T1">Table 1</xref>, and the evaluate metrics in this study are defined as Equations (11&#x02013;14).</p>
<disp-formula id="E11"><label>(11)</label><mml:math id="M13"><mml:mtable class="eqnarray" columnalign="left"><mml:mtr><mml:mtd><mml:mi>A</mml:mi><mml:mi>c</mml:mi><mml:mi>c</mml:mi><mml:mi>u</mml:mi><mml:mi>r</mml:mi><mml:mi>a</mml:mi><mml:mi>c</mml:mi><mml:mi>y</mml:mi><mml:mo>=</mml:mo><mml:mfrac><mml:mrow><mml:mi>T</mml:mi><mml:mi>N</mml:mi><mml:mo>&#x0002B;</mml:mo><mml:mi>T</mml:mi><mml:mi>P</mml:mi></mml:mrow><mml:mrow><mml:mi>T</mml:mi><mml:mi>N</mml:mi><mml:mo>&#x0002B;</mml:mo><mml:mi>F</mml:mi><mml:mi>P</mml:mi><mml:mo>&#x0002B;</mml:mo><mml:mi>F</mml:mi><mml:mi>N</mml:mi><mml:mo>&#x0002B;</mml:mo><mml:mi>T</mml:mi><mml:mi>P</mml:mi></mml:mrow></mml:mfrac></mml:mtd></mml:mtr></mml:mtable></mml:math></disp-formula>
<disp-formula id="E12"><label>(12)</label><mml:math id="M14"><mml:mtable class="eqnarray" columnalign="left"><mml:mtr><mml:mtd><mml:mtext>Precision</mml:mtext><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>&#x0002B;</mml:mo><mml:mi>F</mml:mi><mml:mi>P</mml:mi></mml:mrow></mml:mfrac></mml:mtd></mml:mtr></mml:mtable></mml:math></disp-formula>
<disp-formula id="E13"><label>(13)</label><mml:math id="M15"><mml:mtable class="eqnarray" columnalign="left"><mml:mtr><mml:mtd><mml:mtext>Recall&#x000A0;Rate</mml:mtext><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>&#x0002B;</mml:mo><mml:mi>F</mml:mi><mml:mi>N</mml:mi></mml:mrow></mml:mfrac></mml:mtd></mml:mtr></mml:mtable></mml:math></disp-formula>
<disp-formula id="E14"><label>(14)</label><mml:math id="M16"><mml:mtable class="eqnarray" columnalign="left"><mml:mtr><mml:mtd><mml:mi>F</mml:mi><mml:mn>1</mml:mn><mml:mo>-</mml:mo><mml:mi>s</mml:mi><mml:mi>c</mml:mi><mml:mi>o</mml:mi><mml:mi>r</mml:mi><mml:mi>e</mml:mi><mml:mo>=</mml:mo><mml:mfrac><mml:mrow><mml:mn>2</mml:mn><mml:mi>T</mml:mi><mml:mi>P</mml:mi></mml:mrow><mml:mrow><mml:mn>2</mml:mn><mml:mi>T</mml:mi><mml:mi>P</mml:mi><mml:mo>&#x0002B;</mml:mo><mml:mi>F</mml:mi><mml:mi>P</mml:mi><mml:mo>&#x0002B;</mml:mo><mml:mi>F</mml:mi><mml:mi>N</mml:mi></mml:mrow></mml:mfrac></mml:mtd></mml:mtr></mml:mtable></mml:math></disp-formula>
<p><xref ref-type="table" rid="T2">Table 2</xref> is the classification scores for AD and CTRL on Pitt Dementiabank datasets, including handcrafted features extracted methods and deep learning methods. As far as we know, SOTA on Pitt corpus is the study of Roshanzamir et al. (<xref ref-type="bibr" rid="B48">48</xref>) in 2021, and our method in this paper performs better than SOTA. Also, transformer&#x0002B;FP<sup>25</sup> is the feature project method for text classification, and we did the experiment with this method on our Pitt datasets; the performance of our method is better than the project method with the same datasets. To further compare with some proposed popular pretrained models in recent years, including Bert (<xref ref-type="bibr" rid="B37">37</xref>), ERNIE (<xref ref-type="bibr" rid="B38">38</xref>), RCNN (<xref ref-type="bibr" rid="B31">31</xref>), and DPCNN (<xref ref-type="bibr" rid="B32">32</xref>), we do the comparative experiments with the combination models, including BertRCNN, BertDPCNN, BertLogistic, and ERNIEDPCNN models, which are the combination of Bert &#x0002B; CNN, Bert &#x0002B; RCNN, Bert &#x0002B; DPCNN, Bert &#x0002B; Logistic Regression, and ERNIE &#x0002B; DPCNN, respectively. The former is the feature extractor and the latter is the classifier. The evaluation index is shown in <xref ref-type="table" rid="T3">Table 3</xref>.</p>
<table-wrap position="float" id="T2">
<label>Table 2</label>
<caption><p>AD vs. CTRL classification scores on Pitt datasets.</p></caption>
<table frame="hsides" rules="groups">
<thead>
<tr>
<th valign="top" align="left"><bold>Method</bold></th>
<th valign="top" align="left"><bold>Embedding</bold></th>
<th valign="top" align="left"><bold>Classifier</bold></th>
<th valign="top" align="center"><bold>Precision</bold></th>
<th valign="top" align="center"><bold>Recall</bold></th>
<th valign="top" align="center"><bold>Accuracy</bold></th>
<th valign="top" align="center"><bold>F1</bold></th>
</tr>
</thead>
<tbody>
<tr>
<td valign="top" align="left">Sweta Karlekar (<xref ref-type="bibr" rid="B23">23</xref>)</td>
<td valign="top" align="left">POS</td>
<td valign="top" align="left">CNN-RNN</td>
<td valign="top" align="center">-</td>
<td valign="top" align="center">-</td>
<td valign="top" align="center">91.1</td>
<td valign="top" align="center">-</td>
</tr>
<tr>
<td valign="top" align="left">Fritsch et al. (<xref ref-type="bibr" rid="B29">29</xref>)</td>
<td valign="top" align="left">n-gram</td>
<td valign="top" align="left">NNLM&#x0002B;LSTM</td>
<td valign="top" align="center">-</td>
<td valign="top" align="center">-</td>
<td valign="top" align="center">85.6</td>
<td valign="top" align="center">-</td>
</tr>
<tr>
<td valign="top" align="left">Orimaye et al. (<xref ref-type="bibr" rid="B41">41</xref>)</td>
<td valign="top" align="left">n-grams</td>
<td valign="top" align="left">D2NN</td>
<td valign="top" align="center">-</td>
<td valign="top" align="center">-</td>
<td valign="top" align="center">88.9</td>
<td valign="top" align="center">-</td>
</tr>
<tr>
<td valign="top" align="left">Fraser et al. (<xref ref-type="bibr" rid="B43">43</xref>)</td>
<td valign="top" align="left">35 Hand-Crafted<break/> Feature</td>
<td valign="top" align="left">LR</td>
<td valign="top" align="center">-</td>
<td valign="top" align="center">-</td>
<td valign="top" align="center">81.92</td>
<td valign="top" align="center">-</td>
</tr>
<tr>
<td valign="top" align="left">Yancheva et al. (<xref ref-type="bibr" rid="B45">45</xref>)</td>
<td valign="top" align="left">12 Cluster-Based Features&#x0002B;LS&#x00026;A</td>
<td valign="top" align="left">Random Forest</td>
<td valign="top" align="center">80.00</td>
<td valign="top" align="center">80.00</td>
<td valign="top" align="center">80.00</td>
<td valign="top" align="center">80.00</td>
</tr>
<tr>
<td valign="top" align="left">Sirts et al. (<xref ref-type="bibr" rid="B46">46</xref>)</td>
<td valign="top" align="left">Cluster&#x0002B;PID&#x0002B;SID<break/> Features</td>
<td valign="top" align="left">LR</td>
<td valign="top" align="center">74.4<break/> &#x000B1; 1.5</td>
<td valign="top" align="center">72.5<break/> &#x000B1; 1.2</td>
<td valign="top" align="center">-</td>
<td valign="top" align="center">72.7<break/> &#x000B1; 1.2</td>
</tr>
<tr>
<td valign="top" align="left">Hernandez et al. (<xref ref-type="bibr" rid="B47">47</xref>)</td>
<td valign="top" align="left">105 Hand-Crafted<break/> Features</td>
<td valign="top" align="left">SVM</td>
<td valign="top" align="center">81.00</td>
<td valign="top" align="center">81.00</td>
<td valign="top" align="center">79.00</td>
<td valign="top" align="center">81.00</td>
</tr>
<tr>
<td valign="top" align="left">Roshanzamir et al. (<xref ref-type="bibr" rid="B48">48</xref>)</td>
<td valign="top" align="left">BERT <sub>Base</sub><break/> (Sentence Level)</td>
<td valign="top" align="left">LR</td>
<td valign="top" align="center">90.31<break/> &#x000B1; 7.36</td>
<td valign="top" align="center">76.52<break/> &#x000B1; 8.06</td>
<td valign="top" align="center">84.46<break/> &#x000B1; 6.31</td>
<td valign="top" align="center">82.72<break/> &#x000B1; 7.21</td>
</tr>
<tr>
<td valign="top" align="left">Roshanzamir et al. (<xref ref-type="bibr" rid="B48">48</xref>)</td>
<td valign="top" align="left">Bert <sub>Large</sub></td>
<td valign="top" align="left">LR</td>
<td valign="top" align="center">90.57<break/> &#x000B1; 3.18</td>
<td valign="top" align="center">84.34<break/> &#x000B1; 7.58</td>
<td valign="top" align="center">88.08<break/> &#x000B1; 4.48</td>
<td valign="top" align="center">87.23<break/> &#x000B1; 5.20</td>
</tr>
<tr>
<td valign="top" align="left">Pan et al. (<xref ref-type="bibr" rid="B49">49</xref>)</td>
<td valign="top" align="left">GloVe Word Embedding Sequence</td>
<td valign="top" align="left">BiLSTM|GRU<break/> Hierarchical Attention</td>
<td valign="top" align="center">84.02</td>
<td valign="top" align="center">84.97</td>
<td valign="top" align="center">-</td>
<td valign="top" align="center">84.43</td>
</tr>
<tr>
<td valign="top" align="left">Li et al. (<xref ref-type="bibr" rid="B50">50</xref>)</td>
<td valign="top" align="left">185Hand-Craft Features</td>
<td valign="top" align="left">LR</td>
<td valign="top" align="center">-</td>
<td valign="top" align="center">-</td>
<td valign="top" align="center">77</td>
<td valign="top" align="center">-</td>
</tr>
<tr>
<td valign="top" align="left">Fraser et al. (<xref ref-type="bibr" rid="B51">51</xref>)</td>
<td valign="top" align="left">Info and LM<break/> Features</td>
<td valign="top" align="left">SVM</td>
<td valign="top" align="center">-</td>
<td valign="top" align="center">-</td>
<td valign="top" align="center">75</td>
<td valign="top" align="center">77</td>
</tr>
<tr>
<td valign="top" align="left">Transformer&#x0002B;FP<sup>25</sup></td>
<td valign="top" align="left">Transformer<break/> &#x0002B;Feature projection</td>
<td valign="top" align="left">Transformer</td>
<td valign="top" align="center">88</td>
<td valign="top" align="center"><bold>91</bold></td>
<td valign="top" align="center">90.3</td>
<td valign="top" align="center">90.6</td>
</tr>
<tr>
<td valign="top" align="left">Transformer&#x0002B;GP</td>
<td valign="top" align="left">Transformer&#x0002B;Feature purification</td>
<td valign="top" align="left">Transformer</td>
<td valign="top" align="center"><bold>94</bold></td>
<td valign="top" align="center">89</td>
<td valign="top" align="center"><bold>93.5</bold></td>
<td valign="top" align="center"><bold>91.19</bold></td>
</tr>
</tbody>
</table>
<table-wrap-foot>
<p><italic>The study marked with bold is the best performances on Pitt dataset</italic>.</p>
</table-wrap-foot>
</table-wrap>
<table-wrap position="float" id="T3">
<label>Table 3</label>
<caption><p>The result of pre-trained models on Pitt dataset.</p></caption>
<table frame="hsides" rules="groups">
<thead>
<tr>
<th valign="top" align="left"><bold>Model</bold></th>
<th valign="top" align="left"><bold>Embedding</bold></th>
<th valign="top" align="left"><bold>Classifier</bold></th>
<th valign="top" align="center"><bold>Precision</bold></th>
<th valign="top" align="center"><bold>Recall</bold></th>
<th valign="top" align="center"><bold>Accuracy</bold></th>
<th valign="top" align="center"><bold>F1</bold></th>
</tr>
</thead>
<tbody>
<tr>
<td valign="top" align="left">BertCNN</td>
<td valign="top" align="left">Bert</td>
<td valign="top" align="left">CNN</td>
<td valign="top" align="center">58.85</td>
<td valign="top" align="center">56.25</td>
<td valign="top" align="center">56.25</td>
<td valign="top" align="center">52.79</td>
</tr>
<tr>
<td valign="top" align="left">BertRCNN</td>
<td valign="top" align="left">Bert</td>
<td valign="top" align="left">RCNN</td>
<td valign="top" align="center">-</td>
<td valign="top" align="center">50.00</td>
<td valign="top" align="center">50.00</td>
<td valign="top" align="center">33.33</td>
</tr>
<tr>
<td valign="top" align="left">BertDPCNN</td>
<td valign="top" align="left">Bert</td>
<td valign="top" align="left">DPCNN</td>
<td valign="top" align="center">41.11</td>
<td valign="top" align="center">47.92</td>
<td valign="top" align="center">47.92</td>
<td valign="top" align="center">35.59</td>
</tr>
<tr>
<td valign="top" align="left">ERNIEDPCNN</td>
<td valign="top" align="left">ERNIE</td>
<td valign="top" align="left">DPCNN</td>
<td valign="top" align="center">-</td>
<td valign="top" align="center">50.00</td>
<td valign="top" align="center">50.00</td>
<td valign="top" align="center">33.33</td>
</tr>
<tr>
<td valign="top" align="left">BertLogistic</td>
<td valign="top" align="left">Bert</td>
<td valign="top" align="left">Logistic Regression</td>
<td valign="top" align="center">88</td>
<td valign="top" align="center">85</td>
<td valign="top" align="center">86.20</td>
<td valign="top" align="center">85.60</td>
</tr>
<tr>
<td valign="top" align="left">Transformer&#x0002B;GP</td>
<td valign="top" align="left">Transformer</td>
<td valign="top" align="left">Transformer</td>
<td valign="top" align="center">94.00</td>
<td valign="top" align="center">89.00</td>
<td valign="top" align="center">93.50</td>
<td valign="top" align="center">91.19</td>
</tr>
</tbody>
</table>
</table-wrap>
<p>From <xref ref-type="table" rid="T3">Table 3</xref>, we can find that the performance of first four models is not better, with an accuracy of only 50% or so, BertLogistic model has a better accuracy of 86.2%, and our method gets the best result than these pretrained models. In the meanwhile, to prove the superior of our method, we also test the method on ADReSS and iFLY datasets. The result is shown in <xref ref-type="table" rid="T4">Table 4</xref>, accuracy is improved by 2.1, 4.3, and 2.1%, respectively, on Pitt, ADReSS, and iFLY dataset, which means that the purified features are more discriminative than the features extracted by transformer encoder. Though we do not get SOTA accuracy on ADReSS and iFLY dataset, the performance of our method is improved than transformer.</p>
<table-wrap position="float" id="T4">
<label>Table 4</label>
<caption><p>Accuracy on three datasets.</p></caption>
<table frame="hsides" rules="groups">
<thead>
<tr>
<th valign="top" align="left"><bold>Model</bold></th>
<th valign="top" align="center"><bold>Pitt</bold></th>
<th valign="top" align="center"><bold>ADReSS</bold></th>
<th valign="top" align="center"><bold>iFLY</bold></th>
</tr>
</thead>
<tbody>
<tr>
<td valign="top" align="left">Transformer</td>
<td valign="top" align="center">91.4</td>
<td valign="top" align="center">74.3</td>
<td valign="top" align="center">81.6</td>
</tr>
<tr>
<td valign="top" align="left">Transformer&#x0002B;GP</td>
<td valign="top" align="center">93.5</td>
<td valign="top" align="center">78.6</td>
<td valign="top" align="center">83.7</td>
</tr>
</tbody>
</table>
</table-wrap></sec></sec>
<sec sec-type="discussion" id="s5">
<title>Discussion</title>
<p>Why the performance is better after purification? We know that transformer is superior to RNN, CNN on its long-distance reasoning ability, but it is not easy to understand the deep semantic feature vector extracted by transformer as deep learning is a &#x0201C;black-box.&#x0201D; The common features in the study are the vector that cannot differentiate for classification in semantic space. They may be the words or sentences that are unimportant, unmeaningful, and irrelevant that may disturb the final classification. Our original dataset is a dialogue of description. It should include some important people, scenes, and ongoing events in the picture. The study (<xref ref-type="bibr" rid="B52">52</xref>) pointed out the seed words of the picture should include the following 23 words: boy, girl, woman, cookie, stool, sink, overflow, fall, window, curtain, plate, cloth, jar, water, cupboard, dish, kitchen, garden, take, wash, reach, attention, and see. The sentences including these words are helpful for the classification. Other unrelated words or sentences such as &#x0201C;Can you tell me&#x0201D;, &#x0201C;look, there is no people outside&#x0201D; which are unhelpful words or sentences that cannot distinguish cognitive condition. They are, which we think maybe the common features, unhelpful and may even disturb the final classification. When we rule out these words or sentences (i.e., common features) that disturb the classification, the result can be improved correspondingly. The features extracted manually in this area usually include part-of-speech (POS), fluency, semantic feature, lexical richness, and so on. Now, there is an opinion that the features that deep learning extracted automatically maybe are much like the features that people extract manually, and deleting those unhelpful words for the classification can improve the classification performance.</p>
<p>We know that in transformer model, complexity per layer of self-attention is O(n<sup>2</sup> <sup>&#x0002A;</sup> d), where d is the representation dimension, and n is the sequence length. Our model includes two sections, one is transformer encoder, the other is feature purification layer which just multiply (-&#x003BB;) when running back propagation. Both of them can run concurrently and have the same complexity, so the computational complexity of our model is the same as that of self-attention.</p></sec>
<sec sec-type="conclusions" id="s6">
<title>Conclusions</title>
<p>Nowadays, many medical problems used artificial intelligence method to solve (<xref ref-type="bibr" rid="B53">53</xref>, <xref ref-type="bibr" rid="B54">54</xref>). which is low cost and convenient. Two methods, that is, feature extraction manually and automatically by deep learning, are usually used to recognize disease. Features extracted method manually based on machine learning does not generalize well, as it needs many special knowledge and annotation to extract features. Due to high cost of manual annotation, it is not feasible to procure numbers of annotated datasets for most clinical tasks. But deep learning does not need any annotation and can finish the process automatically. This paper combines transformer-based model with a feature purification network to improve the classification performance to a large extent. We pretrain transformer and then fine-tune the model on new datasets to transfer learned knowledge to our text classification task. Our work is obviously different from the former studies in AD recognition because none of the former studies improve representation learning of deep learning in this area, as far as we know. The common features extracted by GRL maybe the words that shared by different classifications, or nonimportant words that have small role for classification, ruling out them from traditional representation vector can improve the performance of the model. In addition, we can develop WeChat procedure or APP in mobile device further in order that the elderly can test their cognitive condition at home. So, large volumes of patient&#x00027;s datasets need to be transferred to central cloud server for data analysis, the safety of which is important, and blockchain technology is a better choice which may ensure the security of medical data (<xref ref-type="bibr" rid="B53">53</xref>, <xref ref-type="bibr" rid="B55">55</xref>).</p>
<p>Transformer model is still the most widely used deep learning algorithm, but the time complexity of self-attention is higher, which hinders the development of the model, so the improvement of model efficiency is of great importance in the future. Transformer, as the feature extractor we used in this study, can also be replaced by other deep learning algorithms such as Bert, RNN, CNN, and so on; next, we will perfect the work further. In the meanwhile, we also believe that our feature purification method may predict other diseases that language and cognitive impairment related, such as Parkinson&#x00027;s disease, Aphasia, and Autism spectrum disorder. Aphasia is maybe more pronounced as Aphasia is a disease of the brain tissue associated with language function. Our method provides a feasible solution for detecting patients with AD at the doorsteps. Feature purification method for deep learning, as far as we think, is a promising direction to explore in the future.</p></sec>
<sec sec-type="data-availability" id="s7">
<title>Data Availability Statement</title>
<p>The public datasets we used can get from the website: <ext-link ext-link-type="uri" xlink:href="https://sla.talkbank.org/TBB/dementia/English/Pitt">https://sla.talkbank.org/TBB/dementia/English/Pitt</ext-link>, or visit our github website: <ext-link ext-link-type="uri" xlink:href="https://github.com/lzy1012/Public-Pitt-Dementiabank-Dataset">https://github.com/lzy1012/Public-Pitt-Dementiabank-Dataset</ext-link>.</p></sec>
<sec id="s8">
<title>Author Contributions</title>
<p>ZY designed the research. QT analyzed the data and interpreted the analysis. NL and ZY wrote the main manuscript text and revised carefully. All authors reviewed and approved the final manuscript.</p></sec>
<sec sec-type="funding-information" id="s9">
<title>Funding</title>
<p>This research was funded by grants of Natural Science Foundation of Zhejiang Province (LGF20F020009), Anhui Provincial Natural Science Foundation (No. 2108085QF269), and the 4th Graduate Student Innovation and Entrepreneurship Competition of Hangzhou Normal University.</p></sec>
<sec sec-type="COI-statement" id="conf1">
<title>Conflict of Interest</title>
<p>The authors declare that the research was conducted in the absence of any commercial or financial relationships that could be construed as a potential conflict of interest.</p></sec>
<sec sec-type="disclaimer" id="s10">
<title>Publisher&#x00027;s Note</title>
<p>All claims expressed in this article are solely those of the authors and do not necessarily represent those of their affiliated organizations, or those of the publisher, the editors and the reviewers. Any product that may be evaluated in this article, or claim that may be made by its manufacturer, is not guaranteed or endorsed by the publisher.</p></sec>
</body>
<back>
<ref-list>
<title>References</title>
<ref id="B1">
<label>1.</label>
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Sousa</surname> <given-names>RM</given-names></name> <name><surname>Ferri</surname> <given-names>CP</given-names></name> <name><surname>Acosta</surname> <given-names>D</given-names></name> <name><surname>Albanese</surname> <given-names>E</given-names></name> <name><surname>Guerra</surname> <given-names>M</given-names></name> <name><surname>Huang</surname> <given-names>YQ</given-names></name> <etal/></person-group>. <article-title>Contribution of chronic diseases to disability in elderly people in countries with low and middle incomes: a 10/66 dementia research group population-based survey</article-title>. <source>Lancet</source>. (<year>2009</year>) <volume>374</volume>:<fpage>1821</fpage>&#x02013;<lpage>30</lpage>. <pub-id pub-id-type="doi">10.1016/S0140-6736(09)61829-8</pub-id><pub-id pub-id-type="pmid">19944863</pub-id></citation></ref>
<ref id="B2">
<label>2.</label>
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Zhou</surname> <given-names>Y</given-names></name> <name><surname>Lu</surname> <given-names>Y</given-names></name> <name><surname>Pei</surname> <given-names>Z</given-names></name></person-group>. <article-title>Intelligent diagnosis of Alzheimer&#x00027;s disease based on internet of things monitoring system and deep learning classification method</article-title>. <source>Microprocess Microsyst</source>. (<year>2021</year>) <volume>83</volume>:<fpage>104007</fpage>. <pub-id pub-id-type="doi">10.1016/j.micpro.2021.104007</pub-id></citation></ref>
<ref id="B3">
<label>3.</label>
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Sabat</surname> <given-names>SR</given-names></name></person-group>. <article-title>Language function in Alzheimer&#x00027;s disease: a critical review of selected literature</article-title>. <source>Lang Commun</source>. (<year>1994</year>) <volume>14</volume>:<fpage>331</fpage>&#x02013;<lpage>51</lpage>. <pub-id pub-id-type="doi">10.1016/0271-5309(94)90025-6</pub-id></citation></ref>
<ref id="B4">
<label>4.</label>
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Bartha</surname> <given-names>L</given-names></name> <name><surname>Benke</surname> <given-names>H</given-names></name></person-group>. <article-title>Acute conduction aphasia: an analysis of 20 cases</article-title>. <source>Brain Lang</source>. (<year>2003</year>) <volume>85</volume>:<fpage>93</fpage>&#x02013;<lpage>108</lpage>. <pub-id pub-id-type="doi">10.1016/S0093-934X(02)00502-3</pub-id><pub-id pub-id-type="pmid">12681350</pub-id></citation></ref>
<ref id="B5">
<label>5.</label>
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Appell</surname> <given-names>J</given-names></name> <name><surname>Kertesz</surname> <given-names>A</given-names></name> <name><surname>Fisman</surname> <given-names>M</given-names></name></person-group>. <article-title>A study of language functioning in Alzheimer patients</article-title>. <source>Brain Lang</source>. (<year>1982</year>) <volume>17</volume>:<fpage>73</fpage>&#x02013;<lpage>91</lpage>. <pub-id pub-id-type="doi">10.1016/0093-934X(82)90006-2</pub-id><pub-id pub-id-type="pmid">7139272</pub-id></citation></ref>
<ref id="B6">
<label>6.</label>
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Corkin S</surname> <given-names>DK</given-names></name> <name><surname>Growdon</surname> <given-names>J</given-names></name> <name><surname>Usdin</surname> <given-names>E</given-names></name> <name><surname>Wurtman</surname> <given-names>R</given-names></name></person-group>. <source>Some Relationships Between Global Amnesias and the Memory Impairments in Alzheimer&#x00027;s Disease</source>. Raven Press (<year>1982</year>). p. <fpage>149</fpage>&#x02013;<lpage>64</lpage>.</citation></ref>
<ref id="B7">
<label>7.</label>
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Wechsler</surname> <given-names>AF</given-names></name> <name><surname>Verity</surname> <given-names>MA</given-names></name> <name><surname>Rosenschein</surname> <given-names>S</given-names></name> <name><surname>Fried</surname> <given-names>I</given-names></name> <name><surname>Scheibel</surname> <given-names>AB</given-names></name></person-group>. <article-title>Pick&#x00027;s disease. A clinical, computed tomographic, and histologic study with Golgi impregnation observations</article-title>. <source>JAMA Neurology</source>. (<year>1982</year>) <volume>39</volume>:<fpage>287</fpage>&#x02013;<lpage>90</lpage>. <pub-id pub-id-type="doi">10.1001/archneur.1982.00510170029008</pub-id><pub-id pub-id-type="pmid">7073547</pub-id></citation></ref>
<ref id="B8">
<label>8.</label>
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Goodglass</surname> <given-names>H</given-names></name> <name><surname>Kaplan</surname> <given-names>E</given-names></name> <name><surname>Barresi</surname> <given-names>B</given-names></name></person-group>. <source>Boston Diagnostic Aphasia Examination Record Booklet</source>. Lipppincott Williams and Wilkins (<year>2001</year>).</citation></ref>
<ref id="B9">
<label>9.</label>
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Taler</surname> <given-names>V</given-names></name> <name><surname>Phillips</surname> <given-names>NA</given-names></name></person-group>. <article-title>Language performance in Alzheimer&#x00027;s disease and mild cognitive impairment: a comparative review</article-title>. <source>J Clin Exp Neuropsychol</source>. (<year>2008</year>) <volume>30</volume>:<fpage>501</fpage>&#x02013;<lpage>56</lpage>. <pub-id pub-id-type="doi">10.1080/13803390701550128</pub-id><pub-id pub-id-type="pmid">18569251</pub-id></citation></ref>
<ref id="B10">
<label>10.</label>
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Yin</surname> <given-names>W</given-names></name> <name><surname>Kann</surname> <given-names>K</given-names></name> <name><surname>Yu</surname> <given-names>M</given-names></name> <name><surname>Hinrich</surname> <given-names>S</given-names></name></person-group>. <source>Comparative Study of CNN and RNN for Natural Language Processing. arXiv [Preprint] arXiv</source>:1702.01923 (<year>2017</year>).</citation></ref>
<ref id="B11">
<label>11.</label>
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Scherer</surname> <given-names>D</given-names></name> <name><surname>Muller</surname> <given-names>A</given-names></name> <name><surname>Behnke</surname> <given-names>S</given-names></name></person-group>. <article-title>Evaluation of pooling operations in convolutional architectures for object recognition</article-title>. <source>ICANN</source>. (<year>2010</year>) <volume>19</volume>(<supplement>Suppl 8</supplement>):<fpage>92</fpage>&#x02013;<lpage>101</lpage>. <pub-id pub-id-type="doi">10.1007/978-3-642-15825-4_10</pub-id></citation></ref>
<ref id="B12">
<label>12.</label>
<citation citation-type="book"><person-group person-group-type="author"><name><surname>Ganin</surname> <given-names>Y</given-names></name> <name><surname>Lempitsky</surname> <given-names>V</given-names></name></person-group>. <article-title>Unsupervised domain adaptation by back propagation</article-title>. In: <source>International Conference on Machine Learning</source>. <publisher-loc>Florida, FL</publisher-loc>: <publisher-name>PMLR</publisher-name> (<year>2015</year>). p. <fpage>1180</fpage>&#x02013;<lpage>9</lpage>.</citation></ref>
<ref id="B13">
<label>13.</label>
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Liu</surname> <given-names>P</given-names></name> <name><surname>Qiu</surname> <given-names>X</given-names></name> <name><surname>Huang</surname> <given-names>X</given-names></name></person-group>. <article-title>Adversarial multi-task learning for text classification</article-title>. <source>arXiv [Preprint]</source>. (<year>2017</year>). arXiv:1704.05742. <pub-id pub-id-type="doi">10.18653/v1/p17-1001</pub-id></citation></ref>
<ref id="B14">
<label>14.</label>
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Belinkov</surname> <given-names>Y</given-names></name> <name><surname>Poliak</surname> <given-names>A</given-names></name> <name><surname>Shieber</surname> <given-names>SM</given-names></name> <name><surname>Durme</surname> <given-names>BV</given-names></name> <name><surname>Alexander</surname> <given-names>MR</given-names></name></person-group>. <article-title>On adversarial removal of hypothesis-only bias in natural language inference</article-title>. <source>arXiv [Preprint] arXiv</source>:1907.04389 (<year>2019</year>). <pub-id pub-id-type="doi">10.18653/v1/S19-1028</pub-id></citation></ref>
<ref id="B15">
<label>15.</label>
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Qin</surname> <given-names>L</given-names></name> <name><surname>Xu</surname> <given-names>X</given-names></name> <name><surname>Che</surname> <given-names>W</given-names></name> <name><surname>Zhang</surname> <given-names>Y</given-names></name> <name><surname>Liu</surname> <given-names>T</given-names></name></person-group>. <article-title>Dynamic fusion network for multi-domain end-to-end task-oriented dialog</article-title>. In: <source>Proceedings of the 58th Annual Meeting of the Association for Computational Linguistics</source> (<year>2020</year>). <pub-id pub-id-type="doi">10.18653/v1/2020.acl-main.565</pub-id></citation></ref>
<ref id="B16">
<label>16.</label>
<citation citation-type="book"><person-group person-group-type="author"><name><surname>Zhang</surname> <given-names>K</given-names></name> <name><surname>Zhang</surname> <given-names>H</given-names></name> <name><surname>Liu</surname> <given-names>Q</given-names></name> <name><surname>Zhu</surname> <given-names>HS</given-names></name> <name><surname>Chen</surname> <given-names>E</given-names></name></person-group>. <article-title>Interactive attention transfer network for cross-domain sentiment classification</article-title>. In: <source>Proceedings of the AAAI Conference on Artificial Intelligence</source>. <publisher-loc>Hawaii, HI</publisher-loc> (<year>2019</year>). <pub-id pub-id-type="doi">10.1609/aaai.v33i01.33015773</pub-id></citation></ref>
<ref id="B17">
<label>17.</label>
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Qin</surname> <given-names>Q</given-names></name> <name><surname>Hu</surname> <given-names>W</given-names></name> <name><surname>Liu</surname> <given-names>B</given-names></name></person-group>. <article-title>Feature projection for improved text classification</article-title>. In: <source>Proceedings of the 58th Annual Meeting of the Association for Computational Linguistics</source> (<year>2020</year>). <pub-id pub-id-type="doi">10.18653/v1/2020.acl-main.726</pub-id></citation></ref>
<ref id="B18">
<label>18.</label>
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Ganin</surname> <given-names>Y</given-names></name> <name><surname>Ustinova</surname> <given-names>E</given-names></name> <name><surname>Ajakan</surname> <given-names>H</given-names></name> <name><surname>Germain</surname> <given-names>P</given-names></name> <name><surname>Larochelle</surname> <given-names>H</given-names></name> <name><surname>Laviolette</surname> <given-names>F</given-names></name></person-group>. <article-title>Domain-adversarial training of neural networks</article-title>. <source>J Mach Learn Res</source>. (<year>2016</year>) <volume>17</volume>:<fpage>2096</fpage>&#x02013;<lpage>30</lpage>. <pub-id pub-id-type="doi">10.1007/978-3-319-58347-1_10</pub-id></citation></ref>
<ref id="B19">
<label>19.</label>
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Beltrami</surname> <given-names>D</given-names></name> <name><surname>Gagliardi</surname> <given-names>G</given-names></name> <name><surname>Rossini Favretti</surname> <given-names>R</given-names></name> <name><surname>Ghidoni</surname> <given-names>E</given-names></name> <name><surname>Tamburini</surname> <given-names>F</given-names></name> <name><surname>Calz&#x000E0;</surname> <given-names>L</given-names></name></person-group>. <article-title>Speech analysis by natural language processing techniques: a possible tool for very early detection of cognitive decline?</article-title> <source>Front Aging Neurosci</source>. (<year>2018</year>) <volume>10</volume>:<fpage>369</fpage>. <pub-id pub-id-type="doi">10.3389/fnagi.2018.00369</pub-id><pub-id pub-id-type="pmid">30483116</pub-id></citation></ref>
<ref id="B20">
<label>20.</label>
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Fraser</surname> <given-names>KC</given-names></name> <name><surname>Meltzer</surname> <given-names>JA</given-names></name> <name><surname>Rudzicz</surname> <given-names>F</given-names></name></person-group>. <article-title>Linguistic features identify Alzheimer&#x00027;s disease in narrative speech</article-title>. <source>J Alzheimers Dis</source>. (<year>2015</year>) <volume>49</volume>:<fpage>407</fpage>&#x02013;<lpage>22</lpage>. <pub-id pub-id-type="doi">10.3233/JAD-150520</pub-id><pub-id pub-id-type="pmid">26484921</pub-id></citation></ref>
<ref id="B21">
<label>21.</label>
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Gosztolya</surname> <given-names>G</given-names></name> <name><surname>Vincze</surname> <given-names>V</given-names></name> <name><surname>T&#x000F3;th</surname> <given-names>L</given-names></name> <name><surname>P&#x000E1;k&#x000E1;ski</surname> <given-names>M</given-names></name> <name><surname>Hoffmann</surname> <given-names>I</given-names></name></person-group>. <article-title>Identifying mild cognitive impairment and mild Alzheimer&#x00027;s disease based on spontaneous speech using ASR and linguistic features</article-title>. <source>Comput Speech Lang</source>. (<year>2018</year>) <volume>53</volume>:<fpage>181</fpage>&#x02013;<lpage>97</lpage>. <pub-id pub-id-type="doi">10.1016/j.csl.2018.07.007</pub-id></citation></ref>
<ref id="B22">
<label>22.</label>
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Fraser</surname> <given-names>KC</given-names></name> <name><surname>Fors</surname> <given-names>KL</given-names></name> <name><surname>Kokkinakis</surname> <given-names>D</given-names></name></person-group>. <article-title>Multilingual word embeddings for the assessment of narrative speech in mild cognitive impairment</article-title>. <source>Comput Speech Lang</source>. (<year>2018</year>) <volume>53</volume>:<fpage>121</fpage>&#x02013;<lpage>39</lpage>. <pub-id pub-id-type="doi">10.1016/j.csl.2018.07.005</pub-id></citation></ref>
<ref id="B23">
<label>23.</label>
<citation citation-type="book"><person-group person-group-type="author"><name><surname>Karlekar</surname> <given-names>S</given-names></name> <name><surname>Niu</surname> <given-names>T</given-names></name> <name><surname>Bansal</surname> <given-names>M</given-names></name></person-group>. <article-title>Detecting linguistic characteristics of Alzheimer&#x00027;s dementia by interpreting neural models</article-title>. In: <source>Proceedings of the 2018 Conference of the North American Chapter of the Association for Computational Linguistics: Human Language Technologies, Volume 2 (Short Papers)</source>. <publisher-loc>New Orleans, Louisiana</publisher-loc> (<year>2018</year>). p. <fpage>701</fpage>&#x02013;<lpage>7</lpage>.</citation></ref>
<ref id="B24">
<label>24.</label>
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>L&#x000F3;pez-De-Ipi&#x000F1;a</surname> <given-names>K</given-names></name> <name><surname>Alonso</surname> <given-names>JB</given-names></name> <name><surname>Sol&#x000E9;-Casals</surname> <given-names>J</given-names></name> <name><surname>Barroso</surname> <given-names>N</given-names></name> <name><surname>Henriquez</surname> <given-names>P</given-names></name> <name><surname>Faundez-Zanuy</surname> <given-names>M</given-names></name></person-group>. <article-title>On automatic diagnosis of Alzheimer&#x00027;s disease based on spontaneous speech analysis and emotional temperature</article-title>. <source>Cognitive Computation</source>. (<year>2015</year>) <volume>7</volume>:<fpage>44</fpage>&#x02013;<lpage>55</lpage>. <pub-id pub-id-type="doi">10.1007/s12559-013-9229-9</pub-id><pub-id pub-id-type="pmid">23698268</pub-id></citation></ref>
<ref id="B25">
<label>25.</label>
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Orimaye</surname> <given-names>SO</given-names></name> <name><surname>Wong</surname> <given-names>SM</given-names></name> <name><surname>Wong</surname> <given-names>CP</given-names></name></person-group>. <article-title>Correction: deep language space neural network for classifying mild cognitive impairment and Alzheimer-type dementia</article-title>. <source>Plos ONE</source>. (<year>2019</year>) <volume>14</volume>:<fpage>e0214103</fpage>. <pub-id pub-id-type="doi">10.1371/journal.pone.0214103</pub-id><pub-id pub-id-type="pmid">30870510</pub-id></citation></ref>
<ref id="B26">
<label>26.</label>
<citation citation-type="book"><person-group person-group-type="author"><name><surname>Fritsch</surname> <given-names>J</given-names></name> <name><surname>Wankerl</surname> <given-names>S</given-names></name> <name><surname>N&#x000F6;th</surname> <given-names>E</given-names></name></person-group>. <article-title>Automatic diagnosis of Alzheimer&#x00027;s disease using neural network language models</article-title>. In: <source>ICASSP 2019&#x02013;2019 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP)</source> (<publisher-loc>Brighton</publisher-loc>). (<year>2019</year>).<pub-id pub-id-type="pmid">33019304</pub-id></citation></ref>
<ref id="B27">
<label>27.</label>
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>L&#x000F3;pez-de-Ipi&#x000F1;a</surname> <given-names>K</given-names></name> <name><surname>Martinez-de-Lizarduy</surname> <given-names>U</given-names></name> <name><surname>Calvo</surname> <given-names>PM</given-names></name> <name><surname>Beitia</surname> <given-names>B</given-names></name> <name><surname>Faundez</surname> <given-names>ZM</given-names></name></person-group>. <article-title>Analysis of disfluencies for automatic detection of Mild Cognitive Impartment: a deep learning approach, 2017</article-title>. In: <source>International Conference and Workshop on Bioinspired Intelligence (IWOBI)</source>. (<year>2017</year>). p. <fpage>1</fpage>&#x02013;<lpage>4</lpage>. <pub-id pub-id-type="doi">10.1109/IWOBI.2017.7985526</pub-id></citation></ref>
<ref id="B28">
<label>28.</label>
<citation citation-type="book"><person-group person-group-type="author"><name><surname>Palo</surname> <given-names>FD</given-names></name> <name><surname>Parde</surname> <given-names>N</given-names></name></person-group>. <article-title>Enriching neural models with targeted features for dementia detection</article-title>. In: <source>Proceedings of the 57th Annual Meeting of the Association for Computational Linguistics: Student Research Workshop</source>. <publisher-loc>Florence</publisher-loc> (<year>2019</year>). <pub-id pub-id-type="doi">10.18653/v1/P19-2042</pub-id></citation></ref>
<ref id="B29">
<label>29.</label>
<citation citation-type="book"><person-group person-group-type="author"><name><surname>Fritsch</surname> <given-names>J</given-names></name> <name><surname>Wankerl</surname> <given-names>S</given-names></name> <name><surname>Noth</surname> <given-names>E</given-names></name></person-group>. <article-title>Automatic diagnosis of Alzheimer&#x00027;s disease using neural network language models</article-title>. In: <source>ICASSP 2019-2019 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP)</source> (<publisher-loc>Brighton</publisher-loc>). (<year>2019</year>). p. <fpage>5841</fpage>&#x02013;<lpage>5</lpage>.<pub-id pub-id-type="pmid">33019304</pub-id></citation></ref>
<ref id="B30">
<label>30.</label>
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Peters</surname> <given-names>ME</given-names></name> <name><surname>Neumann</surname> <given-names>M</given-names></name> <name><surname>Iyyer</surname> <given-names>M</given-names></name> <name><surname>Gardner</surname> <given-names>M</given-names></name> <name><surname>Clark</surname> <given-names>C</given-names></name> <name><surname>Lee</surname> <given-names>K</given-names></name></person-group>. <article-title>Deep contextualized word representations</article-title>. <source>arXiv [Preprint] arXiv</source>:1802.05365 (<year>2018</year>).</citation></ref>
<ref id="B31">
<label>31.</label>
<citation citation-type="book"><person-group person-group-type="author"><name><surname>Lai</surname> <given-names>S</given-names></name> <name><surname>Xu</surname> <given-names>L</given-names></name> <name><surname>Liu</surname> <given-names>K</given-names></name> <name><surname>Zhao</surname> <given-names>J</given-names></name></person-group>. <article-title>Recurrent convolutional neural networks for text classification</article-title>. In: <source>Proceedings of the Twenty-Ninth AAAI Conference on Artificial Intelligence</source>. <publisher-loc>Austin, TX</publisher-loc> (<year>2015</year>). p. <fpage>2267</fpage>&#x02013;<lpage>73</lpage><pub-id pub-id-type="pmid">33601013</pub-id></citation></ref>
<ref id="B32">
<label>32.</label>
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Johnson</surname> <given-names>R</given-names></name> <name><surname>Zhang</surname> <given-names>T</given-names></name></person-group>. <article-title>Deep pyramid convolutional neural networks for text categorization</article-title>. In: <source>Proceedings of the 55th Annual Meeting of the Association for Computational Linguistics (Volume 1: Long Papers)</source>. (<year>2017</year>). p. <fpage>562</fpage>&#x02013;<lpage>70</lpage>. <pub-id pub-id-type="doi">10.18653/v1/P17-1052</pub-id><pub-id pub-id-type="pmid">34053009</pub-id></citation></ref>
<ref id="B33">
<label>33.</label>
<citation citation-type="web"><person-group person-group-type="author"><name><surname>Bahdanau</surname> <given-names>D</given-names></name> <name><surname>Cho</surname> <given-names>K</given-names></name> <name><surname>Bengio</surname> <given-names>Y</given-names></name></person-group>. <article-title>Neural machine translation by jointly learning to align and translate</article-title>. <source>arXiv [Preprint]</source>. (<year>2016</year>). arXiv: 1409.0473v7. Available online at: <ext-link ext-link-type="uri" xlink:href="https://arxiv.org/pdf/1409.0473.pdf">https://arxiv.org/pdf/1409.0473.pdf</ext-link> (accessed May 19, 2016).</citation></ref>
<ref id="B34">
<label>34.</label>
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Yang</surname> <given-names>Z</given-names></name> <name><surname>Yang</surname> <given-names>D</given-names></name> <name><surname>Dyer</surname> <given-names>C</given-names></name> <name><surname>He</surname> <given-names>XD</given-names></name> <name><surname>Smola</surname> <given-names>A</given-names></name> <name><surname>Hovy</surname> <given-names>E</given-names></name></person-group>. <article-title>Hierarchical attention networks for document classification</article-title>. In: <source>Proceedings of the 2016 Conference of the North American Chapter of the Association for Computational Linguistics: Human Language Technologies</source>. (<year>2016</year>). p. <fpage>1480</fpage>&#x02013;<lpage>9</lpage>. <pub-id pub-id-type="doi">10.18653/v1/N16-1174</pub-id></citation></ref>
<ref id="B35">
<label>35.</label>
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Lin</surname> <given-names>Z</given-names></name> <name><surname>Feng</surname> <given-names>M</given-names></name> <name><surname>Santos</surname> <given-names>CN</given-names></name> <name><surname>Yu</surname> <given-names>M</given-names></name> <name><surname>Xiang</surname> <given-names>B</given-names></name> <name><surname>Zhou</surname> <given-names>B</given-names></name></person-group>. <article-title>A structured self-attentive sentence embedding</article-title>. <source>arXiv [Preprint] arXiv</source>:1703.03130 (<year>2017</year>).</citation></ref>
<ref id="B36">
<label>36.</label>
<citation citation-type="book"><person-group person-group-type="author"><name><surname>Ma</surname> <given-names>Y</given-names></name> <name><surname>Peng</surname> <given-names>H</given-names></name> <name><surname>Cambria</surname> <given-names>E</given-names></name></person-group>. <article-title>Targeted aspect-based sentiment analysis via embedding commonsense knowledge into an attentive LSTM</article-title>. In: <source>Thirtysecond AAAI conference on artificial intelligence</source>. <publisher-loc>New Orleans, LA</publisher-loc> (<year>2018</year>).</citation></ref>
<ref id="B37">
<label>37.</label>
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Devlin</surname> <given-names>J</given-names></name> <name><surname>Chang</surname> <given-names>MW</given-names></name> <name><surname>Lee</surname> <given-names>K</given-names></name> <name><surname>Toutanova</surname> <given-names>K</given-names></name></person-group>. <article-title>Bert: Pre-training of deep bidirectional transformers for language understanding</article-title>. <source>arXiv [Preprint] arXiv</source>:1810.04805 (<year>2018</year>).</citation></ref>
<ref id="B38">
<label>38.</label>
<citation citation-type="book"><person-group person-group-type="author"><name><surname>Zhang</surname> <given-names>Z</given-names></name> <name><surname>Han</surname> <given-names>X</given-names></name> <name><surname>Liu</surname> <given-names>Z</given-names></name> <name><surname>Jiang</surname> <given-names>X</given-names></name> <name><surname>Sun</surname> <given-names>M</given-names></name> <name><surname>Liu</surname> <given-names>Q</given-names></name></person-group>. <article-title>ERNIE: enhanced language representation with informative entities</article-title>. In: <source>Proceedings of the 57th Annual Meeting of the Association for Computational Linguistics</source>. <publisher-loc>Florence</publisher-loc>. (<year>2019</year>). p. <fpage>1441</fpage>&#x02013;<lpage>51</lpage>.</citation></ref>
<ref id="B39">
<label>39.</label>
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Liu</surname> <given-names>N</given-names></name> <name><surname>Yuan</surname> <given-names>ZM</given-names></name></person-group>. <article-title>Spontaneous language analysis in Alzheimer&#x00027;s disease: evaluation of natural language processing technique for analyzing lexical performance</article-title>. <source>J Shanghai Jiaotong Univ</source>. (<year>2021</year>) <fpage>1</fpage>&#x02013;<lpage>8</lpage>. <pub-id pub-id-type="doi">10.1007/s12204-021-2384-3</pub-id></citation></ref>
<ref id="B40">
<label>40.</label>
<citation citation-type="book"><person-group person-group-type="author"><name><surname>Luz</surname> <given-names>S</given-names></name> <name><surname>Haider</surname> <given-names>F</given-names></name> <name><surname>Fuente</surname> <given-names>S</given-names></name> <name><surname>Fromm</surname> <given-names>D</given-names></name> <name><surname>Macwhinney</surname> <given-names>B</given-names></name></person-group>. <source>Alzheimer&#x00027;s Dementia Recognition through Spontaneous Speech: The ADReSS Challenge</source>. <publisher-loc>Shanghai, China</publisher-loc>: <publisher-name>Interspeech</publisher-name>.2020-2571 (<year>2020</year>). <pub-id pub-id-type="doi">10.21437/Interspeech.2020-2571</pub-id></citation></ref>
<ref id="B41">
<label>41.</label>
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Orimaye</surname> <given-names>SO</given-names></name> <name><surname>Wong</surname> <given-names>SM</given-names></name> <name><surname>Wong</surname> <given-names>CP</given-names></name> <name><surname>Liang</surname> <given-names>P</given-names></name></person-group>. <article-title>Deep language space neural network for classifying mild cognitive impairment and Alzheimer-type dementia</article-title>. <source>PLoS ONE</source>. (<year>2018</year>) <fpage>13</fpage>. <pub-id pub-id-type="doi">10.1371/journal.pone.0205636</pub-id><pub-id pub-id-type="pmid">30870510</pub-id></citation></ref>
<ref id="B42">
<label>42.</label>
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Zhao</surname> <given-names>W</given-names></name> <name><surname>Gao</surname> <given-names>H</given-names></name> <name><surname>Chen</surname> <given-names>S</given-names></name> <name><surname>Wang</surname> <given-names>N</given-names></name></person-group>. <article-title>Generative Multi-Task Learning for Text Classification</article-title>. <source>IEEE Access</source>. (<year>2020</year>) <volume>8</volume>:<fpage>86380</fpage>&#x02013;<lpage>7</lpage>. <pub-id pub-id-type="doi">10.1109/ACCESS.2020.2991337</pub-id></citation></ref>
<ref id="B43">
<label>43.</label>
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Becker</surname> <given-names>JT</given-names></name> <name><surname>Boiler</surname> <given-names>F</given-names></name> <name><surname>Lopez</surname> <given-names>OL</given-names></name> <name><surname>Saxton</surname> <given-names>J</given-names></name> <name><surname>Mcgonigle</surname> <given-names>KL</given-names></name></person-group>. <article-title>The Natural History of Alzheimer&#x00027;s Disease: Description of Study Cohort and Accuracy of Diagnosis</article-title>. <source>Arch Neurol</source>. (<year>1994</year>) <volume>51</volume>:<fpage>585</fpage>&#x02013;<lpage>94</lpage>. <pub-id pub-id-type="doi">10.1001/archneur.1994.00540180063015</pub-id><pub-id pub-id-type="pmid">8198470</pub-id></citation></ref>
<ref id="B44">
<label>44.</label>
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Na</surname> <given-names>KS</given-names></name> <name><surname>Cho</surname> <given-names>SE</given-names></name> <name><surname>Zong</surname> <given-names>WG</given-names></name> <name><surname>Kim</surname> <given-names>YK</given-names></name></person-group>. <article-title>Predicting future onset of depression among community dwelling adults in the Republic of Korea using a machine learning algorithm</article-title>. <source>Neurosci Lett</source>. (<year>2020</year>) <volume>721</volume>:<fpage>134804</fpage>. <pub-id pub-id-type="doi">10.1016/j.neulet.2020.134804</pub-id><pub-id pub-id-type="pmid">32014516</pub-id></citation></ref>
<ref id="B45">
<label>45.</label>
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Yancheva</surname> <given-names>M</given-names></name> <name><surname>Rudzicz</surname> <given-names>F</given-names></name></person-group>. <article-title>Vector-space topic models for detecting Alzheimer&#x00027;s disease</article-title>. In: <source>Proceedings of the 54th Annual Meeting of the Association for Computational Linguistics (Volume 1: Long Papers)</source>. (<year>2016</year>). p. <fpage>2337</fpage>&#x02013;<lpage>46</lpage>. <pub-id pub-id-type="doi">10.18653/v1/P16-1221</pub-id></citation></ref>
<ref id="B46">
<label>46.</label>
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Sirts</surname> <given-names>K</given-names></name> <name><surname>Piguet</surname> <given-names>O</given-names></name> <name><surname>Johnson</surname> <given-names>M</given-names></name></person-group>. <article-title>Idea density for predicting Alzheimer&#x00027;s disease from transcribed speech</article-title>. <source>arXiv [Preprint]</source>. (<year>2017</year>). arXiv:1706.04473v1. <pub-id pub-id-type="doi">10.18653/v1/K17-1033</pub-id></citation></ref>
<ref id="B47">
<label>47.</label>
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Hern&#x000E1;ndez-Dom&#x000ED;nguez</surname> <given-names>L</given-names></name> <name><surname>Ratt&#x000E9;</surname> <given-names>S</given-names></name> <name><surname>Sierra-Mart&#x000ED;nez</surname> <given-names>G</given-names></name> <name><surname>Roche-Berguac</surname> <given-names>A</given-names></name></person-group>. <article-title>Computer-based evaluation of Alzheimer&#x00027;s disease and mild cognitive impairment patients during a picture description task</article-title>. <source>DADM</source>. (<year>2018</year>) <volume>10</volume>:<fpage>260</fpage>&#x02013;<lpage>8</lpage>. <pub-id pub-id-type="doi">10.1016/j.dadm.2018.02.004</pub-id><pub-id pub-id-type="pmid">29780871</pub-id></citation></ref>
<ref id="B48">
<label>48.</label>
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Roshanzamir</surname> <given-names>A</given-names></name> <name><surname>Aghajan</surname> <given-names>H</given-names></name> <name><surname>Baghshah</surname> <given-names>MS</given-names></name></person-group>. <article-title>Transformer-based deep neural network language models for Alzheimer&#x00027;s disease risk assessment from targeted speech</article-title>. <source>BMC Medical Inform Decis Mak</source>. (<year>2021</year>) <volume>21</volume>:<fpage>1</fpage>&#x02013;<lpage>14</lpage>. <pub-id pub-id-type="doi">10.1186/s12911-021-01456-3</pub-id><pub-id pub-id-type="pmid">33750385</pub-id></citation></ref>
<ref id="B49">
<label>49.</label>
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Pan</surname> <given-names>Y</given-names></name> <name><surname>Mirheidari</surname> <given-names>B</given-names></name> <name><surname>Reuber</surname> <given-names>M</given-names></name> <name><surname>Venneri</surname> <given-names>A</given-names></name> <name><surname>Blackburn</surname> <given-names>D</given-names></name> <name><surname>Christensen</surname> <given-names>H</given-names></name></person-group>. <article-title>Automatic hierarchical attention neural network for detecting AD</article-title>. <source>Proc Interspeech</source>. (<year>2019</year>) <volume>2019</volume>:<fpage>4105</fpage>&#x02013;<lpage>9</lpage>. <pub-id pub-id-type="doi">10.21437/Interspeech.2019-1799</pub-id></citation></ref>
<ref id="B50">
<label>50.</label>
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Li</surname> <given-names>B</given-names></name> <name><surname>Hsu</surname> <given-names>YT</given-names></name> <name><surname>Rudzicz</surname> <given-names>F</given-names></name></person-group>. <article-title>Detecting dementia in mandarin Chinese using transfer learning from a parallel corpus</article-title>. <source>arXiv [Preprint] arXiv:1903.00933</source>. (<year>2019</year>). <pub-id pub-id-type="doi">10.18653/v1/N19-1199</pub-id></citation></ref>
<ref id="B51">
<label>51.</label>
<citation citation-type="book"><person-group person-group-type="author"><name><surname>Fraser</surname> <given-names>KC</given-names></name> <name><surname>Linz</surname> <given-names>N</given-names></name> <name><surname>Li</surname> <given-names>B</given-names></name> <name><surname>Fors</surname> <given-names>KL</given-names></name> <name><surname>Rudzicz</surname> <given-names>F</given-names></name> <name><surname>K&#x000F6;nig</surname> <given-names>A</given-names></name> <etal/></person-group>. <article-title>Multilingual prediction of Alzheimer&#x00027;s disease through domain adaptation and conceptbased language modelling</article-title>. In: <source>Proceedings of the 2019 Conference of the North American Chapter of the Association for Computational Linguistics: Human Language Technologies</source>. <publisher-loc>Florence</publisher-loc>. (<year>2019</year>). p. <fpage>3659</fpage>&#x02013;<lpage>70</lpage>.</citation></ref>
<ref id="B52">
<label>52.</label>
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Bucks</surname> <given-names>RS</given-names></name> <name><surname>Singh</surname> <given-names>S</given-names></name> <name><surname>Cuerden</surname> <given-names>JM</given-names></name> <name><surname>Wilcock</surname> <given-names>GK</given-names></name></person-group>. <article-title>Analysis of spontaneous, conversational speech in dementia of Alzheimer type: evaluation of an objective technique for analysing lexical performance</article-title>. <source>Aphasiology</source>. (<year>2000</year>) <volume>14</volume>:<fpage>71</fpage>&#x02013;<lpage>91</lpage>. <pub-id pub-id-type="doi">10.1080/026870300401603</pub-id></citation></ref>
<ref id="B53">
<label>53.</label>
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Dhanamjayulu</surname> <given-names>C</given-names></name> <name><surname>Nizhal</surname> <given-names>UN</given-names></name> <name><surname>Maddikunta</surname> <given-names>PKR</given-names></name> <name><surname>Gadekallu</surname> <given-names>TR</given-names></name> <name><surname>Lwendi</surname> <given-names>C</given-names></name> <name><surname>Wei</surname> <given-names>C</given-names></name></person-group>. <article-title>Identification of malnutrition and prediction of BMI from facial images using real-time image processing and machine learning</article-title>. <source>IET Image Process</source>. (<year>2021</year>) <volume>16</volume>:<fpage>647</fpage>&#x02013;<lpage>58</lpage>. <pub-id pub-id-type="doi">10.1049/ipr2.12222</pub-id></citation></ref>
<ref id="B54">
<label>54.</label>
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Thippa</surname> <given-names>RG</given-names></name> <name><surname>Bhattacharya</surname> <given-names>S</given-names></name> <name><surname>Maddikunta</surname> <given-names>P</given-names></name> <name><surname>Hakak</surname> <given-names>S</given-names></name> <name><surname>Tariq</surname> <given-names>U</given-names></name></person-group>. <article-title>Antlion re-sampling based deep neural network model for classifification of imbalanced multimodal stroke dataset</article-title>. <source>Multimed Tools Appl</source>. (<year>2020</year>) <volume>26</volume>:<fpage>1</fpage>&#x02013;<lpage>25</lpage>. <pub-id pub-id-type="doi">10.1007/s11042-020-09988-y</pub-id></citation></ref>
<ref id="B55">
<label>55.</label>
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Wang</surname> <given-names>W</given-names></name> <name><surname>Qiu</surname> <given-names>C</given-names></name> <name><surname>Yin</surname> <given-names>Z</given-names></name> <name><surname>Srivastava</surname> <given-names>G</given-names></name> <name><surname>Gadekallu</surname> <given-names>TR</given-names></name> <name><surname>Alsolami</surname> <given-names>F</given-names></name></person-group>. <article-title>Blockchain and PUF-based lightweight authentication protocol for wireless medical sensor networks</article-title>. <source>IEEE Internet Things J</source>. (<year>2021</year>). <pub-id pub-id-type="doi">10.1109/JIOT.2021.3117762</pub-id></citation></ref>
</ref-list> 
</back>
</article>