<!DOCTYPE article PUBLIC "-//NLM//DTD JATS (Z39.96) Journal Archiving and Interchange DTD v1.0 20120330//EN" "JATS-archivearticle1.dtd">
<article xmlns:xlink="http://www.w3.org/1999/xlink">
  <front>
    <journal-meta />
    <article-meta>
      <title-group>
        <article-title>Linguistic Metadata Augmented Classifiers at the CLEF 2017 Task for Early Detection of Depression</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Marcel Trotzek</string-name>
          <email>mtrotzek@stud.fh-dortmund.de</email>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Sven Koitka</string-name>
          <email>sven.koitka@fh-dortmund.de</email>
          <xref ref-type="aff" rid="aff0">0</xref>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Christoph M. Friedrich</string-name>
          <email>christoph.friedrich@fh-dortmund.de</email>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>TU Dortmund University Department of Computer Science Otto-Hahn-Str.</institution>
          <addr-line>14, 44227 Dortmund</addr-line>
          ,
          <country country="DE">Germany</country>
        </aff>
        <aff id="aff1">
          <label>1</label>
          <institution>University of Applied Sciences and Arts Dortmund (FHDO) Department of Computer Science Emil-Figge-Str.</institution>
          <addr-line>42, 44227 Dortmund</addr-line>
          ,
          <country country="DE">Germany</country>
        </aff>
      </contrib-group>
      <abstract>
        <p>Methods for automatic early detection of depressed individuals based on written texts can help in research of this disorder and especially offer better assistance to those affected. FHDO Biomedical Computer Science Group (BCSG) has submitted results obtained from five models for the CLEF 2017 eRisk task for early detection of depression that are described in this paper. All models utilize linguistic meta information extracted from the texts of each evaluated user and combine them with classifiers based on Bag of Words (BoW) models, Paragraph Vector, Latent Semantic Analysis (LSA), and Recurrent Neural Networks (RNN) using Long Short Term Memory (LSTM). BCSG has achieved top performance according to ERDE5 and F1 score for this task.</p>
      </abstract>
      <kwd-group>
        <kwd>depression</kwd>
        <kwd>early detection</kwd>
        <kwd>linguistic metadata</kwd>
        <kwd>paragraph vector</kwd>
        <kwd>latent semantic analysis</kwd>
        <kwd>long short term memory</kwd>
      </kwd-group>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>-</title>
      <p>
        This paper describes the participation of FHDO Biomedical Computer Science
Group (BCSG) at the Conference and Labs of the Evaluation Forum (CLEF)
2017 eRisk pilot task for early detection of depression [
        <xref ref-type="bibr" rid="ref22 ref23">22, 23</xref>
        ]. BCSG submitted
results obtained from four different approaches and a fifth, additionally
optimized variation of one model for late submission. These models as well as the
findings concerning the dataset are described in this paper and an outlook on
possible improvements and future research is given.
      </p>
    </sec>
    <sec id="sec-2">
      <title>Related Work</title>
      <p>
        It is known that depression often leads to a negative image of oneself, pessimistic
views, and an overall dejected mood [
        <xref ref-type="bibr" rid="ref2">2</xref>
        ]. Accordingly, previous studies have shown
that depression can have certain effects on the language used by patients. A study
among depressed, formerly-depressed, and never-depressed students [
        <xref ref-type="bibr" rid="ref36">36</xref>
        ] came to
the conclusion that depressed individuals more frequently used the word “I” as
well as negatively connoted adjectives. Similarly, an analysis of Twitter messages
has shown that users suffering from depression used the words “my” and “me”
much more frequently than others [
        <xref ref-type="bibr" rid="ref29">29</xref>
        ], while a Russian speech study found an
increased usage of past tense verbs and pronouns in general. Findings like these
have been used, for example, to create the Linguistic Inquiry and Word Count
(LIWC) tool [
        <xref ref-type="bibr" rid="ref39">39</xref>
        ] that allows to analyse the psychological and social state of an
individual based on written texts.
      </p>
      <p>
        A similar task using Twitter posts was organized at the CLPsych 2015
conference [
        <xref ref-type="bibr" rid="ref9">9</xref>
        ] without the early detection aspect: Participants were asked to distinguish
between users with depression and a control group, users with Post Traumatic
Stress Disorder (PTSD) and a control group, as well as between users with
depression and users with PTSD. Promising results were reported using topic
modeling [
        <xref ref-type="bibr" rid="ref35">35</xref>
        ] and rule-based approaches [
        <xref ref-type="bibr" rid="ref31">31</xref>
        ]. It was also investigated how a
set of user metadata features can be utilized and combined with a variety of
document vectorizations in an ensemble [
        <xref ref-type="bibr" rid="ref33">33</xref>
        ].
3
      </p>
    </sec>
    <sec id="sec-3">
      <title>Dataset</title>
      <p>The dataset presented in the CLEF 2017 eRisk pilot task consists of text contents
written by users of www.reddit.com, which is a widely used communication
platform for creating communities called subreddits that cover all kinds of topics3.
Specifically, there is a very active community in the subreddit /r/depression4 for
people struggling with depression and similar subreddits for other mental
disorders exist as well. The registration of a free account using a valid mail address
and a public user name is necessary to create content, while reading is possible
without registration, depending on the subreddit. Users can post content as link
(using a title and either a URL or an image), as text content (using a title and
optional text), or as comment (using only the text field and no title).</p>
      <p>The given dataset contains all three kinds of content written by 887 users
and 10 up to 2,000 documents per user. Table 1 gives a summary of some basic
characteristics of the training and test split. The task’s goal is to classify which
of these users show indications of depression by reading as few of their posts as
possible in chronological order. Each document contains a timestamp of
publication, the title, and the text content, while title or text can be empty. There also
exist 91 cases of documents with both an empty title and text. The URL or
image of link entries is not provided in the dataset. The number of unique n-grams
3 https://redditblog.com/2014/07/30/how-reddit-works-2/, Accessed on 2017-04-24
4 http://www.reddit.com/r/depression, Accessed on 2017-04-24
contains all tokens with more than one alphabetical character (and the word
“I”) that occur in at least two documents, also including numbers, emoticons,
and words that contain hyphens or apostrophes.
After examining the general characteristics of the given dataset, a detailed
analysis of the text contents is necessary to get an insight into promising features
and the specific properties of the domain. In order to find the most interesting
n-grams of the given corpus, Information Gain (IG) or expected Mutual
Information (MI) was calculated. In case of binary classification tasks, the information
contained in each feature is given as [25, p. 272]:</p>
      <p>I(U ; C) =</p>
      <p>X</p>
      <p>X
et∈{0,1} ec∈{0,1}</p>
      <p>P (U = et, C = ec) log2</p>
      <p>P (U = et, C = ec)
P (U = et)P (C = ec)
, (1)
with the random variable U taking values et = 1 (the document contains term
t) and et = 0 (the document does not contain term t) and the random variable
C taking values ec = 1 (the document is in class c) and ec = 0 (the document is
not in class c).</p>
      <p>Similar to the previously described selection of unigrams in the corpus, IG
was calculated without stopword removal for all uni-, bi-, and trigrams that can
be found in at least two documents. The obtained scores were then used to find
the 100 features with the highest IG of the corpus as well as the 100 features
with the highest IG that occur more often in the depressed class, which is both
shown in Fig. 1.</p>
      <p>i'm not
