<!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>October</journal-title>
      </journal-title-group>
    </journal-meta>
    <article-meta>
      <title-group>
        <article-title>Depression and Anxiety Diagnosis Using Unsupervised Learning Approach</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Martín Di Felice</string-name>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Ariel Deroche</string-name>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Ilan Trupkin</string-name>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Parag Chatterjee</string-name>
        </contrib>
        <contrib contrib-type="author">
          <string-name>María F. Pollo-Cattaneo</string-name>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Universidad Tecnológica Nacional</string-name>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Buenos Aires</string-name>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Argentina</string-name>
        </contrib>
      </contrib-group>
      <pub-date>
        <year>2023</year>
      </pub-date>
      <volume>2</volume>
      <fpage>6</fpage>
      <lpage>28</lpage>
      <abstract>
        <p>With the increasing impact of artificial intelligence in the domain of healthcare, unsupervised learning techniques have been in discussion for the detection of hidden patterns or relationships between diferent data features. The domain of mental health is no exception. This paper presents an unsupervised machine learning approach to analyze the presence of depression and anxiety. It presents unsupervised models to analyze depression based on depression-related data of a student cohort containing demographic and academic data along with depression information collected through the Beck Depression Inventory questionnaire, in addition to scores such as the PHQ (Patient Health Questionnaire) score, GAD (Generalized Anxiety Disorder) score, and Epworth score, which provide insights into the severity and impact of depressive symptoms, anxiety symptoms, and daytime sleepiness, respectively. The methodology involves data collection and preparation, feature selection, modeling, anomaly detection, and analysis of the relationships between diferent features.</p>
      </abstract>
      <kwd-group>
        <kwd>eol&gt;Artificial Intelligence</kwd>
        <kwd>Depression</kwd>
        <kwd>Mental Health</kwd>
        <kwd>Unsupervised Learning</kwd>
      </kwd-group>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>1. Introduction</title>
      <p>
        Depression, or depressive disorder, is a common mental health disorder that afects around
4% of the world population1. It can afect people of any age and its main symptoms are mood
changes, loss of interest in daily activities, and sleep and appetite alterations among others2.
It was studied that mood disorders, including diferent types of depression, are one of the
most common comorbidities found among people who commit suicide [
        <xref ref-type="bibr" rid="ref1">1</xref>
        ]. Anxiety is another
mental health disorder characterized by a significant disturbance in an individual’s cognition,
emotional regulation, or behavior, which generally causes excessive fear and worry3. Along
with depression, it is one of the most prevalent mental disorders4. On the other hand, Artificial
Intelligence [
        <xref ref-type="bibr" rid="ref2">2</xref>
        ] (AI) is a branch of computer science that has become more relevant over the
recent years in the domain of healthcare because of its ability to deal with problems that usually
were left on human hands. There are plenty of diferent techniques and algorithms that can
be considered part of the AI universe, but this study focuses on a particular set: unsupervised
learning methods. Unsupervised learning [
        <xref ref-type="bibr" rid="ref3">3</xref>
        ] uses algorithms to analyze and segment unlabeled
data sets into clusters. These algorithms discover hidden data clusters or patterns without
human intervention.
      </p>
      <p>
        Unsupervised learning makes sense when only the input data is known, and no output data
corresponds to a given input. That is, only the structure of the data can be described, to try to find
some pattern that simplifies the analysis. Clustering looks for groupings based on similarities,
but nothing guarantees that these have any meaning. When discussing clustering techniques,
one of the most popular techniques is the K-Means [
        <xref ref-type="bibr" rid="ref4">4</xref>
        ] algorithm, which is a clustering method
that aims at partitioning a set of n observations into k groups in which each observation belongs
to the group whose mean value is closest. According to those mentioned above, one of the
main activities to be mentioned within the framework of artificial intelligence and unsupervised
algorithms is anomaly detection, a process by which the characteristics or elements out of the
common denominator are identified. In this way, it is possible to recognize new patterns with
such out-of-the-ordinary behavior [
        <xref ref-type="bibr" rid="ref5 ref6">5, 6</xref>
        ]. Although machine learning methods are increasing
their participation in mental health-related problems, the majority of these approaches use
supervised learning techniques [
        <xref ref-type="bibr" rid="ref7">7</xref>
        ], so, even there exist studies that use unsupervised learning
