<!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>
      <journal-title-group>
        <journal-title>X. Zeng, T. R. Martinez, Distribution-balanced stratified cross-validation for accuracy estima-
tion, Journal of Experimental &amp; Theoretical Artificial Intelligence</journal-title>
      </journal-title-group>
    </journal-meta>
    <article-meta>
      <article-id pub-id-type="doi">10.1007/978-1-4842-4470-8_20</article-id>
      <title-group>
        <article-title>MindwaveML at eRisk 2024: Identifying Depression Symptoms in Reddit Users</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Raluca M. Hanciu</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>Master in Data Science, University of Bucharest</institution>
          ,
          <addr-line>Bucharest</addr-line>
          ,
          <country country="RO">Romania</country>
        </aff>
      </contrib-group>
      <pub-date>
        <year>2022</year>
      </pub-date>
      <volume>12</volume>
      <issue>2000</issue>
      <fpage>1</fpage>
      <lpage>12</lpage>
      <abstract>
        <p>In this work, we tackle the first task of the eRisk Lab for 2024: analyzing Reddit comments to identify symptoms of depression. Our objective is to use information collected from Reddit's various user communities to identify sentiments associated with symptoms of depression listed in the BDI-II questionnaire. As a place where people may openly discuss ideas and experiences, Reddit provides a unique perspective on how people express themselves, including their dificulties with mental health. Through utilizing this content created by users, we hope to bring to light how depression presents itself in digital environments.</p>
      </abstract>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>1. Introduction</title>
      <p>
        Millions of people worldwide sufer from depression, a widespread mental health illness that raises
serious public health concerns [
        <xref ref-type="bibr" rid="ref1">1</xref>
        ]. The amount of cases of depression has increased in the fast-paced,
globally connected society of today, where social demands and stressors are prevalent. Numerous
causes, such as higher expectations at work, unstable economy state, loneliness, and the widespread
efect of social media, are contributing to this trend [
        <xref ref-type="bibr" rid="ref2 ref3">2, 3</xref>
        ].
      </p>
      <p>
        Early detection of depression is critical since it allows for prompt support and care for those who are
afected. But conventional diagnosis techniques frequently depend on patients’ self-reported symptoms
during professional evaluations, which can be arbitrary and vulnerable to underreporting because of
stigma or ignorance [
        <xref ref-type="bibr" rid="ref4">4</xref>
        ]. Because of this, a large number of depression patients remain undetected or
untreated, resulting in severe outcomes and ongoing sufering for the individuals.
      </p>
      <p>
        Through the use of artificial intelligence (AI) algorithms to examine social media information,
researchers can find hidden patterns and possibly even diagnose depression. These realizations can
guide the creation of support networks, preventative initiatives, and treatments that are suited to the
requirements of those who are at risk [
        <xref ref-type="bibr" rid="ref5">5</xref>
        ]. Moreover, by providing scalable and afordable alternatives
to conventional diagnostic techniques, AI-driven technologies have the potential to widen access to
mental health care [
        <xref ref-type="bibr" rid="ref5">5</xref>
        ].
      </p>
      <p>
        eRisk seeks to close the gap among research and practice by arranging shared tasks and provide a
place for practitioners and researchers to work together to create eficient early risk detection. eRisk is
dedicated to utilizing digital data in order to facilitate the creation of solutions that are both scalable
and easily accessible, with the ultimate goal of improving the lives of those who are dealing with mental
health concerns [
        <xref ref-type="bibr" rid="ref6 ref7">6, 7</xref>
        ].
      </p>
      <p>
        Under the eRisk system, we focus on the first task for 2024, which aims to identify depressive
symptoms from user-generated content. This involves ranking sentences from a sample of Reddit user
postings based on their relevance to depressive symptoms. Participants are tasked with providing
rankings for the 21 symptoms outlined in the Beck Depression Inventory (BDI) questionnaire [
        <xref ref-type="bibr" rid="ref6">6</xref>
        ].
      </p>
      <p>
        The Beck Depression Inventory (BDI) is a widely used self-report questionnaire carefully constructed
to assess the intensity of depression symptoms. Each one of the 21 items depicts a diferent depression
symptom, and participants rate their level of experience with each symptom during a certain time
period [
        <xref ref-type="bibr" rid="ref8">8</xref>
        ]. In the given setting of this task, a sentence is regarded as relevant to a BDI symptom when