ya much go something
itseem ilke llaymtwimiggonaoesnsehdgisllyaet rehdotilhiki'itsnemwkyiybtisheohecualafivucnesaoenti o
som lfee foam re dn
a
yatnodbut but i
n
i
p
lfee tocseabue ihdahittahneolapiamw thaw ttno</p>
      <p>Both analyses give an interesting insight into the corpus that confirm
previous research results described in the related work section. Comparing the two
word clouds shows that the first person singular pronouns I, me, and my, which
are frequently contained in documents of both classes, have the highest IG seen
individually and are then found in some of the most important bi- and trigrams
of the depressed class. The most important features of this class are, as could be
expected, centered around depression and anxiety, while especially relationships
(e.g. boyfriend, husband, partner, best friend), treatment (e.g. therapist,
psychiatrist, medication), and look (e.g. acne, skin, makeup, alpha hydrox ) can easily be
identified as frequent topics and are often combined with personal or possessive
pronouns. Interestingly, although the sad emoticon :-( is part of the top features
in the depressed class, the happy emoticons :-) and :) occur even more frequently
in this class and have a higher IG. The frequent combinations as in “thank you
:)” point to the conclusion that this is often a reaction to thoroughly helpful
conversations.</p>
      <p>When examining the text data further, it becomes evident that the posts
sometimes include quotes taken from messages of other users. This could be
misleading for classification tasks since the quoted user might show indications
of depression, while the actual author of this message might not or vice versa.
Luckily, quotes seem to be unfrequent and can be identified to some extend
because they are always indented by a single space, do not contain line breaks,
and are preceded and followed by an empty line. There is no way to distinguish
them from similarly indented one-line paragraphs by the actual author. By using
a regular expression, 4,266 quotes can be found in the training data and 4,423
in the test data. For all models described in this paper, the prefix quote_ was
added to each token within a quote to make them distinguishable from the same
words written by the actual author.
3.2</p>
      <sec id="sec-3-1">
        <title>Hand-crafted User Features</title>
        <p>
          In addition to different document vectorization methods, a set of hand-crafted
features has been derived from the text data and was used in all approaches.
Several text statistics have been calculated and compared between the class of
depressed and non-depressed users in the given dataset. The most promising
features are displayed in Fig. 2 as box plot for each class. All features have
been calculated as mean over all texts of the same user. In addition to the
already mentioned counts of personal and possessive pronouns, past tense verbs,
and the word I in particular, four standard measures for text readability have
been calculated for the text content, namely Gunning Fog Index (FOG) [
          <xref ref-type="bibr" rid="ref14">14</xref>
          ],
Flesch Reading Ease (FRE) [
          <xref ref-type="bibr" rid="ref12">12</xref>
          ], Linsear Write Formula (LWF)5 [
          <xref ref-type="bibr" rid="ref8">8</xref>
          ], and New
Dale-Chall Readability (DCR) [
          <xref ref-type="bibr" rid="ref10 ref7">10, 7</xref>
          ]. Interestingly, while FOG, LWF, and DCR
calculate a higher complexity for texts by depressed users (with values based on
school years in the United States), FRE also calculates a higher score,
corresponding to lower complexity in this case.
        </p>
        <sec id="sec-3-1-1">
          <title>Averag0e # of past tens1e verbs</title>
        </sec>
        <sec id="sec-3-1-2">
          <title>Average0# of personal p1ronouns</title>
        </sec>
        <sec id="sec-3-1-3">
          <title>Average #0 of possessive1pronouns</title>
        </sec>
        <sec id="sec-3-1-4">
          <title>Average0occurrences of1"I" in text</title>
        </sec>
        <sec id="sec-3-1-5">
          <title>Average 0occurrences of1"I" in title Averag0e text length (1words) 0Average month1</title>
          <p>60
40
20
0
5 originally developed by the U.S. Air Force without any available references
12
9
6
3
15
10
5
0</p>
          <p>Class
0 - non-depressed
1 - depressed</p>
          <p>The average of the months in which all texts of a user have been submitted
was included based on the hypothesis that depressive symptoms can be
intensified in the winter months. This is difficult to observe in the given dataset, since
the age of the available texts depends on how frequently a user has posted due to
the limitation to the last 2000 writings per user. Users with many and frequent
writings therefore tend to have more samples from early summer 2015 (when the
collection was created), while less frequent writers provide a more uniform
distribution of texts over all months. Additionally, five features have been created for
the users that simply count the occurrences of some very specific n-grams in all
their documents. This ensures that some of the strongest indicators of depression
can still be identified easily even when using averaged document vectors or just
a large amount of documents. These features were used in boolean form by all
described models and count the following terms without regard to case:
– The chemical and brand names of common antidepressants available in the</p>
          <p>United States (e.g.: Sertraline or Zoloft) obtained from WebMD6
– Explicit mentions of a diagnosis including the word depression (e.g.: “I was
diagnosed with depression” or “I’ve been diagnosed with anxiety and
depression”)
– The term “my depression”
– The term “my anxiety”
– The term “my therapist”
The mentioned terms have been picked carefully only from the training
documents and have been designed to capture only statements referring to the
personal situation of the author with the exception of the antidepressants. They
could be extended for future research to include a more comprehensive list of
medications or more general expressions of diagnosis (e.g. also including the
terms “major depressive disorder” or “MDD”). Although the selected terms are
not primarily helpful for early predictions, they are strong indicators to find
already diagnosed individuals, which is important for the given task as well. It
would also be interesting to include additional statistical features like the
number of adjectives, adverbs, noun phrases, positive and negative emotions, and
similar, as done for example by LIWC. Figure 3 displays the correlation of all
user features without scaling and also includes the label information, where a
higher value corresponds to the depressed class. It shows that all features are
at least slightly correlated to the information whether a user is depressed or
non-depressed.
6 http://www.webmd.com/depression/guide/depression-medications-antidepressants
- Accessed on 2017-05-07</p>
          <p>Past tense verbs
Possessive pronouns 0.97</p>
          <p>Personal pronouns 0.9 0.94
"I" in the text 0.81 0.86 0.96
"I" in the title 0.22 0.24 0.28 0.31
Text length 0.93 0.96 0.96 0.89 0.21</p>
          <p>Month 0.06 0.04 0.01 0.01 -0.06 0.02
LWF 0.17 0.22 0.27 0.3 -0.02 0.33 0.09
FRE 0.13 0.16 0.19 0.23 -0.02 0.18 0.04 0.47
DCR 0.11 0.15 0.16 0.18 -0.13 0.21 0.01 0.7 0.53</p>
          <p>FOG 0.11 0.13 0.17 0.19 -0.08 0.22 0.05 0.75 0.44 0.86
Medication names 0.02 0.04 0.05 0.07 0.07 0.05 0.02 0.1 0.09 0.06 0.06</p>
          <p>Diagnosis 0.04 0.05 0.08 0.1 0.09 0.06 -0.02 0.05 0.09 0 0.02 0.13
My therapist 0 0.02 0.03 0.05 0.01 0.02 0.03 0.08 0.01 0.06 0.08 0.19 0.09</p>
          <p>My anxiety 0.03 0.07 0.06 0.1 0.08 0.06 -0.01 0.08 -0.01 0.06 0.06 0.78 0.11 0.35