techniques to approach these kinds of problems [
        <xref ref-type="bibr" rid="ref10 ref11 ref12 ref8 ref9">8, 9, 10, 11, 12</xref>
        ], it is worth it to include this
kind of algorithms which can help to face the problem from a diferent angle.
      </p>
      <p>In this context, the objective of this paper is to use unsupervised modeling to analyze if
the cohorts could be separated into diferent groups with distinguishing risk factors of the
depression and anxiety dataset named "Depression and anxiety data" built by Shahzad 5 which
focuses on college students. Although a dataset presents labeled data, the study does not
use it because it aims to find hidden relationships among their values to gain better insights
about depression and/or anxiety diagnoses. Besides this primary goal, a secondary objective
is to analyze the relationships between the features and their impact on the development of
distinguishing risk profiles in the cohorts.</p>
      <p>
        The final goal of such research is to generate a model that could be included as a part of
a decision support system capable of diagnosing mental health diseases such as depression
or anxiety. A Clinical Decision Support System (CDSS) is a software tool that is designed to
help healthcare professionals make decisions by giving personalized information about their
patients[
        <xref ref-type="bibr" rid="ref13">13</xref>
        ]. The insights generated by this research are meant to be used as the basis for
generating the models that given input in the form of patient data similar to the presented in
the studied dataset can output probabilities about the patient belonging or not to a risk group.
This paper introduces the definition of the methodology used and the results obtained, together
with a comparative summary of the methods used, to finally present the conclusions and future
4Diagnostic and Statistical Manual of Mental Disorders. https://dsm.psychiatryonline.org/doi/book/10.1176/
appi.books.9780890425787
      </p>
      <p>5Depression and anxiety data. https://www.kaggle.com/datasets/shahzadahmad0402/
depression-and-anxiety-data
lines of work.</p>
    </sec>
    <sec id="sec-2">
      <title>2. Methodology</title>
      <p>To achieve the proposed objective the programming language Python and its set of machine
learning libraries are used, applying unsupervised learning modules of clustering and anomaly
detection over the mentioned dataset. The mentioned dataset contains 783 records. Their
characteristics are described below in Table 1.</p>
      <p>
        To eliminate bias, and find the relationship between the diferent characteristics, the columns
"Depression diagnosis" and "Anxiety Diagnosis" were eliminated from the dataset for both
kinds of analyses. The data gathered here include age and body mass index information along
with results from several psychological questionnaires: the Beck Depression Inventory6 (a
standardized method used to determine depression levels), the Beck Anxiety Inventory7 (an
analogous technique used to detect anxiety), the Patient Health Questionnaire (PHQ) [
        <xref ref-type="bibr" rid="ref14">14</xref>
        ]
(another depression diagnosis test which can help to determine depression levels over the
last two weeks), the Generalized Anxiety Disorder Assessment (GAD)[
        <xref ref-type="bibr" rid="ref15">15</xref>
        ] (technique used to
determine anxiety levels) and the Epworth Questionnaire [
        <xref ref-type="bibr" rid="ref16">16</xref>
        ] (another test which can help
determine sleepiness during daytime).
      </p>
      <p>The process continues with the data preprocessing, which includes the elimination of null and
duplicate values, and finally, with the data normalization using the Standard Scaling technique.
Then it continues with the clustering process described in the following section, and, finally,
the introduction of anomaly detection methods to see if it improves clustering results.</p>
      <sec id="sec-2-1">
        <title>2.1. Clustering</title>
        <p>
          Clustering is one of the most important areas within the unsupervised machine learning domain.
The purpose of this process is to achieve the grouping of unlabeled data sets and to build subsets
of data known as clusters. This way, each cluster within a network is formed by a collection
of data similar to each other but having diferential elements concerning others. This type of
process is applied to unsupervised models, allowing data to be segmented into groups of similar
dimensions. After obtaining the pre-processed dataset, a technique is used to determine the
optimal number of clusters that will eventually be assigned using the K-Means algorithm. The
method used to determine the optimal amount of clusters is the Silhouette, which measures the
quality of clustering, using the separation distance between them. It tells us how close each
point in a cluster is to points in neighboring clusters. This distance measure is in the range
[
          <xref ref-type="bibr" rid="ref1">-1, 1</xref>
          ]. A high value indicates good clustering since it is far away from neighboring clusters. A
negative value indicates that the sample might be assigned to the wrong cluster[
          <xref ref-type="bibr" rid="ref17 ref18">17, 18</xref>
          ]. For