it ofers information about how the user is feeling with respect to that symptom. Therefore, a sentence
can still be considered significant even if it suggests that the user does not have the symptom [
        <xref ref-type="bibr" rid="ref6">6</xref>
        ].
      </p>
    </sec>
    <sec id="sec-2">
      <title>2. Related Work</title>
      <p>
        The first task in eRisk 2024 is an extension of the one in 2023. In 2023, the goal has been similar to this
year: score sentences from a selection of user writings based on their relevance to a depressive symptom
[
        <xref ref-type="bibr" rid="ref9">9</xref>
        ]. The participants will have to rank the 21 indicators of depression from the BDI Questionnaire.
      </p>
      <p>
        FormulaML’s approach to eRisk 2023 included preprocessing and encoding the dataset with Sentence
Transformers, namely the MiniLM-L3-v2 model. They used the BDI-II questionnaire as a query,
computed cosine similarity scores, and applied weighted scoring to assess sentence relevance. This strategy
allowed for a complete investigation of symptoms recognition and similarity assessment [
        <xref ref-type="bibr" rid="ref10">10</xref>
        ].
      </p>
      <p>
        OBSER-MENH compared texts and symptoms using Sentence Transformers (ST), which convert them
into fixed-sized vectors. They used pre-trained models such as BERT to build these vectors, which can
represent phrases in a dense vector space. For example, the all-mpnet-base-v2 model converts phrases
into 768-dimensional vectors, whereas the all-distilroberta-v1 model is trained on a large dataset using
the distilroberta-base model. They also employed the all-MiniLM-L12-v2 model [
        <xref ref-type="bibr" rid="ref11">11</xref>
        ].
      </p>
      <p>
        BLUE team used an approach inspired by current research to enhance data using LLMs, creating
synthetic Reddit posts associated with every BDI-II symptom to increase dataset diversity. While
they expected that adding more diverse data would improve results, their findings revealed that the
model using original BDI-II responses outperformed the model using produced data. They emphasized
the problem of the specificity of ChatGPT data and proposed improving prompts for semantically
comparable but heterogeneous material. Despite this, they acknowledged the useful character of the
created text and pointed out the potential of LLMs to generate mental health data for future research
[
        <xref ref-type="bibr" rid="ref12">12</xref>
        ].
      </p>
      <p>In 2023, Formula-ML received the top scores across all parameters, followed by OBSER-MENH and
then the BLUE team. In total there were 10 participating teams.</p>
    </sec>
    <sec id="sec-3">
      <title>3. Dataset</title>
      <p>Regarding the dataset utilized in this study, it comprised two main folders: one containing the training
data and the other the test data. Within the training data folder, a subfolder contained a total of 3107
TREC files, each file representing a distinct user.</p>
      <p>Furthermore, the training folder encompassed two CSV files containing subsets of ’docnos’ and
corresponding labels categorized by query. One CSV file documented labels assigned by the majority of
annotators for each ’docno,’ while the other recorded consensus labels. In the former, a ’1’ label signified
agreement among at least two out of three annotators regarding the text’s relevance, whereas in the
latter, a ’1’ indicated unanimous agreement among all three annotators or disagreement among them.</p>
      <p>Notably, the aggregated texts from all TREC files in the training set totaled approximately 4.2 million,
illustrating that the annotated data represented only a fraction of the entire corpus. This disparity is
expected, given the substantial volume of texts that are unrelated to any of the queries.</p>
      <p>It is also important to note the inclusion of the test dataset folder, which has the same structure as
the training dataset. This folder contains 553 TREC files, each with numerous sentences similar to the
training dataset. These files are critical for evaluating the performance of models trained on the training
dataset, since they allow us to analyze generalization capabilities and model eficacy on previously
encountered data. This thorough assessment procedure guarantees the model’s predictive potential is
strong and reliable, hence improving the general quality and validity of the study’s results.</p>
    </sec>
    <sec id="sec-4">
      <title>4. Method</title>
      <sec id="sec-4-1">
        <title>4.1. Feature Engineering</title>
        <sec id="sec-4-1-1">
          <title>4.1.1. Cosine Similarity</title>
          <p>
            Capturing semantic nuances in natural language processing (NLP) presents a major challenge due to