My depression 0.03 0.08 0.1 0.13 0.13 0.09 -0.01 0.11 0.12 0.06 0.08 0.37 0.33 0.21 0.52</p>
          <p>Class 0.09 0.14 0.21 0.27 0.05 0.18 0.05 0.31 0.26 0.21 0.25 0.25 0.3 0.18 0.25 0.34</p>
          <p>The findings for this specific dataset confirm that texts by individuals
suffering from depression indeed contain more pronouns and especially the word
“I”. Their texts are also slightly longer and more complex according to three of
the four text complexity measures. This likely represents the difference between
average users, who often post a large amount of short statements, and those who
discuss problems and may even be looking for help.</p>
        </sec>
      </sec>
    </sec>
    <sec id="sec-4">
      <title>4 Chosen Models</title>
      <p>
        Two conventional document vectorization models as well as three models
utilizing Long Short Term Memory (LSTM) [
        <xref ref-type="bibr" rid="ref16">16</xref>
        ], a layer architecture for Recurrent
Neural Networks (RNN) [
        <xref ref-type="bibr" rid="ref13">13</xref>
        ] specialized on sequences of data, have been used
for the given task. One of these models also employs Latent Semantic Analysis
(LSA) [
        <xref ref-type="bibr" rid="ref11">11</xref>
        ] as dimensionality reduction step. All models have been optimized
by 5-fold cross validation on the training data using F1 score before the
submission for the first chunk of test data and were not modified at a later point.
The same applies for the described prediction thresholds that were also chosen
by cross validation to submit predictions each week. The only exception is the
final model BCSGE, which was used to get more time for optimization: For the
first nine weeks, no predictions were submitted for this model, so only the
predictions using all documents at once in the last week were scored. All models
use a concatenation of the text and title field of each document as input and do
not treat text and title separately. Identified quotes within text contents have
been modified by adding a prefix to each quoted word as described earlier, while
the tokenization step includes words, numbers, and emoticons as described in
section 3.
4.1
      </p>
      <sec id="sec-4-1">
        <title>Bag of Words Ensemble - BCSGA</title>
        <p>
          The first model utilizes an ensemble of Bag of Words (BoW) classifiers with
different term weightings and n-grams. The term weighting for bags of words can
generally be split into three components: a term frequency component or local
weight, a document frequency component or global weight, and a normalization
component [
          <xref ref-type="bibr" rid="ref37">37</xref>
          ]. A general term weighting scheme can therefore be given as [
          <xref ref-type="bibr" rid="ref40">40</xref>
          ]:
tt,d = lt,d · gt · nd ,
where tt,d is the calculated weight for term t in document d, lt,d is the local weight
of term t in document d, gt is the global weight of term t for all documents, and nd
is the normalization factor for document d. A common example would be using
the term frequency (tf ) as local weight and the inverse document frequency (idf )
as global weight, resulting in tf -idf weighting [
          <xref ref-type="bibr" rid="ref37">37</xref>
          ].
        </p>
        <p>
          All ensemble models use cosine normalization (l2-norm) for nd but varying
local and global weights. The first one uses a combination of uni-, bi-, tri-, and
4-grams obtained from the training data: the 200,000 [
          <xref ref-type="bibr" rid="ref1 ref2 ref3 ref4">1 − 4</xref>
          ]-grams with the
highest IG as given by Equation 1 are selected and their raw term frequency is
used as local weight, while their IG score is used as global weight. The second
BoW utilizes a modified version of tf , namely augmented term frequency (atf )
[
          <xref ref-type="bibr" rid="ref40">40</xref>
          ], multiplied by idf :
atf -idf (t, d) =
a + (1 − a)
        </p>
        <p>tft
max(tf )
· log</p>
        <p>
          nd
df (d, t)
with max(tf ) being the maximum frequency of any term in the document, the
total number of documents nd, and the smoothing parameter a, which is set to 0.3
for this model. This BoW, as well as the third one, contains all unigrams of the
training corpus. The local weight of the third model consists of the logarithmic
term frequency (logtf ) [
          <xref ref-type="bibr" rid="ref30">30</xref>
          ] and the global weight is given by relevance frequency
(rf ) [
          <xref ref-type="bibr" rid="ref20">20</xref>
          ], which can be combined as:
(2)
(3)
logtf -rf (t, d) = (1 + log(tf )) · log2
2 +
        </p>
        <p>dft,+
max (1, dft,−)
(4)
where dft,+ and dft,− is the number of documents in the depressed/non-depressed
class that contain the term t. The final model of this ensemble uses the
handcrafted user features described in section 3.2.</p>
        <p>
          All three bags of words and the hand-crafted features were each used as
input for a separate logistic regression classifier. Due to the imbalanced class
distribution, a modified class weight was used for these classifiers similar to the
original task paper [
          <xref ref-type="bibr" rid="ref22">22</xref>
          ] to increase the cost of false negatives. It was calculated
for the non-depressed class as 1/(1 + w) and for the depressed class as w/(1 + w),
with w1 = 2, w2 = 6, w3 = 2, and w4 = 4 in the order as the different models
have been described above. The final output probabilities were calculated as
unweighted mean of all four logistic regression probabilities. Each week, this
ensemble predicted any user with a probability above 0.5 as depressed and users
below 0.15 as non-depressed, while in the final week all users with a probability
equal to or less than 0.5 were predicted as non-depressed.
4.2
        </p>
      </sec>
      <sec id="sec-4-2">
        <title>Paragraph Vector - BCSGB</title>
        <p>
          The second model is based on document vectorization by using Paragraph
Vector [
          <xref ref-type="bibr" rid="ref21">21</xref>
          ], sometimes referred to as doc2vec, similar to the previously published
word2vec [
          <xref ref-type="bibr" rid="ref26 ref27">26, 27</xref>
          ] on which it is based. While word2vec is used to train embedded
word vectors from a large text corpus, Paragraph Vector learns vector
representations for sentences, paragraphs, or whole documents. It was also found that
Paragraph Vector can work better for smaller corpora than word2vec, which
potentially makes it a viable option for this task. The two neural network
architectures for each of these methods are all based on the probabilistic Neural
Network Language Model [
          <xref ref-type="bibr" rid="ref3">3</xref>
          ].
        </p>
        <p>
          For the Paragraph Vector classification of eRisk users, two separate models
have been trained based on the training documents using the Python
implementation in gensim 1.0.1 [
          <xref ref-type="bibr" rid="ref34">34</xref>
          ]:
1. A Distributed Bag of Words model with 100 dimensional output, 10
training epochs, a context window of 10 words, negative sampling with 20 noise
words, no downsampling, a learning rate from 0.025 to 1e−4, and all words
contained in the documents.
2. A Distributed Memory model using the sum of input words with 100
dimensional output, 10 training epochs, a context window of 10, hierarchical
softmax, downsampling of high-frequency words with 1e−4, a learning rate
from 0.025 to 1e−4, and all words contained in the documents.
        </p>
        <p>
          The output vectors of these two models were concatenated, as recommended by
the developers [
          <xref ref-type="bibr" rid="ref21">21</xref>
          ], resulting in a 200 dimensional vector per document. Text