each one of the dataset versions, the Silhouette average value is calculated for a range of 2 to 10
clusters to see which performs better. Then the diferent clusters are analyzed to see how their
values are close to the Silhouette average value.
        </p>
        <p>6Beck Depression Inventory (BDI). https://www.apa.org/pi/about/publications/caregivers/practice-settings/
assessment/tools/beck-depression
7Beck Anxiety Inventory. https://www.zotero.org/google-docs/?yIRpC0</p>
        <sec id="sec-2-1-1">
          <title>PHQ score</title>
        </sec>
        <sec id="sec-2-1-2">
          <title>Depression Severity</title>
        </sec>
        <sec id="sec-2-1-3">
          <title>Depressiveness</title>
        </sec>
        <sec id="sec-2-1-4">
          <title>Suicidal</title>
        </sec>
        <sec id="sec-2-1-5">
          <title>Depression diagnosis</title>
        </sec>
        <sec id="sec-2-1-6">
          <title>Depression treatment</title>
        </sec>
        <sec id="sec-2-1-7">
          <title>GAD score</title>
        </sec>
        <sec id="sec-2-1-8">
          <title>Anxiety severity</title>
        </sec>
        <sec id="sec-2-1-9">
          <title>Anxiousness</title>
        </sec>
        <sec id="sec-2-1-10">
          <title>Anxiety diagnosis</title>
        </sec>
        <sec id="sec-2-1-11">
          <title>Anxiety treatment</title>
        </sec>
        <sec id="sec-2-1-12">
          <title>Epworth score</title>
        </sec>
        <sec id="sec-2-1-13">
          <title>Sleepiness</title>
          <p>Characteristics</p>
        </sec>
        <sec id="sec-2-1-14">
          <title>First year: 35%</title>
        </sec>
        <sec id="sec-2-1-15">
          <title>Second year: 24%</title>
        </sec>
        <sec id="sec-2-1-16">
          <title>Third year: 23%</title>
        </sec>
        <sec id="sec-2-1-17">
          <title>Fourth year: 18%</title>
          <p>
            After getting the optimal number of clustering and dividing the data into diferent clusters.
As mentioned above, the K-Means algorithm is used to achieve such a goal. Being one of the
most powerful and popular methods for applying and understanding the grouping process [
            <xref ref-type="bibr" rid="ref19">19</xref>
            ],
the K-Means algorithm works by calculating K centroids (that number, K, is the number of
clusters) and for each one of the records, it calculates the Euclidean distance between them and
those centroids, grouping the data in each nearest centroid [
            <xref ref-type="bibr" rid="ref20">20</xref>
            ].
          </p>
          <p>After the data is grouped in diferent clusters, the target variables are introduced again. For
each one of the clusters generated from both methods, the T-Test8 is performed to determine if
the data present significant diferences among the diferent groups.</p>
          <p>The clustering process is performed again, iteratively. The goal is to get the majority of
depression and anxiety-diagnosed patients inside a single cluster. However, the process can
ifnish sooner if some other conditions are met: if the unhealthy patients start to be separated
among diferent clusters, or if the metrics for the new split do not show an improvement.
This process, in case it is needed, is referred to as sub-clustering. Figure 1 summarizes the
Methodology pipeline. After one cluster satisfies the conditions mentioned above, the last step
is to analyze the results obtained by these processes.</p>
        </sec>
      </sec>
      <sec id="sec-2-2">
        <title>2.2. Anomaly Detection</title>
        <p>As explained above, Anomaly Detection is a technique for identifying events that are statistically
diferent from the rest. Such anomalous behavior is usually translated as a problem. Anomaly
Detection has a diferent standpoint, based on models and data predictions (see Figure 2).</p>
        <p>Anomaly Detection is used for the detection of patients whose features do not match with
the majority of the population, allowing analyzing them diferently. This analysis can lead to
seeking better metrics for the predictor models. Two groups are considered: the normal data
(those values that are in match with the majority) and outliers (the anomalous values) and they
are determined for each feature from the dataset, this way, it can be obtained the conclusion on
the behavior of each feature. For each numeric or categorical feature, it is determined the range
of normal values and its average. Also, there are identified the upper and bottom anomalous
values closest to the normal ones. Besides, to improve the analysis, the average values for
superior and inferior anomalous values are calculated. Taking into account the concept of
8KoreaMed Synapse. https://synapse.koreamed.org/articles/1156170
clustering, it can be represented with the following graph the situation in which certain data
are grouped in several clusters, leaving out the so-called outliers.</p>
        <p>Besides the detection of anomalous values, the process also includes analyzing the relationship