language’s innate complexity and ambiguity [
            <xref ref-type="bibr" rid="ref13">13</xref>
            ]. To solve this dificulty, several techniques have been
developed, each with its own set of strengths and limitations. One typical technique is to use pre-trained
language models, that were developed and fine-tuned on large amounts of text data, to learn complicated
syntax and semantic correlations [
            <xref ref-type="bibr" rid="ref14">14</xref>
            ]. Hugging Face ofers such a pre-trained language model called
paraphrase-MiniLM-L12-v2 [
            <xref ref-type="bibr" rid="ref15">15</xref>
            ]. This model distinguishes itself by focusing on paraphrase detection,
which entails detecting pairs of phrases that contain the same idea but are expressed diferently. By
training on a variety of paraphrase data sets, the paraphrase-MiniLM-L12-v2 model has gained a
thorough understanding of semantic equivalency, allowing it to build embeddings that successfully
represent semantic similarities between text sections [
            <xref ref-type="bibr" rid="ref15 ref16">15, 16</xref>
            ].
          </p>
          <p>
            The major goal of this newly designed feature is to compute cosine similarity scores for Beck
Depression Inventory (BDI) symptoms and dataset sentences. Cosine similarity is a frequently employed
measure in NLP that assesses the similarity of two vectors by calculating the cosine of their angle
[
            <xref ref-type="bibr" rid="ref17">17</xref>
            ]. By computing cosine similarity scores, we hope to obtain the semantic similarity between BDI
symptoms and dataset sentences, efectively reflecting the degree of resemblance between them.
          </p>
          <p>
            The four alternative responses to each of the 21 BDI symptoms are encoded into dense embeddings
using the paraphrase-MiniLM-L12-v2 model. These embeddings capture the semantic information
contained in each response, converting textual data into high-dimensional vector representations [
            <xref ref-type="bibr" rid="ref15">15</xref>
            ].
The sentences are also encoded with paraphrase-MiniLM-L12-v2, and the cosine similarity of each text
to its associated query responses is determined. In other words, for each paragraph, there would be
four cosine similarities, one for each possible response to the query symptom. I used np.max to get
the maximum out of these 4 similarities and used it as a feature, because a text would be deemed as
relevant no matter how severe they experience the specific symptom.
          </p>
        </sec>
        <sec id="sec-4-1-2">
          <title>4.1.2. First Person</title>
          <p>Apart from the fact that a sentence is relevant even if the person afirms they don’t have that symptom,
a text is only relevant if it is talking about the user only, so:
• A text such as “ I feel sad lately” would be labeled as 1 for the first BDI query which is ‘sadness’,
but
• A text such as “ My sister is very sad”/ “that is sad”, would be label 0 as it is not written from a
subjective point of view</p>
          <p>As this is an important aspect of our texts, I have created an additional feature called “first_person”
which can get values of 0 or 1. If in that specific text there are pronouns such as: [’i’, ’me’, ’my’, ’mine’,
’myself’, ’im’], then it would be relevant for this new feature.</p>
          <p>However, there are many sentences written in first person that actually are irrelevant for a specific
query, such as this one: “im sure that symbolizes loneliness” labeled 0 for query 1, which denotes
sadness.</p>
          <p>To balance this impediment, I have added a condition to this “first_person” feature to only be labeled
as 1 if there any of those pronouns are present in the text AND also the cosine similarity is greater than
0.4 for that query.</p>
        </sec>
      </sec>
      <sec id="sec-4-2">
        <title>4.2. Algorithms</title>
        <p>
          In the beginning phase of my research, I undertook a thorough review of numerous machine learning
models to establish a performance baseline. I specifically explored with models known for their
computing eficiency, such as Logistic Regression, MLPClassifier, DecisionTreeClassifier, and ensemble
models such as GradientBoostingClassifier, XGBClassifier, and LGBMClassifier. My motivation for
choosing those models was for a couple of reasons: computational eficiency and the possibility to
provide first glimpses into the dataset’s features [
          <xref ref-type="bibr" rid="ref18">18</xref>
          ].
        </p>
        <p>Given the fact that Logistic Regression and MLPClassifier were the top performers according to
f1_score at this point in my research, I have decided to continue working with these two models in my
future undertakings.</p>
        <p>The dataset has been split into training and testing subsets using StratifiedKFold, which preserves