content and title of the documents have again been concatenated and each of the
resulting texts was used as separate input to Paragraph Vector. Test documents
were vectorized by using an inference step that only outputs a new document
vector and leaves all network weights fixed.
        </p>
        <p>
          Finally, the average of all documents by each user was calculated to obtain
the average topic of everything the user has written. Figure 4 shows a
twodimensional representation of the averaged training document vectors calculated
by t-SNE [
          <xref ref-type="bibr" rid="ref24">24</xref>
          ]. Even after a reduction to only two dimensions, there is at least
one clearly visible cluster of non-depressed users and a rather noisy cluster of
depressed users.
        </p>
        <p>Class
non-depressed
depressed</p>
        <p>A logistic regression classifier was trained on the 200-dimensional averaged
document vectors, using the same class weight equation as in the previous model
with w = 4. The calculated class probabilities were again averaged with the
probabilities obtained from the logistic regression based on the hand-crafted
user features. Since this model depends more on the number of documents it has
been trained on, the final predictions were based on the probability as well as the
number of documents written by the user to prevent too many false positives.
Depressed predictions were submitted for probabilities from 0.6 with at least
20 documents, 0.7 with at least 10 documents, and all probabilities above 0.9,
while non-depressed predictions required a probability below 0.1 with at least
20 documents, 0.05 with at least 10 documents, or a probability below 0.01.
4.3</p>
      </sec>
      <sec id="sec-4-3">
        <title>LSTM with LSA Vectors - BCSGC</title>
        <p>
          This and the following two models are based on a Tensorflow [
          <xref ref-type="bibr" rid="ref1">1</xref>
          ] neural network
approach using an LSTM layer. By using sequences of text documents as input,
the LSTM network allows to learn a general context of each user’s documents
while processing them in chronological order. All three LSTM models also use
the hand-crafted user features as an additional meta data input and merge them
with the LSTM output in a fully connected layer. This again ensures that these
features are not lost after document vectorization and averaging. A final softmax
layer was used to produce the actual output probabilities, the softsign function
[
          <xref ref-type="bibr" rid="ref4">4</xref>
          ] was chosen as activation for the LSTM cell, and dropout was added to prevent
overfitting. The training steps of this and the following two LSTM models utilized
Adam [
          <xref ref-type="bibr" rid="ref19">19</xref>
          ] to minimize the cross-entropy loss.
        </p>
        <p>For this first LSTM approach, LSA was used to reduce the BoW vectorized
documents to a viable number of dimensions based on Singular Value
Decomposition (SVD). All documents were first transformed into a BoW by selecting
only the 10,000 unigrams with the highest IG and using their term frequency
multiplied by their IG as term weighting. LSA was then used to reduce these
document vectors to 100 dimensions, which retained 90.32% of the original
variance in the training dataset. To obtain an equal sequence length for all users
that is viable as network input, the document sequences were modified to have
a length of 25 documents: For users with fewer documents, zero vectors were
appended, while two randomly selected consecutive document vectors were
averaged for longer sequences, until the maximum length was reached. Adam was
then used with a fixed learning rate of 1e−4, 64 units were added to the LSTM
cell, a dropout keep probability of 80% was applied, and the network was trained
for 300 epochs.</p>
        <p>Similar to the previous model, prediction thresholds were based on the
network’s output probability and the number of documents. Depressed predictions
required a probability above 0.5 and at least 20 documents, above 0.7 and at least
five documents, or above 0.9, while non-depressed predictions were submitted for
probabilities below 0.05.
4.4</p>
      </sec>
      <sec id="sec-4-4">
        <title>LSTM with Paragraph Vectors - BCSGD</title>
        <p>This fourth model utilized the same LSTM network as described for the previous
one with identical parameters, except for a number of 128 hidden units in the
LSTM cell and a training duration of 170 epochs. For the input sequences,
documents were vectorized based on the two concatenated Paragraph Vector
models of the second approach. Again, the resulting sequences of 200-dimensional
document vectors were modified to have a unified length of 25. The model was
configured to submit depressed predictions for any user with a probability above
0.3 and at least 50 documents, above 0.4 and at least 20 documents, or above
0.7, while probabilities below 0.01 resulted in a non-depressed prediction.
4.5</p>
      </sec>
      <sec id="sec-4-5">
        <title>Late LSTM with Paragraph Vectors - BCSGE</title>
        <p>
          To have some additional time for model optimization and to compare the impact
on the ERDE score, the fifth model was not used to submit any predictions
until the last week. It is identical to the fourth model but uses two new,
200dimensional Paragraph Vector models that were trained on both training and
test documents. This is an unsupervised method that uses only text documents
without any label information. Also, this model uses a second fully connected
layer before the softmax layer, Rectified Linear Unit (ReLU) activation [
          <xref ref-type="bibr" rid="ref15">15</xref>
          ] for
both fully connected layers, a weight decay factor of 0.001 for all weights in the
network, exponential learning rate decay from 1e−4 to 1e−5, a dropout keep
probability of 70% for LSTM outputs, 128 hidden units in the LSTM, and was
trained using batches of 100 users over 130 epochs. The document sequence
length was again unified to 25 and a minority oversampling that duplicates each
depressed user in the training input was used to counter the class imbalance.
The final network architecture for this model is displayed in Fig. 5, where mu
represents the meta data for a single user u and xu,t is the sequence of input
documents written by this user. In the final week, predictions obtained from
this model were submitted based on the same thresholds that were used for the
previous one.
Before discussing the official task results, analyzing the amount of correctly
classified depressed individuals using the five BCSG models can give a first
insight into the classification performance. The cumulative number of depressed
predictions and actual true positives per model and week is shown in Fig. 6. A
horizontal line marks the total number of 52 depressed samples in the test set for
reference. It becomes evident that there is still a lot of room for improvements.
Although each model is able to detect a growing number of depressed users over
the ten weeks, the proportion of false positives is large and the number of total
true positives ranges between 24 and 38 of the 52 depressed users in the test set.
Most true positives were found by the fifth model but at the cost of nearly as
much false positives. This could at least partially be influenced by finding better
prediction thresholds.
        </p>
        <p>
          The final submissions to the CLEF 2017 early risk detection pilot task were
scored using the ERDE5 and ERDE50 score for early detection tasks defined
by the organizers as well as F1 score. The scores and the underlying precision
and recall values of all models have been published [
          <xref ref-type="bibr" rid="ref23">23</xref>
          ] and are visualized in
Fig. 7. It shows the evaluation results of all eight participants and their up to
five different models. The highlighted models of BCSG consistently achieved
positions in the first ranks and even the fifth model was ranked in the top half
according to both ERDE scores by only submitting a prediction in the last week.
The achieved ERDE scores for this task cannot be compared to the previously
published results by the organizers [
          <xref ref-type="bibr" rid="ref22">22</xref>
          ], since the documents had to be processed
in weekly chunks for the task and it was not possible to submit predictions before
processing a complete chunk. The best results of BCSG could be achieved by
using the BoW model BCSGA (first in F and second in ERDE ) and the
1 50
Paragraph Vector model BCSGB (first in ERDE ), with the LSTM models
5
close behind.
        </p>
        <p>1
2
3
4
5
6
7
8
9</p>
        <p>10</p>
        <p>Week