between anomalous values from diferent features. Seeing whether anomalous values for a
patient in a specific feature are also reflected in another diferent feature may help determine
how those diferent features behave and find relationships between them. Discovering these
relationships makes it possible to further justify decision-making on how to act with that patient.
These are decisions that will later afect the tuning of the predictive model.</p>
      </sec>
    </sec>
    <sec id="sec-3">
      <title>3. Results</title>
      <sec id="sec-3-1">
        <title>3.1. Clustering</title>
        <p>Following a similar presentation to the previous section, the results for both approaches,
Clustering and Anomaly Detection are presented.</p>
        <p>Before determining the optimal number of clusters, the dataset is normalized using the Standard
Scaling method. Then, as mentioned in the Methodology section, the process continues by
trying to obtain the optimal number of clusters. For each one of the cluster combinations, it is
observed the diferences between the cluster values and the Silhouette average value for that
amount of clusters. For all the combinations, except the 9-cluster one, all the values are above
the Silhouette average value, meaning that they are good candidates for the division.</p>
        <p>Taking into account the Average Silhouette Width (ASW), which indicates the degree of
similarity of an item in a cluster compared to others, the value ranges from -1 (the sample is not
very similar to its neighbors and little diferent from those of other clusters) to 1 (the sample is
very similar to its neighbors and very little similar to those of other clusters). According to the
Silhouette analysis, the convenient number of clusters is selected in 2 to group the data, this
being the one with the highest value, considering a good cluster configuration. However, the
2-clusters division is decided because its average value is bigger.</p>
        <p>Then, the T-Test method is used to check whether the diference between the clusters is
significant enough. For the 2-cluster split, 78.95% of the P-Values for all the features are less
than the selected threshold value (0.05), including 100% of the target variables, showing an
important diference among the clusters, especially in the target variables which are the ones
this procedure are trying to separate. Using that information, the 2-cluster division is concluded
to separate the data efectively.</p>
        <p>The data obtained for the diferent clusters are described following in Table 2. Table 3 shows
how the target variables, once introduced again into each cluster, behave diferently. Both
features, in this case, fulfill the conditions analyzed by the T-Test.</p>
        <p>It is observed that the first cluster (Cluster 0) groups all the patients with depression and
anxiety levels above normal, while the second cluster (Cluster 1) tends to contain healthy
patients. However, the first cluster also includes many healthy patients: it doubles the size of
the second cluster (531 vs 242) while the original analysis visible in Table 1 presents only 10%
of the cohort as diagnosed with one of the diseases. So, to diferentiate unhealthy patients the
same methodology (scaling, number of cluster determination, T-Test, clustering, and analysis)
is applied again but only over this first cluster.</p>
        <p>The Silhouette analysis indicates a value of 4 according to the obtained values for each
possible number of clusters in conjunction with the chart analysis (value of 0.184).</p>
        <p>The T-Test analysis is performed later which gives better significant diferences between the
features of the diferent sub-clusters in the 4-cluster combination (63.16%), but on the target
variables, the test is passed in only 16.67% of the clusters. However, Table 4 shows how the
sub-clusters are left having in Sub-cluster 1 a slightly larger proportion of unhealthy patients
compared with the other groups. The T-Test analysis shows that Sub-cluster 1 has a 33.33%
significant diference among the target variables with the other sub-clusters, rising to 66.67% in
the case of depression diagnosis.</p>
        <p>Table 5 shows how the target variables behave for each one of the sub-clusters once
reintroduced. Again, Sub-cluster 1, groups the majority of unhealthy patients, being more
significant in the depression diagnosis.</p>
        <p>According to this grouping, and taking rows assigned to the Sub-cluster 0 as those identified
as positive, a confusion matrix can be defined and, from there, determine the most popular
metrics as it was a classification problem. Table 6 shows this.</p>
        <p>Although the first attempt to group properly unhealthy patients, it creates a big set of healthy
and unhealthy patients, leaving a small group of healthy patients in the smaller set, while the
proportion in the dataset is exactly the opposite. When attempting to divide that second and
larger cluster to identify better unhealthy patients, a minor sub-cluster is obtained which tends
to group them, but the diference with the other sub-clusters is not so significant. The iterative
process is stopped at this moment because the next iteration started to show that the unhealthy
patients were not grouped into a single cluster anymore.
*Features considered as significant according to the T-Test analysis.</p>
      </sec>
      <sec id="sec-3-2">
        <title>3.2. Anomaly Detection</title>
        <p>The Anomaly Detection analysis gives the results presented on the charts enumerated in Figure