class distributions. This splitting approach preserves the consistency of the evaluation process by
reducing biases and increasing the reliability of the outcomes [19].</p>
        <p>In each iteration, the model’s hyperparameters are fine-tuned using a GridSearchCV pipeline. This
pipeline systematically investigates a variety of configurations contained within the parameter grid
[20], including for example for MLPClassifier parameters such as: hidden_layer_sizes, alpha, and
learning_rate_init [21], and for LogisticRegression: C, penalty [22]. Its major goal is to determine the
ideal parameters that result in the highest F1 results.</p>
        <p>A key component of the pipeline is the RandomOverSampler, a mechanism used to solve class
imbalance. This approach works by oversampling minority class instances within each fold, which
corrects the dataset’s disproportionate distribution of class labels [23]. By boosting the proportion
of minority class samples, the RandomOverSampler helps ensure the model is trained on a more
balanced dataset, lowering the risk of biased predictions and improving the classification model’s overall
performance.</p>
        <p>Utilizing joblib, I’ve preserved the models that demonstrated the highest F1 scores across all five
folds for each individual query. Given the performance variations between Logistic Regression and
MLPClassifier across diferent query contexts, I’ve made the decision to retain both models for future
use in making predictions on the test dataset. This approach ensures that we can leverage the strengths
of each model depending on the specific characteristics and complexities of the queries encountered
during testing, thus optimizing our predictive capabilities and ensuring robustness in our analysis.</p>
        <p>I submitted three entries structured as follows:
1. The first submission served as a benchmark to gauge the performance of my models. For this
submission, I exclusively relied on the cosine similarity scores generated by the
paraphraseMiniLM-L12-v2 model. These scores were arranged in descending order for each query, and only
the top 1000 scores per query were considered.
2. In the second submission, I utilized the probability scores outputted by my algorithms for each
query. Depending on the query, I selected either MLPClassifier or Logistic Regression, based on
their respective performance during the training phase. Subsequently, I computed the mean of
the cosine similarity score and the algorithm’s probability score per query.
3. The third and final submission employed both MLP and Logistic Regression models per query,
determined by their superior performance during training. However, a distinctive feature of this
submission was the utilization of diferent thresholds to generate scores:
• For queries with an F1 score ranging between 0.60 and 0.75, the new relevance score was
computed as:</p>
        <p>0.3 × prediction_probability + 0.7 × cosine_similarity_score
• Queries with an F1 score between 0.75 and 0.85 utilized a relevance score calculated as:
0.5 × prediction_probability + 0.5 × cosine_similarity_score
• For queries achieving an F1 score between 0.85 and 0.95, the relevance score was determined
as:</p>
        <p>0.7 × prediction_probability + 0.3 × cosine_similarity_score</p>
      </sec>
    </sec>
    <sec id="sec-5">
      <title>5. Results</title>
      <p>In the presented tables we can see the outcomes of our team compared with the results of the team/teams
that performed best, determined through voting by the annotators. Table 1 delineates the system
performance rankings derived from a majority voting perspective, while Table 2 provides rankings
based on unanimity among all three annotators.</p>
      <p>Upon comparing the proposed methodologies, notable performance enhancements were observed
with the approach integrating varied weights for cosine similarity and the probability score generated
by the classification algorithm. Notably, the system named "MindwaveMLMiniLML12MLP_weighted"
exhibited the highest performance, closely followed by "MindwaveMLMiniLML12MLP_0.5," which
computed the mean between the probability score and cosine similarity. In contrast,
"MindwaveMLMiniLML12" served as our comparative baseline. These findings afirm that while the
improvements were not groundbreaking, the approach demonstrated eficacy by yielding higher scores in
comparison to the baseline method.</p>
    </sec>
    <sec id="sec-6">
      <title>6. Conclusions</title>
      <p>In this research we have proposed an approach of ranking sentences based on their relevance to 21
depression symptoms derived from the Beck Depression Inventory (BDI) questionnaire.</p>
      <p>Results from the evaluation process revealed insights into the performance of the developed
computational models. Notably, models incorporating a weighted combination of cosine similarity scores and
probability outputs from classification algorithms demonstrated superior performance compared to
baseline approaches.</p>
      <p>Feature engineering is one area that might benefit from some improvements. Further research into