portion of true positives (blue bars only) per model after each week of the task. A
horizontal line marks the 52 depressed samples in the test data.</p>
        <p>t
c70
i
60
s
n
o
i
d
e
r
p
e
v
i
t
i
p
)
(
f
o
r
e
b
u
n
e
a
l
u
50
s
o
e
u40
r
t
30
m
20
t10
v
i
0
m
u
C
Model</p>
        <p>BCSGA
BCSGB
BCSGC
BCSGD</p>
        <p>BCSGE
%
0
.0
4
6
e
i
h
c30
A
20
0
%
4
score. The results of BCSG are highlighted. This plot is best viewed in electronic form.</p>
        <p>Since results for BCSGE are only available for the last week, it was evaluated
again for all weeks after the golden truth file was published. For this ex post
analysis, separate Paragraph Vector models were trained using the training data
and already released test data for each week. If BCSGE had been used from the
first week, the results would have been 16.01% in ERDE5, 9.78% in ERDE50,
and 0.46 in F1. While this ERDE50 score would have been the third best overall,
the other scores show that this is still not well optimized and there are too many
false positives. Future work will be used to examine the effect of hand-crafted
features and preprocessing methods on the prediction results. A quick ex post
analysis using the first two models BCSGA and BCSGB has shown that the
selected hand-crafted features at least had a slightly positive effect (13.04% in
ERDE5, 9.75% in ERDE50, and 0.63 in F1 for BCSGA without hand-crafted
features), with the exception of the ERDE5 score for BCSGB, which would have
been marginally better without hand-crafted features in contrast to a much worse
F1 score (12.67% in ERDE5, 10.76% in ERDE50, and 0.37 in F1 for BCSGB).
6</p>
      </sec>
    </sec>
    <sec id="sec-5">
      <title>Conclusions</title>
      <p>
        The pilot task for early detection of depression has highlighted a variety of
challenges posed by this area of research. These challenges are not limited to the
task of distinguishing actual clinical depression from normal dejected mood as
well as other, more or less related mental disorders like anxiety disorders, PTSD,
or bipolar disorder. In the context of online platforms, there are also several
other frequent false positives that could be observed in this task: relatives of
depressed individuals and therapists offering advice can easily be mistaken for
depressed cases when giving too much weight to single words or phrases. Drug
users (which might indeed be an accompanying factor of depression [
        <xref ref-type="bibr" rid="ref18 ref6">18, 6</xref>
        ]) and
authors posting fictional stories could regularly be spotted as false positives.
On the other hand, there are cases of individuals who post hundreds of very
ordinary comments but suddenly start expressing their feelings and talk about
their depression. Such cases would be easier to predict by models that treat each
document separately instead of using the whole history of a user.
      </p>
      <p>
        The final results show that all chosen approaches are generally suitable for
early detection of depression and all of them are of interest for future research.
Due to the promising results using Paragraph Vector, optimizing these models
and applying similar word and document embedding methods like fastText [
        <xref ref-type="bibr" rid="ref17 ref5">5,
17</xref>
        ] and GloVe [
        <xref ref-type="bibr" rid="ref32">32</xref>
        ] could be a priority for future work. The introduced neural
network approaches with LSTM cells have been shown to be viable as well and
allow for a variety of possible extensions and optimizations. Better prediction
thresholds optimized based on ERDE scores or more specific signals for
depressed predictions could help in making earlier predictions without too many
false positives. Finally, the collected meta information on the user base can be
extended to utilize emotion lexica [
        <xref ref-type="bibr" rid="ref28">28</xref>
        ], psychological and social insights obtained
for example from LIWC, and additional statistical text features.
      </p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          1.
          <string-name>
            <surname>Abadi</surname>
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Agarwal</surname>
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Barham</surname>
            <given-names>P.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Brevdo</surname>
            <given-names>E.</given-names>
          </string-name>
          , Chen
          <string-name>
            <given-names>Z.</given-names>
            ,
            <surname>Citro</surname>
          </string-name>
          <string-name>
            <given-names>C.</given-names>
            ,
            <surname>Corrado</surname>
          </string-name>
          <string-name>
            <given-names>G.S.</given-names>
            ,
            <surname>Davis</surname>
          </string-name>
          <string-name>
            <given-names>A.</given-names>
            ,
            <surname>Dean</surname>
          </string-name>
          <string-name>
            <given-names>J.</given-names>
            ,
            <surname>Devin</surname>
          </string-name>
          <string-name>
            <given-names>M.</given-names>
            ,
            <surname>Ghemawat</surname>
          </string-name>
          <string-name>
            <given-names>S.</given-names>
            ,
            <surname>Goodfellow</surname>
          </string-name>
          <string-name>
            <given-names>I.</given-names>
            ,
            <surname>Harp</surname>
          </string-name>
          <string-name>
            <given-names>A.</given-names>
            ,
            <surname>Irving</surname>
          </string-name>
          <string-name>
            <given-names>G.</given-names>
            ,
            <surname>Isard</surname>
          </string-name>
          <string-name>
            <given-names>M.</given-names>
            ,
            <surname>Jozefowicz</surname>
          </string-name>
          <string-name>
            <given-names>R.</given-names>
            ,
            <surname>Jia</surname>
          </string-name>
          <string-name>
            <given-names>Y.</given-names>
            ,
            <surname>Kaiser</surname>
          </string-name>
          <string-name>
            <given-names>L.</given-names>
            ,
            <surname>Kudlur</surname>
          </string-name>
          <string-name>
            <given-names>M.</given-names>
            ,
            <surname>Levenberg</surname>
          </string-name>
          <string-name>
            <given-names>J.</given-names>
            ,
            <surname>Mané</surname>
          </string-name>
          <string-name>
            <given-names>D.</given-names>
            ,
            <surname>Schuster</surname>
          </string-name>
          <string-name>
            <given-names>M.</given-names>
            ,
            <surname>Monga</surname>
          </string-name>
          <string-name>
            <given-names>R.</given-names>
            ,
            <surname>Moore</surname>
          </string-name>
          <string-name>
            <given-names>S.</given-names>
            ,
            <surname>Murray</surname>
          </string-name>
          <string-name>
            <given-names>D.</given-names>
            ,
            <surname>Olah</surname>
          </string-name>
          <string-name>
            <given-names>C.</given-names>
            ,
            <surname>Shlens</surname>
          </string-name>
          <string-name>
            <given-names>J.</given-names>
            ,
            <surname>Steiner</surname>
          </string-name>
          <string-name>
            <given-names>B.</given-names>
            ,
            <surname>Sutskever</surname>
          </string-name>
          <string-name>
            <given-names>I.</given-names>
            ,
            <surname>Talwar</surname>
          </string-name>
          <string-name>
            <given-names>K.</given-names>
            ,
            <surname>Tucker</surname>
          </string-name>
          <string-name>
            <given-names>P.</given-names>
            ,
            <surname>Vanhoucke</surname>
          </string-name>
          <string-name>
            <given-names>V.</given-names>
            ,
            <surname>Vasudevan</surname>
          </string-name>
          <string-name>
            <given-names>V.</given-names>
            ,
            <surname>Viégas</surname>
          </string-name>
          <string-name>
            <given-names>F.</given-names>
            ,
            <surname>Vinyals</surname>
          </string-name>
          <string-name>
            <given-names>O.</given-names>
            ,
            <surname>Warden</surname>
          </string-name>
          <string-name>
            <given-names>P.</given-names>
            ,
            <surname>Wattenberg</surname>
          </string-name>
          <string-name>
            <given-names>M.</given-names>
            ,
            <surname>Wicke</surname>
          </string-name>
          <string-name>
            <given-names>M.</given-names>
            ,
            <surname>Yu</surname>
          </string-name>
          <string-name>
            <given-names>Y.</given-names>
            , and
            <surname>Zheng</surname>
          </string-name>
          <string-name>
            <surname>X.</surname>
          </string-name>
          :
          <source>TensorFlow: Large-Scale Machine Learning on Heterogeneous Systems</source>
          . (
          <year>2015</year>
          )
          <article-title>Software available from tensorflow</article-title>
          .org
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          2.
          <string-name>
            <surname>Beck</surname>
            ,
            <given-names>A.T.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Alford</surname>
            ,
            <given-names>B.A.</given-names>
          </string-name>
          :
          <article-title>Depression: Causes and Treatment</article-title>
          .
          <source>Second Edition</source>
          . University of Pennsylvania Press (
          <year>2009</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          3.
          <string-name>
            <surname>Bengio</surname>
            ,
            <given-names>Y.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Ducharme</surname>
            ,
            <given-names>R.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Vincent</surname>
            ,
            <given-names>P.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Jauvin</surname>
            ,
            <given-names>C.</given-names>
          </string-name>
          :
          <article-title>A Neural Probabilistic Language Model</article-title>
          .
          <source>Journal of Machine Learning Research</source>
          , Vol.
          <volume>3</volume>
          (
          <issue>Feb</issue>
          ), pp.
          <fpage>1137</fpage>
          -
          <lpage>1155</lpage>
          (
          <year>2003</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          4.
          <string-name>
            <surname>Bergstra</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Desjardins</surname>
            ,
            <given-names>G.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Lamblin</surname>
            ,
            <given-names>P.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Bengio</surname>
            ,
            <given-names>Y.</given-names>
          </string-name>
          :
          <article-title>Quadratic Polynomials Learn Better Image Features</article-title>
          .
          <source>Technical Report 1337</source>
          , Département d'Informatique et de Recherche Opérationnelle, Université de Montréal (
          <year>2009</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          5.
          <string-name>
            <surname>Bojanowski</surname>
            ,
            <given-names>P.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Grave</surname>
            ,
            <given-names>E.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Joulin</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Mikolov</surname>
            ,
            <given-names>T.</given-names>
          </string-name>
          :
          <article-title>Enriching Word Vectors with Subword Information</article-title>
          .
          <source>arXiv preprint arXiv:1607.04606</source>
          (
          <year>2016</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          6.
          <string-name>
            <surname>Brook</surname>
            <given-names>D.W.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Brook</surname>
            <given-names>J.S.</given-names>
          </string-name>
          , Zhang C.,
          <string-name>
            <surname>Cohen</surname>
            <given-names>P.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Whiteman</surname>
            <given-names>M.</given-names>
          </string-name>
          :
          <article-title>Drug Use and the Risk of Major Depressive Disorder, Alcohol Dependence, and Substance Use Disorders</article-title>
          .
          <source>Arch Gen Psychiatry</source>
          , Vol.
          <volume>59</volume>
          (
          <issue>11</issue>
          ), pp.
          <fpage>1039</fpage>
          -
          <lpage>1044</lpage>
          (
          <year>2002</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          7.
          <string-name>
            <surname>Chall</surname>
            ,
            <given-names>J.S.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Dale</surname>
          </string-name>
          , E.:
          <article-title>Readability Revisited: The New Dale-Chall Readability Formula</article-title>
          . Brookline
          <string-name>
            <surname>Books</surname>
          </string-name>
          (
          <year>1995</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          8.
          <string-name>
            <surname>Christensen</surname>
            ,
            <given-names>J.G.</given-names>
          </string-name>
          :
          <article-title>Readability Helps the Level</article-title>
          .
          <article-title>(</article-title>
          <year>2000</year>
          ) Available from: http://www.csun.edu/~vcecn006/read1.html - Accessed
          <source>on 2017-04-21</source>
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          9.
          <string-name>
            <surname>Coppersmith</surname>
            ,
            <given-names>G.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Dredze</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Harman</surname>
            ,
            <given-names>C.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Hollingshead</surname>
            , K., Mitchell,
            <given-names>M.:</given-names>
          </string-name>
          <article-title>CLPsych 2015 Shared Task: Depression and PTSD on Twitter</article-title>
          .
          <source>Proceedings of the 2nd Workshop on Computational Linguistics and Clinical Psychology: From Linguistic Signal to Clinical Reality</source>
          , pp.
          <fpage>31</fpage>
          -
          <lpage>39</lpage>
          (
          <year>2015</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          10.
          <string-name>
            <surname>Dale</surname>
            ,
            <given-names>E.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Chall</surname>
            ,
            <given-names>J.S.:</given-names>
          </string-name>
          <article-title>A Formula for Predicting Readability: Instructions</article-title>
          . Educational Research Bulletin, pp.
          <fpage>37</fpage>
          -
          <lpage>54</lpage>
          (
          <year>1948</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref11">
        <mixed-citation>
          11.
          <string-name>
            <surname>Deerwester</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Dumais</surname>
            ,
            <given-names>S.T.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Furnas</surname>
            ,
            <given-names>G.W.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Landauer</surname>
            ,
            <given-names>T.K.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Harshman</surname>
          </string-name>
          , R.:
          <article-title>Indexing by Latent Semantic Analysis</article-title>
          .
          <source>Journal of the American Society for Information Science</source>
          , Vol.
          <volume>41</volume>
          (
          <issue>6</issue>
          ), pp.
          <fpage>391</fpage>
          -
          <lpage>407</lpage>
          (
          <year>1990</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref12">
        <mixed-citation>
          12.
          <string-name>
            <surname>Flesch</surname>
            ,
            <given-names>R.:</given-names>
          </string-name>
          <article-title>A New Readability Yardstick</article-title>
          .
          <source>Journal of Applied Psychology</source>
          , Vol.
          <volume>32</volume>
          (
          <issue>3</issue>
          ), pp.
          <fpage>221</fpage>
          -
          <lpage>233</lpage>
          (
          <year>1948</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref13">
        <mixed-citation>
          13.
          <string-name>
            <surname>Goodfellow</surname>
            <given-names>I.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Bengio</surname>
            <given-names>Y.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Courville</surname>
            <given-names>A.</given-names>
          </string-name>
          :
          <article-title>Deep Learning</article-title>
          . MIT Press (
          <year>2016</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref14">
        <mixed-citation>
          14.
          <string-name>
            <surname>Gunning</surname>
            ,
            <given-names>R.</given-names>
          </string-name>
          :
          <article-title>The Technique of Clear Writing</article-title>
          .
          <string-name>
            <surname>McGraw-Hill</surname>
          </string-name>
          (
          <year>1952</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref15">
        <mixed-citation>
          15.
          <string-name>
            <surname>Hahnloser</surname>
            ,
            <given-names>R.H.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Seung</surname>
            ,
            <given-names>H.S.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Slotine</surname>
            ,
            <given-names>J.J.</given-names>
          </string-name>
          :
          <article-title>Permitted and Forbidden Sets in Symmetric Threshold-Linear Networks</article-title>
          .
          <source>Neural Computation</source>
          , Vol.
          <volume>15</volume>
          (
          <issue>3</issue>
          ), pp.
          <fpage>621</fpage>
          -
          <lpage>638</lpage>
          (
          <year>2003</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref16">
        <mixed-citation>
          16.
          <string-name>
            <surname>Hochreiter</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Schmidhuber</surname>
            <given-names>J.: Long</given-names>
          </string-name>
          <string-name>
            <surname>Short-Term Memory</surname>
          </string-name>
          .
          <source>Neural Computation</source>
          , Vol.
          <volume>9</volume>
          (
          <issue>8</issue>
          ), pp.
          <fpage>1735</fpage>
          -
          <lpage>1780</lpage>
          (
          <year>1997</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref17">
        <mixed-citation>
          17.
          <string-name>
            <surname>Joulin</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Grave</surname>
            ,
            <given-names>E.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Bojanowski</surname>
            ,
            <given-names>P.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Mikolov</surname>
            ,
            <given-names>T.</given-names>
          </string-name>
          :
          <article-title>Bag of Tricks for Efficient Text Classification</article-title>
          .
          <source>arXiv preprint arXiv:1607.01759</source>
          (
          <year>2016</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref18">
        <mixed-citation>
          18.
          <string-name>
            <surname>Khantzian</surname>
            ,
            <given-names>E.J.:</given-names>
          </string-name>
          <article-title>The Self-Medication Hypothesis of Addictive Disorders: Focus on Heroin and Cocaine Dependence</article-title>
          .
          <source>The American Journal of Psychiatry</source>
          , Vol.
          <volume>142</volume>
          (
          <issue>11</issue>
          ), pp.
          <fpage>1259</fpage>
          -
          <lpage>1264</lpage>
          (
          <year>1985</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref19">
        <mixed-citation>
          19.
          <string-name>
            <surname>Kingma</surname>
            ,
            <given-names>D.P.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Ba</surname>
          </string-name>
          , J.:
          <article-title>Adam: A Method for Stochastic Optimization</article-title>
          .
          <source>Proceedings of the 3rd International Conference on Learning Representations (ICLR)</source>
          , San Diego, arXiv preprint arXiv:
          <volume>1412</volume>
          .6980 (
          <year>2015</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref20">
        <mixed-citation>
          20.
          <string-name>
            <surname>Lan</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Tan</surname>
          </string-name>
          , Chew L.,
          <string-name>
            <surname>Low</surname>
          </string-name>
          , H.-B.:
          <article-title>Proposing a New Term Weighting Scheme for Text Categorization</article-title>
          .
          <source>Proceedings of the 21st National Conference on Artifical Intelligence (AAAI-06)</source>
          , Vol.
          <volume>6</volume>
          , pp.
          <fpage>763</fpage>
          -
          <lpage>768</lpage>
          (
          <year>2006</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref21">
        <mixed-citation>
          21.
          <string-name>
            <surname>Le</surname>
            ,
            <given-names>Q.V.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Mikolov</surname>
            ,
            <given-names>T.</given-names>
          </string-name>
          :
          <article-title>Distributed Representations of Sentences and Documents</article-title>
          .
          <source>Proceedings of the 31st International Conference on Machine Learning (ICML)</source>
          , Vol.
          <volume>14</volume>
          , pp.
          <fpage>1188</fpage>
          -
          <lpage>1196</lpage>
          (
          <year>2014</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref22">
        <mixed-citation>
          22.
          <string-name>
            <surname>Losada</surname>
            ,
            <given-names>D.E.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Crestani</surname>
            ,
            <given-names>F.</given-names>
          </string-name>
          :
          <article-title>A Test Collection for Research on Depression and Language Use</article-title>
          .
          <source>Experimental IR Meets Multilinguality, Multimodality, and Interaction: 7th International Conference of the CLEF Association</source>
          , pp.
          <fpage>28</fpage>
          -
          <lpage>39</lpage>
          . CLEF 2016, Évora, Portugal (
          <year>2016</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref23">
        <mixed-citation>
          23.
          <string-name>
            <surname>Losada</surname>
            ,
            <given-names>D.E.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Crestani</surname>
            ,
            <given-names>F.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Parapar</surname>
            ,
            <given-names>J.: eRISK</given-names>
          </string-name>
          <year>2017</year>
          :
          <article-title>CLEF Lab on Early Risk Prediction on the Internet: Experimental Foundations</article-title>
          .
          <source>Proceedings Conference and Labs of the Evaluation Forum CLEF</source>
          <year>2017</year>
          , Dublin, Ireland (
          <year>2017</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref24">
        <mixed-citation>
          24.
          <string-name>
            <surname>Maaten</surname>
          </string-name>
          , L.v.d.,
          <string-name>
            <surname>Hinton</surname>
          </string-name>
          , G.:
          <article-title>Visualizing Data Using t-SNE</article-title>
          .
          <source>Journal of Machine Learning Research</source>
          , Vol.
          <volume>9</volume>
          (
          <issue>Nov</issue>
          ), pp.
          <fpage>2579</fpage>
          -
          <lpage>2605</lpage>
          (
          <year>2008</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref25">
        <mixed-citation>
          25.
          <string-name>
            <surname>Manning</surname>
            ,
            <given-names>C.D.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Raghavan</surname>
            ,
            <given-names>P.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Schütze</surname>
            ,
            <given-names>H.</given-names>
          </string-name>
          :
          <article-title>An Introduction to Information Retrieval</article-title>
          .
          <source>Online Edition</source>
          . Cambridge University Press (
          <year>2009</year>
          ) Available from: https://nlp.stanford.edu/IR-book/pdf/irbookonlinereading.pdf - Accessed
          <source>on 2017- 04-21</source>
        </mixed-citation>
      </ref>
      <ref id="ref26">
        <mixed-citation>
          26.
          <string-name>
            <surname>Mikolov</surname>
            ,
            <given-names>T.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Chen</surname>
            ,
            <given-names>K.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Dean</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Corrado</surname>
            ,
            <given-names>G.</given-names>
          </string-name>
          :
          <article-title>Efficient Estimation of Word Representations in Vector Space</article-title>
          .
          <source>In Proceedings of Workshop at International Conference on Learning Representations ICLR</source>
          <year>2013</year>
          , arXiv preprint arXiv:
          <volume>1301</volume>
          .3781 (
          <year>2013</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref27">
        <mixed-citation>
          27.
          <string-name>
            <surname>Mikolov</surname>
            ,
            <given-names>T.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Sutskever</surname>
            ,
            <given-names>I.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Chen</surname>
            ,
            <given-names>K.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Corrado</surname>
            ,
            <given-names>G.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Dean</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          :
          <article-title>Distributed Representations of Words and Phrases and their Compositionality</article-title>
          .
          <source>Advances in Neural Information Processing Systems</source>
          , pp.
          <fpage>3111</fpage>
          -
          <lpage>3119</lpage>
          (
          <year>2013</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref28">
        <mixed-citation>
          28.
          <string-name>
            <surname>Mohammad</surname>
            ,
            <given-names>S.M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Turney</surname>
          </string-name>
          , P.D.:
          <article-title>Crowdsourcing a Word-Emotion Association Lexicon</article-title>
          .
          <source>Computational Intelligence</source>
          , Vol.
          <volume>29</volume>
          (
          <issue>3</issue>
          ), pp.
          <fpage>436</fpage>
          -
          <lpage>465</lpage>
          (
          <year>2013</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref29">
        <mixed-citation>
          29.
          <string-name>
            <surname>Nadeem</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Horn</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Coppersmith</surname>
            ,
            <given-names>G.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Sen</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          :
          <source>Identifying Depression on Twitter. arXiv preprint arXiv:1607.07384</source>
          (
          <year>2016</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref30">
        <mixed-citation>
          30.
          <string-name>
            <surname>Paltoglou</surname>
            ,
            <given-names>G.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Thelwall</surname>
            ,
            <given-names>M.:</given-names>
          </string-name>
          <article-title>A Study of Information Retrieval Weighting Schemes for Sentiment Analysis</article-title>
          .
          <source>Proceedings of the 48th Annual Meeting of the Association for Computational Linguistics</source>
          , pp.
          <fpage>1386</fpage>
          -
          <lpage>1395</lpage>
          . Association for Computational Linguistics (
          <year>2010</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref31">
        <mixed-citation>
          31.
          <string-name>
            <surname>Pedersen</surname>
            ,
            <given-names>T.</given-names>
          </string-name>
          :
          <article-title>Screening Twitter Users for Depression and PTSD with Lexical Decision Lists</article-title>
          .
          <source>Proceedings of the 2nd Workshop on Computational Linguistics and Clinical Psychology: From Linguistic Signal to Clinical Reality</source>
          , pp.
          <fpage>46</fpage>
          -
          <lpage>53</lpage>
          . Association for Computational Linguistics (
          <year>2015</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref32">
        <mixed-citation>
          32.
          <string-name>
            <surname>Pennington</surname>
          </string-name>
          J., Richard S., Manning C.D.:
          <article-title>GloVe: Global Vectors for Word Representation</article-title>
          .
          <source>Proceedings of the 2014 Conference on Empirical Methods in Natural Language Processing (EMNLP)</source>
          , pp.
          <fpage>1532</fpage>
          -
          <lpage>1543</lpage>
          (
          <year>2014</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref33">
        <mixed-citation>
          33.
          <string-name>
            <surname>Preoţiuc-Pietro</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Sap</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Schwartz</surname>
            ,
            <given-names>H.A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Ungar</surname>
            ,
            <given-names>L.</given-names>
          </string-name>
          :
          <article-title>Mental Illness Detection at the World Well-Being Project for the CLPsych 2015</article-title>
          <source>Shared Task Proceedings of the 2nd Workshop on Computational Linguistics and Clinical Psychology: From Linguistic Signal to Clinical Reality</source>
          , pp.
          <fpage>40</fpage>
          -
          <lpage>45</lpage>
          . Association for Computational Linguistics (
          <year>2015</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref34">
        <mixed-citation>
          34.
          <string-name>
            <surname>Řehůřek</surname>
            ,
            <given-names>R.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Sojka</surname>
            ,
            <given-names>P.</given-names>
          </string-name>
          :
          <article-title>Software Framework for Topic Modelling with Large Corpora</article-title>
          .
          <source>Proceedings of the LREC 2010 Workshop on New Challenges for NLP Frameworks</source>
          , pp.
          <fpage>45</fpage>
          -
          <lpage>50</lpage>
          (
          <year>2010</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref35">
        <mixed-citation>
          35.
          <string-name>
            <surname>Resnik</surname>
            ,
            <given-names>P.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Armstrong</surname>
            ,
            <given-names>W.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Claudino</surname>
            ,
            <given-names>L.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Nguyen</surname>
            ,
            <given-names>T.</given-names>
          </string-name>
          :
          <article-title>The University of Maryland CLPsych 2015 Shared Task System</article-title>
          .
          <source>Proceedings of the 2nd Workshop on Computational Linguistics and Clinical Psychology: From Linguistic Signal to Clinical Reality</source>
          , pp.
          <fpage>54</fpage>
          -
          <lpage>60</lpage>
          . Association for Computational Linguistics (
          <year>2015</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref36">
        <mixed-citation>
          36.
          <string-name>
            <surname>Rude</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Gortner</surname>
            ,
            <given-names>E.-M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Pennebaker</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          :
          <article-title>Language Use of Depressed and Depression-Vulnerable College Students</article-title>
          .
          <source>Cognition &amp; Emotion</source>
          , Vol.
          <volume>18</volume>
          (
          <issue>8</issue>
          ), pp.
          <fpage>1121</fpage>
          -
          <lpage>1133</lpage>
          (
          <year>2004</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref37">
        <mixed-citation>
          37.
          <string-name>
            <surname>Salton</surname>
            ,
            <given-names>G.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Buckley</surname>
            ,
            <given-names>C.</given-names>
          </string-name>
          :
          <article-title>Term-Weighting Approaches in Automatic Text Retrieval</article-title>
          .
          <source>Information Processing &amp; Management</source>
          , Vol.
          <volume>24</volume>
          (
          <issue>5</issue>
          ), pp.
          <fpage>513</fpage>
          -
          <lpage>523</lpage>
          (
          <year>1988</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref38">
        <mixed-citation>
          38.
          <string-name>
            <surname>Smirnova</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Sloeva</surname>
            ,
            <given-names>E.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Kuvshinova</surname>
            ,
            <given-names>N.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Krasnov</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Romanov</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Nosachev</surname>
            ,
            <given-names>G.</given-names>
          </string-name>
          :
          <article-title>Language Changes as an Important Psychopathological Phenomenon of Mild Depression</article-title>
          .
          <source>European Psychiatry</source>
          , Vol.
          <volume>28</volume>
          (
          <year>2013</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref39">
        <mixed-citation>
          39.
          <string-name>
            <surname>Tausczik</surname>
            ,
            <given-names>Y.R.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Pennebaker</surname>
            ,
            <given-names>J.W.:</given-names>
          </string-name>
          <article-title>The Psychological Meaning of Words: LIWC and Computerized Text Analysis Methods</article-title>
          .
          <source>Journal of Language and Social Psychology</source>
          , Vol.
          <volume>29</volume>
          (
          <issue>1</issue>
          ), pp.
          <fpage>24</fpage>
          -
          <lpage>54</lpage>
          (
          <year>2010</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref40">
        <mixed-citation>
          40.
          <string-name>
            <surname>Wu</surname>
            ,
            <given-names>H.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Gu</surname>
            ,
            <given-names>X.</given-names>
          </string-name>
          :
          <article-title>Reducing Over-Weighting in Supervised Term Weighting for Sentiment Analysis</article-title>
          .
          <source>The 25th International Conference on Computational Linguistics (COLING</source>
          <year>2014</year>
          ), pp.
          <fpage>1322</fpage>
          -
          <lpage>1330</lpage>
          (
          <year>2014</year>
          )
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>