3. School year, given it is a very balanced feature, does not show anomalous values, while the
rest of the features do. Figures 3(a) through 3(d) represent features related to the patient body or</p>
        <p>Row</p>
        <sec id="sec-3-2-1">
          <title>School year*</title>
        </sec>
        <sec id="sec-3-2-2">
          <title>PHQ score*</title>
        </sec>
        <sec id="sec-3-2-3">
          <title>Depression Severity*</title>
        </sec>
        <sec id="sec-3-2-4">
          <title>Depressiveness*</title>
        </sec>
        <sec id="sec-3-2-5">
          <title>Suicidal*</title>
        </sec>
        <sec id="sec-3-2-6">
          <title>Depression treatment*</title>
        </sec>
        <sec id="sec-3-2-7">
          <title>GAD score*</title>
        </sec>
        <sec id="sec-3-2-8">
          <title>Anxiety severity*</title>
        </sec>
        <sec id="sec-3-2-9">
          <title>Anxiousness*</title>
        </sec>
        <sec id="sec-3-2-10">
          <title>Anxiety treatment</title>
        </sec>
        <sec id="sec-3-2-11">
          <title>Epworth score*</title>
        </sec>
        <sec id="sec-3-2-12">
          <title>Sleepiness*</title>
          <p>Cluster 0 (n=242)</p>
        </sec>
        <sec id="sec-3-2-13">
          <title>First year: 33%</title>
        </sec>
        <sec id="sec-3-2-14">
          <title>Second year: 16%</title>
        </sec>
        <sec id="sec-3-2-15">
          <title>Third year: 25%</title>
        </sec>
        <sec id="sec-3-2-16">
          <title>Fourth year: 26%</title>
          <p>PHQ score
Depression Severity</p>
          <p>First year: 56%
Second year: 43%
Third year: 1%
19.19 ± 1.08
Female: 50%
Male: 50%</p>
          <p>Approach</p>
          <p>Accuracy</p>
          <p>Recall</p>
          <p>Precision</p>
          <p>Specificity
epression diagnosis
Anxiety diagnosis
age, while Figures 3(e) through 3(i), which are shown following, indicate mental health-related
features.</p>
          <p>Most of the features present anomalous values above and below the set of normal values,
(a) School Years feature distribution
(b) Age feature distribution
(c) BMI feature distribution
(d) WHO BMI feature distribution
(e) PHQ Score feature distribution (f) Depression Severity feature
distribution
(g) GAD Score feature distribution (h) PHQ Score feature distribution (i) Epworth Score feature distribution
being the exceptions the features Age and Anxiety Severity, whose anomalous values are only
above the normal data. Table 7 summarizes the number of normal data (normal values) and
outliers (anomalous values) for all these features.</p>
          <p>Also, binary columns with imbalanced data, such as Suicidal, Depression Treatment, and
Anxiety Treatment are considered anomalous when the value is positive.</p>
          <p>On the other hand, it was analyzed how diferent anomalous values relate among the diferent
features. Table 8 shows these behaviors.</p>
          <p>It can be observed that in each case that the patient is detected as anomalous for the PHQ
Score feature, it is also detected as anomalous for the feature Depression Severity and vice-versa.
Something similar happens between GAD Score and Anxiety.</p>
        </sec>
      </sec>
    </sec>
    <sec id="sec-4">
      <title>4. Conclusions</title>
      <p>The clustering analysis returns good accuracy and specificity values in contrast with poor
recall and precision values. This suggests that this kind of classification would be very helpful
excluding healthy patients but still won’t be able to precisely detect unhealthy patients. It is
also observed many similarities between the depressive and anxious patient cohorts, giving
the hint that both disorders share similar aspects. Anomaly Detection analysis informs which
patients may be altering the dataset so it can be part of future works on the usage of this kind
of algorithm to decide what can be done with such patients for the classifier model to improve
its metrics: they can be removed or analyzed separately. However, that analysis must be done
on a feature level because some anomalous values could be very important to be analyzed as
part of the dataset because they may indicate the presence of the disease, especially in such
imbalanced data.</p>
      <p>Another benefit that can be derived from the anomaly detection process is to find which