more complex methods for obtaining significant characteristics from textual data may result in more
accurate depictions of the underlying semantics.</p>
      <p>Experimenting with ensemble learning techniques may also yield further insights for improving
system performance. Ranking results may be more reliable and robust if several models are combined
and their combined intelligence is utilized [24]. Furthermore, examining domain strategies specifically
designed for textual data related to depression may aid in bridging the gap between general pre-trained
models and the particular demands of mental health domain tasks.</p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          [1]
          <string-name>
            <given-names>W. H.</given-names>
            <surname>Organization</surname>
          </string-name>
          ,
          <source>Depressive disorder (depression)</source>
          ,
          <year>2023</year>
          . URL: https://www.who.int/news-room/ fact-sheets/detail/depression.
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          [2]
          <string-name>
            <given-names>J. F.</given-names>
            <surname>Greden</surname>
          </string-name>
          ,
          <article-title>The burden of recurrent depression: causes, consequences, and future prospects</article-title>
          ,
          <source>Journal of Clinical Psychiatry</source>
          <volume>62</volume>
          (
          <year>2001</year>
          )
          <fpage>5</fpage>
          -
          <lpage>9</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          [3]
          <string-name>
            <given-names>S.</given-names>
            <surname>Cunningham</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C. C.</given-names>
            <surname>Hudson</surname>
          </string-name>
          ,
          <string-name>
            <given-names>K.</given-names>
            <surname>Harkness</surname>
          </string-name>
          ,
          <article-title>Social media and depression symptoms: a metaanalysis</article-title>
          ,
          <source>Research on Child and Adolescent Psychopathology</source>
          <volume>49</volume>
          (
          <year>2021</year>
          )
          <fpage>241</fpage>
          -
          <lpage>253</lpage>
          . URL: https: //doi.org/10.1007/s10802-020-00715-7. doi:
          <volume>10</volume>
          .1007/s10802-020-00715-7.
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          [4]
          <string-name>
            <given-names>A.</given-names>
            <surname>Handy</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R.</given-names>
            <surname>Mangal</surname>
          </string-name>
          ,
          <string-name>
            <given-names>T. S.</given-names>
            <surname>Stead</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R. L.</given-names>
            <surname>Jr Cofee</surname>
          </string-name>
          , L. Ganti ,
          <article-title>Prevalence and impact of diagnosed and undiagnosed depression in the united states</article-title>
          ,
          <source>Cureus</source>
          <volume>14</volume>
          (
          <issue>8</issue>
          ) (
          <year>2022</year>
          ). doi:
          <volume>10</volume>
          .7759/cureus.28013.
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          [5]
          <string-name>
            <given-names>F.</given-names>
            <surname>Zafar</surname>
          </string-name>
          ,
          <string-name>
            <given-names>L. Fakhare</given-names>
            <surname>Alam</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R. R.</given-names>
            <surname>Vivas</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Wang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S. J.</given-names>
            <surname>Whei</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Mehmood</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Sadeghzadegan</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Lakkimsetti</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Z.</given-names>
            <surname>Nazir</surname>
          </string-name>
          ,
          <article-title>The role of artificial intelligence in identifying depression and anxiety: A comprehensive literature review</article-title>
          ,
          <source>Cureus</source>
          <volume>16</volume>
          (
          <issue>3</issue>
          ) (
          <year>2024</year>
          ). doi:
          <volume>10</volume>
          .7759/cureus.564723.
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          [6]
          <string-name>
            <given-names>J.</given-names>
            <surname>Parapar</surname>
          </string-name>
          ,
          <string-name>
            <given-names>P. M.</given-names>
            <surname>Rodilla</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D. E.</given-names>
            <surname>Losada</surname>
          </string-name>
          ,
          <string-name>
            <given-names>F.</given-names>
            <surname>Crestani</surname>
          </string-name>
          , Overview of erisk 2024:
          <article-title>Early risk prediction on the internet</article-title>
          ,
          <source>in: Experimental IR Meets Multilinguality, Multimodality, and Interaction. 15th International Conference of the CLEF Association, CLEF 2024</source>
          , Springer International,
          <year>2024</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          [7]
          <string-name>
            <given-names>J.</given-names>
            <surname>Parapar</surname>
          </string-name>
          ,
          <string-name>
            <given-names>P.</given-names>
            <surname>Martín-Rodilla</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D. E.</given-names>
            <surname>Losada</surname>
          </string-name>
          ,
          <string-name>
            <given-names>F.</given-names>
            <surname>Crestani</surname>
          </string-name>
          , Overview of erisk 2024:
          <article-title>Early risk prediction on the internet (extended overview)</article-title>
          ,
          <source>in: Working Notes of the Conference and Labs of the Evaluation Forum CLEF</source>
          <year>2024</year>
          , Grenoble, France,
          <source>September 9th to 12th</source>
          ,
          <year>2024</year>
          , CEUR Workshop Proceedings,
          <year>2024</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          [8]
          <string-name>
            <given-names>J.</given-names>
            <surname>Upton</surname>
          </string-name>
          ,
          <source>Beck Depression Inventory (BDI)</source>
          , Springer New York, New York, NY,
          <year>2013</year>
          , pp.
          <fpage>178</fpage>
          -
          <lpage>179</lpage>
          . URL: https://doi.org/10.1007/978-1-
          <fpage>4419</fpage>
          -1005-9_
          <fpage>441</fpage>
          . doi:
          <volume>10</volume>
          .1007/978-1-
          <fpage>4419</fpage>
          -1005-9_
          <fpage>441</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          [9]
          <string-name>
            <given-names>J.</given-names>
            <surname>Parapar</surname>
          </string-name>
          ,
          <string-name>
            <given-names>P.</given-names>
            <surname>Martín-Rodilla</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D. E.</given-names>
            <surname>Losada</surname>
          </string-name>
          ,
          <string-name>
            <given-names>F.</given-names>
            <surname>Crestani</surname>
          </string-name>
          , Overview of erisk 2023:
          <article-title>Early risk prediction on the internet</article-title>
          ,
          <source>in: Experimental IR Meets Multilinguality, Multimodality, and Interaction. 14th International Conference of the CLEF Association, CLEF 2023</source>
          , Springer International Publishing, Thessaloniki, Greece,
          <year>2023</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          [10]
          <string-name>
            <given-names>N.</given-names>
            <surname>Recharla</surname>
          </string-name>
          ,
          <string-name>
            <given-names>P.</given-names>
            <surname>Bolimera</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y.</given-names>
            <surname>Gupta</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A. K.</given-names>
            <surname>Madasamy</surname>
          </string-name>
          ,
          <article-title>Exploring depression symptoms through similarity methods in social media posts</article-title>
          ,
          <source>in: CLEF (Working Notes)</source>
          ,
          <year>2023</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref11">
        <mixed-citation>
          [11]
          <string-name>
            <given-names>J.</given-names>
            <surname>Martinez-Romo</surname>
          </string-name>
          ,
          <string-name>
            <given-names>L.</given-names>
            <surname>Araujo</surname>
          </string-name>
          ,
          <string-name>
            <given-names>X.</given-names>
            <surname>Larrayoz</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Oronoz</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Pérez</surname>
          </string-name>
          , Obser-menh at erisk 2023:
          <article-title>Deep learning-based approaches for symptom detection in depression and early identification of pathological gambling indicators</article-title>
          ,
          <source>in: CLEF (Working Notes)</source>
          ,
          <year>2023</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref12">
        <mixed-citation>
          [12]
          <string-name>
            <surname>A.-M. Bucur</surname>
          </string-name>
          ,
          <article-title>Utilizing chatgpt generated data to retrieve depression symptoms from social media</article-title>
          ,
          <source>in: CLEF (Working Notes)</source>
          ,
          <year>2023</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref13">
        <mixed-citation>
          [13]
          <string-name>
            <given-names>E.</given-names>
            <surname>Gabrilovich</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Markovitch</surname>
          </string-name>
          ,
          <article-title>Wikipedia-based semantic interpretation for natural language processing</article-title>
          ,
          <source>Journal of Artificial Intelligence Research</source>
          <volume>34</volume>
          (
          <year>2009</year>
          )
          <fpage>443</fpage>
          -
          <lpage>498</lpage>
          . URL: https://doi.org/10. 1613/jair.2669. doi:
          <volume>10</volume>
          .1613/jair.2669.
        </mixed-citation>
      </ref>
      <ref id="ref14">
        <mixed-citation>
          [14]
          <string-name>
            <given-names>H.</given-names>
            <surname>Wang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Li</surname>
          </string-name>
          ,
          <string-name>
            <given-names>H.</given-names>
            <surname>Wu</surname>
          </string-name>
          , E. Hovy,
          <string-name>
            <given-names>Y.</given-names>
            <surname>Sun</surname>
          </string-name>
          ,
          <article-title>Pre-trained language models and their applications</article-title>
          ,
          <source>Engineering</source>
          <volume>25</volume>
          (
          <year>2023</year>
          )
          <fpage>51</fpage>
          -
          <lpage>65</lpage>
          . URL: https://www.sciencedirect.com/science/article/pii/ S2095809922006324. doi:https://doi.org/10.1016/j.eng.
          <year>2022</year>
          .
          <volume>04</volume>
          .024.
        </mixed-citation>
      </ref>
      <ref id="ref15">
        <mixed-citation>
          [15]
          <string-name>
            <given-names>N.</given-names>
            <surname>Reimers</surname>
          </string-name>
          ,
          <string-name>
            <surname>I. Gurevych</surname>
          </string-name>
          ,
          <article-title>Sentence-bert: Sentence embeddings using siamese bert-networks</article-title>
          ,
          <source>in: Proceedings of the 2019 Conference on Empirical Methods in Natural Language Processing, Association for Computational Linguistics</source>
          ,
          <year>2019</year>
          . URL: http://arxiv.org/abs/
          <year>1908</year>
          .10084.
        </mixed-citation>
      </ref>
      <ref id="ref16">
        <mixed-citation>
          [16]
          <string-name>
            <given-names>N.</given-names>
            <surname>Reimers</surname>
          </string-name>
          ,
          <string-name>
            <surname>I. Gurevych</surname>
          </string-name>
          ,
          <article-title>Sentence-bert: Sentence embeddings using siamese bert-networks</article-title>
          ,
          <source>in: Proceedings of the 2019 Conference on Empirical Methods in Natural Language Processing, Association for Computational Linguistics</source>
          ,
          <year>2019</year>
          . URL: http://arxiv.org/abs/
          <year>1908</year>
          .10084.
        </mixed-citation>
      </ref>
      <ref id="ref17">
        <mixed-citation>
          [17]
          <string-name>
            <given-names>B.</given-names>
            <surname>Li</surname>
          </string-name>
          , L. Han,
          <article-title>Distance weighted cosine similarity measure for text classification</article-title>
          , in: H.
          <string-name>
            <surname>Yin</surname>
            ,
            <given-names>K.</given-names>
          </string-name>
          <string-name>
            <surname>Tang</surname>
            ,
            <given-names>Y.</given-names>
          </string-name>
          <string-name>
            <surname>Gao</surname>
            ,
            <given-names>F.</given-names>
          </string-name>
          <string-name>
            <surname>Klawonn</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          <string-name>
            <surname>Lee</surname>
            ,
            <given-names>T.</given-names>
          </string-name>
          <string-name>
            <surname>Weise</surname>
            ,
            <given-names>B.</given-names>
          </string-name>
          <string-name>
            <surname>Li</surname>
            ,
            <given-names>X.</given-names>
          </string-name>
          Yao (Eds.),
          <source>Intelligent Data Engineering and Automated Learning - IDEAL 2013</source>
          , Springer Berlin Heidelberg, Berlin, Heidelberg,
          <year>2013</year>
          , pp.
          <fpage>611</fpage>
          -
          <lpage>618</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref18">
        <mixed-citation>
          [18]
          <string-name>
            <given-names>L.</given-names>
            <surname>Shkurti</surname>
          </string-name>
          ,
          <string-name>
            <given-names>F.</given-names>
            <surname>Kabashi</surname>
          </string-name>
          ,
          <string-name>
            <given-names>V.</given-names>
            <surname>Sofiu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Susuri</surname>
          </string-name>
          ,
          <article-title>Performance comparison of machine learning algorithms for albanian news articles</article-title>
          ,
          <source>IFAC-PapersOnLine</source>
          <volume>55</volume>
          (
          <year>2022</year>
          )
          <fpage>292</fpage>
          -
          <lpage>295</lpage>
          . URL: https://www.
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>