patterns the anomalous records present to use them to classify the dataset. In this article,
Anomaly Detection is used to analyze categorical and numerical features and their relationships,
but in the future lines, the same analysis can be performed at a record level.</p>
      <p>In conclusion, future open lines of work are mentioned, which include opening the same
analysis to other datasets, and, after enough validation, the inclusion of these techniques in
decision support systems that help mental health professionals to diagnose better and faster
this kind of diseases. Also, the iterating process mentioned in the clustering process can be
extended by making more indulgent the stop criteria and checking if that helps the detection of
unhealthy patients.</p>
      <p>As mentioned above, all this analysis, both the clustering and the anomaly Detection, are
meant to be part of a Clinical Decision Support System pipeline, where both parts can help
identify patients with diseases or at least anomalous, that may require a deeper inspection.</p>
    </sec>
    <sec id="sec-5">
      <title>5. Acknowledgments</title>
      <p>This work was supported and financed by the Cloudgenia group through its technical and
operational initiatives.</p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          [1]
          <string-name>
            <given-names>Y.</given-names>
            <surname>Conwell</surname>
          </string-name>
          ,
          <string-name>
            <given-names>P. R.</given-names>
            <surname>Duberstein</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            <surname>Cox</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J. H.</given-names>
            <surname>Herrmann</surname>
          </string-name>
          ,
          <string-name>
            <given-names>N. T.</given-names>
            <surname>Forbes</surname>
          </string-name>
          ,
          <string-name>
            <given-names>E. D.</given-names>
            <surname>Caine</surname>
          </string-name>
          ,
          <article-title>Relationships of age and axis i diagnoses in victims of completed suicide: a psychological autopsy study</article-title>
          .,
          <source>The American journal of psychiatry 153</source>
          (
          <year>1996</year>
          )
          <fpage>1001</fpage>
          -
          <lpage>1008</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          [2]
          <string-name>
            <given-names>M. A.</given-names>
            <surname>Boden</surname>
          </string-name>
          , Artificial intelligence,
          <source>Elsevier</source>
          ,
          <year>1996</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          [3]
          <string-name>
            <given-names>Z.</given-names>
            <surname>Ghahramani</surname>
          </string-name>
          ,
          <article-title>Unsupervised learning</article-title>
          ,
          <source>in: Summer school on machine learning</source>
          , Springer,
          <year>2003</year>
          , pp.
          <fpage>72</fpage>
          -
          <lpage>112</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          [4]
          <string-name>
            <given-names>J.</given-names>
            <surname>Han</surname>
          </string-name>
          ,
          <string-name>
            <surname>J</surname>
          </string-name>
          . Pei,
          <string-name>
            <given-names>H.</given-names>
            <surname>Tong</surname>
          </string-name>
          ,
          <article-title>Data mining: concepts and techniques</article-title>
          , Morgan kaufmann,
          <year>2022</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          [5]
          <string-name>
            <given-names>K. G.</given-names>
            <surname>Mehrotra</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C. K.</given-names>
            <surname>Mohan</surname>
          </string-name>
          ,
          <string-name>
            <given-names>H.</given-names>
            <surname>Huang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>K. G.</given-names>
            <surname>Mehrotra</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C. K.</given-names>
            <surname>Mohan</surname>
          </string-name>
          ,
          <string-name>
            <given-names>H.</given-names>
            <surname>Huang</surname>
          </string-name>
          , Anomaly detection, Springer,
          <year>2017</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          [6]
          <string-name>
            <given-names>E. O.</given-names>
            <surname>Ogunseye</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C. A.</given-names>
            <surname>Adenusi</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A. C.</given-names>
            <surname>Nwanakwaugwu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S. A.</given-names>
            <surname>Ajagbe</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S. O.</given-names>
            <surname>Akinola</surname>
          </string-name>
          ,
          <article-title>Predictive analysis of mental health conditions using adaboost algorithm</article-title>
          ,
          <source>ParadigmPlus</source>
          <volume>3</volume>
          (
          <year>2022</year>
          )
          <fpage>11</fpage>
          -
          <lpage>26</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          [7]
          <string-name>
            <given-names>M.</given-names>
            <surname>Di Felice</surname>
          </string-name>
          ,
          <string-name>
            <given-names>P.</given-names>
            <surname>Chatterjee</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M. F.</given-names>
            <surname>Pollo-Cattaneo</surname>
          </string-name>
          ,
          <article-title>Depression diagnosis using text-based ai methods-a systematic review</article-title>
          ,
          <year>2022</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          [8]
          <string-name>
            <given-names>Y.</given-names>
            <surname>Chen</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J. W.</given-names>
            <surname>Stewart</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Ge</surname>
          </string-name>
          , B. Cheng, A.
          <string-name>
            <surname>Chekroud</surname>
            ,
            <given-names>D. J.</given-names>
          </string-name>
          <string-name>
            <surname>Hellerstein</surname>
          </string-name>
          ,
          <article-title>Personalized symptom clusters that predict depression treatment outcomes: A replication of machine learning methods</article-title>
          ,
          <source>Journal of Afective Disorders Reports</source>
          <volume>11</volume>
          (
          <year>2023</year>
          )
          <fpage>100470</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          [9]
          <string-name>
            <given-names>Z.</given-names>
            <surname>Yang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            <surname>Chen</surname>
          </string-name>
          ,
          <string-name>
            <given-names>H.</given-names>
            <surname>Li</surname>
          </string-name>
          ,
          <string-name>
            <given-names>L.</given-names>
            <surname>Yao</surname>
          </string-name>
          ,
          <string-name>
            <given-names>X.</given-names>
            <surname>Zhao</surname>
          </string-name>
          ,
          <article-title>Unsupervised classifications of depression levels based on machine learning algorithms perform well as compared to traditional norm-based classifications</article-title>
          ,
          <source>Frontiers in Psychiatry</source>
          <volume>11</volume>
          (
          <year>2020</year>
          )
          <fpage>45</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          [10]
          <string-name>
            <given-names>M. R.</given-names>
            <surname>Morales</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R.</given-names>
            <surname>Levitan</surname>
          </string-name>
          ,
          <article-title>Mitigating confounding factors in depression detection using an unsupervised clustering approach</article-title>
          ,
          <source>in: Computing and Mental Health Workshop (CHI)</source>
          , San Jose, CA, USA,
          <year>2016</year>
          , pp.
          <fpage>1</fpage>
          -
          <lpage>4</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref11">
        <mixed-citation>
          [11]
          <string-name>
            <surname>C. R. van Genugten</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          <string-name>
            <surname>Schuurmans</surname>
            ,
            <given-names>A. W.</given-names>
          </string-name>
          <string-name>
            <surname>Hoogendoorn</surname>
            ,
            <given-names>R.</given-names>
          </string-name>
          <string-name>
            <surname>Araya</surname>
            ,
            <given-names>G.</given-names>
          </string-name>
          <string-name>
            <surname>Andersson</surname>
            ,
            <given-names>R. M.</given-names>
          </string-name>
          <string-name>
            <surname>Baños</surname>
            ,
            <given-names>T.</given-names>
          </string-name>
          <string-name>
            <surname>Berger</surname>
            ,
            <given-names>C.</given-names>
          </string-name>
          <string-name>
            <surname>Botella</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          <string-name>
            <surname>Cerga</surname>
            <given-names>Pashoja</given-names>
          </string-name>
          ,
          <string-name>
            <given-names>R.</given-names>
            <surname>Cieslak</surname>
          </string-name>
          , et al.,
          <article-title>A data-driven clustering method for discovering profiles in the dynamics of major depressive disorder using a smartphone-based ecological momentary assessment of mood</article-title>
          ,
          <source>Frontiers in psychiatry 13</source>
          (
          <year>2022</year>
          )
          <fpage>755809</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref12">
        <mixed-citation>
          [12]
          <string-name>
            <given-names>J.</given-names>
            <surname>Hernandez</surname>
          </string-name>
          ,
          <string-name>
            <given-names>K.</given-names>
            <surname>Daza</surname>
          </string-name>
          ,
          <string-name>
            <given-names>H.</given-names>
            <surname>Florez</surname>
          </string-name>
          ,
          <article-title>Spiking neural network approach based on caenorhabditis elegans worm for classification</article-title>
          .,
          <source>IAENG International Journal of Computer Science</source>
          <volume>49</volume>
          (
          <year>2022</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref13">
        <mixed-citation>
          [13]
          <string-name>
            <given-names>R. T.</given-names>
            <surname>Sutton</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Pincock</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D. C.</given-names>
            <surname>Baumgart</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D. C.</given-names>
            <surname>Sadowski</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R. N.</given-names>
            <surname>Fedorak</surname>
          </string-name>
          ,
          <string-name>
            <surname>K. I. Kroeker,</surname>
          </string-name>
          <article-title>An overview of clinical decision support systems: benefits, risks, and strategies for success</article-title>
          ,
          <source>NPJ digital medicine 3</source>
          (
          <year>2020</year>
          )
          <fpage>17</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref14">
        <mixed-citation>
          [14]
          <string-name>
            <given-names>K.</given-names>
            <surname>Kroenke</surname>
          </string-name>
          ,
          <string-name>
            <given-names>T. W.</given-names>
            <surname>Strine</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R. L.</given-names>
            <surname>Spitzer</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J. B.</given-names>
            <surname>Williams</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J. T.</given-names>
            <surname>Berry</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A. H.</given-names>
            <surname>Mokdad</surname>
          </string-name>
          ,
          <article-title>The phq-8 as a measure of current depression in the general population</article-title>
          ,
          <source>Journal of afective disorders 114</source>
          (
          <year>2009</year>
          )
          <fpage>163</fpage>
          -
          <lpage>173</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref15">
        <mixed-citation>
          [15]
          <string-name>
            <given-names>R. L.</given-names>
            <surname>Spitzer</surname>
          </string-name>
          ,
          <string-name>
            <given-names>K.</given-names>
            <surname>Kroenke</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J. B.</given-names>
            <surname>Williams</surname>
          </string-name>
          ,
          <string-name>
            <given-names>B.</given-names>
            <surname>Löwe</surname>
          </string-name>
          ,
          <article-title>A brief measure for assessing generalized anxiety disorder: the gad-7, Archives of internal medicine 166 (</article-title>
          <year>2006</year>
          )
          <fpage>1092</fpage>
          -
          <lpage>1097</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref16">
        <mixed-citation>
          [16]
          <string-name>
            <given-names>M. W.</given-names>
            <surname>Johns</surname>
          </string-name>
          ,
          <article-title>A new method for measuring daytime sleepiness: the epworth sleepiness scale</article-title>
          , sleep
          <volume>14</volume>
          (
          <year>1991</year>
          )
          <fpage>540</fpage>
          -
          <lpage>545</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref17">
        <mixed-citation>
          [17]
          <string-name>
            <given-names>L.</given-names>
            <surname>Nitya Sai</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M. Sai</given-names>
            <surname>Shreya</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A. Anjan</given-names>
            <surname>Subudhi</surname>
          </string-name>
          ,
          <string-name>
            <given-names>B. Jaya</given-names>
            <surname>Lakshmi</surname>
          </string-name>
          ,
          <string-name>
            <given-names>K.</given-names>
            <surname>Madhuri</surname>
          </string-name>
          ,
          <article-title>Optimal k-means clustering method using silhouette coeficient</article-title>
          ,
          <year>2017</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref18">
        <mixed-citation>
          [18]
          <string-name>
            <given-names>J.</given-names>
            <surname>Hernandez</surname>
          </string-name>
          ,
          <string-name>
            <given-names>H.</given-names>
            <surname>Florez</surname>
          </string-name>
          ,
          <article-title>An experimental comparison of algorithms for nodes clustering in a neural network of caenorhabditis elegans</article-title>
          ,
          <source>in: Computational Science and Its Applications-ICCSA</source>
          <year>2021</year>
          : 21st International Conference, Cagliari, Italy,
          <source>September 13-16</source>
          ,
          <year>2021</year>
          , Proceedings,
          <source>Part IX 21</source>
          , Springer,
          <year>2021</year>
          , pp.
          <fpage>327</fpage>
          -
          <lpage>339</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref19">
        <mixed-citation>
          [19]
          <string-name>
            <given-names>M.</given-names>
            <surname>Ahmed</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R.</given-names>
            <surname>Seraj</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S. M. S.</given-names>
            <surname>Islam</surname>
          </string-name>
          ,
          <article-title>The k-means algorithm: A comprehensive survey and performance evaluation, Electronics 9 (</article-title>
          <year>2020</year>
          )
          <fpage>1295</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref20">
        <mixed-citation>
          [20]
          <string-name>
            <given-names>J. A.</given-names>
            <surname>Hartigan</surname>
          </string-name>
          , Clustering algorithms john wiley &amp; sons, Inc., New York, NY (
          <year>1975</year>
          ).
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>