<!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>C. Randieri);</journal-title>
      </journal-title-group>
      <issn pub-type="ppub">1613-0073</issn>
    </journal-meta>
    <article-meta>
      <title-group>
        <article-title>Understanding Parental Characteristics of Child Adoption Candidates using M MPI-2 and Evolutionary Clustering</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Emanuele Iacobelli</string-name>
          <email>iacobelli@diag.uniroma1.it</email>
          <xref ref-type="aff" rid="aff0">0</xref>
          <xref ref-type="aff" rid="aff3">3</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Cristian Randieri</string-name>
          <email>cristian.randieri@uniecampus.it</email>
          <xref ref-type="aff" rid="aff3">3</xref>
          <xref ref-type="aff" rid="aff4">4</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Paolo Roma</string-name>
          <email>paolo.roma@uniroma1.it</email>
          <xref ref-type="aff" rid="aff1">1</xref>
          <xref ref-type="aff" rid="aff3">3</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Samuele Russo</string-name>
          <xref ref-type="aff" rid="aff2">2</xref>
          <xref ref-type="aff" rid="aff3">3</xref>
        </contrib>
        <contrib contrib-type="editor">
          <string-name>Minnesota Multiphasic Personality Inventory (MMPI), Unsupervised Learning Algorithms, Genetic Algorithm, K-mean,</string-name>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>Department of Computer, Control and Management Engineering, Sapienza University of Rome</institution>
          ,
          <addr-line>00185 Roma</addr-line>
          ,
          <country country="IT">Italy</country>
        </aff>
        <aff id="aff1">
          <label>1</label>
          <institution>Department of Human Neuroscience, Sapienza University of Rome</institution>
          ,
          <country country="IT">Italy</country>
        </aff>
        <aff id="aff2">
          <label>2</label>
          <institution>Department of Psychology, Sapienza University of Rome</institution>
          ,
          <country country="IT">Italy</country>
        </aff>
        <aff id="aff3">
          <label>3</label>
          <institution>Informatics</institution>
          ,
          <addr-line>Mathematics, and Engineering. Catania</addr-line>
        </aff>
        <aff id="aff4">
          <label>4</label>
          <institution>Università degli Studi eCampus</institution>
          ,
          <addr-line>Novedrate (CO)</addr-line>
          ,
          <country country="IT">Italy</country>
        </aff>
      </contrib-group>
      <pub-date>
        <year>1846</year>
      </pub-date>
      <volume>000</volume>
      <fpage>0</fpage>
      <lpage>0002</lpage>
      <abstract>
        <p>In the context of adoption, evaluating prospective adoptive parents using psychometric assessments such as the Minnesota Multiphasic Personality Inventory (MMPI) questionnaire is essential for understanding their psychological profiles. However, interpreting such complex data can be both challenging and time-consuming. In this study, we propose a meta-analysis tool to assist psychologists in their initial interpretation and analysis of MMPI-2 results by providing a clear data-driven visualization of key psychometric scales. Our system employs unsupervised learning techniques to uncover meaningful patterns and relationships in the data with minimal prior input. Specifically, a genetic algorithm is used to optimize clustering quality by selecting the most relevant psychological scales, enhancing cluster separation, and improving data interpretability. We also explored and compared the efectiveness of several clustering algorithms, including K-Means, Gaussian Mixture Model, and Spectral Clustering, to maximize the capabilities of our tool.</p>
      </abstract>
      <kwd-group>
        <kwd>diferent clustering algorithms (K-Means [ 22</kwd>
        <kwd>23</kwd>
        <kwd>24</kwd>
        <kwd>25]</kwd>
      </kwd-group>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>-</title>
      <p>M</p>
      <p>MPI-2 and Evolutionary</p>
    </sec>
    <sec id="sec-2">
      <title>1. Introduction</title>
      <p>
        Adoption is the process whereby individuals or families
assume the parenting of a child who is not biologically
their own. According to specific studies [
        <xref ref-type="bibr" rid="ref1 ref2 ref3 ref4">1, 2, 3, 4</xref>
        ],
sometimes adoptees could have problems in psychological
development, social relationships, and establishing a sense
of identity. Therefore, finding suitable adoptive parents
is crucial for the well-being of the child.
      </p>
      <sec id="sec-2-1">
        <title>For that reason, standardized psychometric tests [5, 6,</title>
        <p>
          released MMPI-3 [
          <xref ref-type="bibr" rid="ref12">12</xref>
          ], published in 2020.
        </p>
        <p>For the evaluation of the results, the set of most
important psychometric scales to be analyzed is usually
handpicked by field experts as it is highly task-dependent. For
that reason, in this study, we propose an unsupervised
learning algorithm capable of clustering the data
gathered with the MMPI-2 test using as little as possible prior
knowledge during the preprocessing and postprocessing
of the data.</p>
      </sec>
      <sec id="sec-2-2">
        <title>The clustering [13] process is an unsupervised learning</title>
        <p>ogy traits of prospective adoptive parents. An example of
7, 8] are used to assess the personality and psychopathol- technique designed to identify similarities within data
without predefined categories. In our case, by analyzing
such a test is the Minnesota Multiphasic Personality In- the geometric properties of the data, the goal is to capture
CEUR</p>
        <p>
          ceur-ws.org
specifically for adults; the MMPI-A [
          <xref ref-type="bibr" rid="ref11">11</xref>
          ], designed for ado- optimizing both the minimum centroid distance and the
ventory (MMPI) psychological test [
          <xref ref-type="bibr" rid="ref9">9</xref>
          ], proposed in 1943.
        </p>
      </sec>
      <sec id="sec-2-3">
        <title>Over the years, several variations of the test have been</title>
        <p>
          developed. The most commonly used versions today
include the MMPI-2 [
          <xref ref-type="bibr" rid="ref10">10</xref>
          ], which was published in 1989
lescents and introduced in 1992; the MMPI-Restructured
        </p>
      </sec>
      <sec id="sec-2-4">
        <title>Form, a condensed version of the MMPI; and the recently</title>
        <p>(S. Russo)
(S. Russo)
ICYRIME 2024: 9th International Conference of Yearly Reports on
[28]) to determine the most suitable one for our system.</p>
      </sec>
      <sec id="sec-2-5">
        <title>In particular, given that the number of clusters is not predetermined, careful interpretation of the results is necessary to attribute meaningful explanations to each cluster.</title>
        <sec id="sec-2-5-1">
          <title>1.1. Roadmap</title>
        </sec>
        <sec id="sec-2-5-2">
          <title>2.2. Traditional MMPI Clustering</title>
        </sec>
        <sec id="sec-2-5-3">
          <title>Methods</title>
        </sec>
      </sec>
      <sec id="sec-2-6">
        <title>This paper is organized as follows: first, an overview</title>
        <p>
          of the MMPI-2 questionnaire, its scales, and traditional Following this concise overview of the MMPI-2 test, prior
MMPI clustering methods is presented in Section 2. Next, attempts to cluster datasets derived from this assessment
Section 3 provides a detailed description of the core tech- have typically involved manually selecting sets of the
niques used in our algorithm. In Section 4, we describe aforementioned psychometric scales.
the dataset employed in this experiment. Following this, In [29], an algorithm very similar to K-Means
(origSection 5 ofers a comprehensive explanation of the sys- inally described in [30]) was applied to data obtained
tem we developed and its evaluation process. The clus- from MMPI-2 tests administered to women in their third
tering results produced by our system are then presented trimester of pregnancy. The objective was to determine
in Section 6. Finally, Section 7 summarizes the article’s the personality characteristics of women who develop
content and outlines potential areas for future improve- perinatal depression.
ment. Similarly, in [
          <xref ref-type="bibr" rid="ref19">31</xref>
          ], clusters were generated to identify
groups of chronic low-back pain patients based on
per2. State of the Art sonality traits identified through the MMPI-2 test.
Another notable study is presented in [
          <xref ref-type="bibr" rid="ref20">32</xref>
          ], where the
2.1. MMPI-2 Overview authors investigated individuals trained to simulate
Posttraumatic Stress Disorder (PTSD). They conducted cluster
The MMPI-2 is used as a personality assessment tool analysis on MMPI-2 clinical and validity scales,
identiin clinical and non-clinical contexts to discern psy- fying two well-fitting cluster solutions. Discriminant
chopathologies and behavioral traits in individuals. It and multivariate analyses of variance (MANOVAs) were
comprises a series of true/false questions, known as items, employed to evaluate the clusters, revealing significant
which are grouped into various scales designed to mea- diferences in MMPI-2 content scales. Specifically,
desure specific aspects of the subject’s disposition. mographic variables had minimal influence on cluster
        </p>
        <p>
          Validity scales scrutinize the subject’s approach to membership, but there were discrepancies in the reported
the test and demeanor, identifying inconsistencies or clarity of PTSD education materials among clusters.
attempts to manipulate responses. Among them, the Lie In [
          <xref ref-type="bibr" rid="ref21">33</xref>
          ], the authors investigated the MMPI-2-RF
validscale (L) evaluates honesty during the test, while the ity scales’ efectiveness in profiling chronic pain patients.
K scale assesses defensive tendencies and reluctance to To identify clusters, a two-step exploratory cluster
analacknowledge personal issues. ysis was conducted, employing the auto-clustering
selec
        </p>
        <p>In addition, the MMPI incorporates ten primary clini- tion feature in IBM SPSS 21 to select the optimal cluster
cal scales designed to detect a spectrum of psychological solution. Cluster analysis revealed two distinct patient
disorders, encompassing Hypochondriasis (Hs), Depres- clusters. Cluster 1 displayed valid responses and
exhibsion (D), Hysteria (Hy), Psychopathic Deviate (Pd), Mas- ited elevations primarily on somatic and low positive
culinity/Femininity (Mf), Paranoia (Pa), Psychasthenia emotion scales. In contrast, Cluster 2 comprised patients
(Pt), Schizophrenia (Sc), Hypomania (Ma), and Social who overreported on validity scales and demonstrated
Introversion (Si). Furthermore, content scales target spe- elevations on multiple restructured clinical scales.
cific personal attitudes, including anger issues (ANG),
low self-esteem (LSE), family problems (FAM), and
workrelated challenges (WRK), among others. 3. Core Techniques in Our</p>
        <p>Additionally, supplemental scales are used in combina- Algorithm
tion with the content scales to determine if some
symptoms are attributed to alternative potential causes such 3.1. Genetic Algorithm
as controlled hostility, alcoholism, and more.</p>
        <p>Moreover, Psy-5 scales measure dimensional traits
of personality disorders, including Aggressiveness,
Psychoticism, Constraint, Neuroticism, and Extraversion.</p>
        <p>Finally, to ensure uniform interpretation across all
scales, scores are transformed into T-scores, ranging from
30 to 120. Typically, scores exceeding 65 are considered
significant and warrant further examination.</p>
        <p>
          All cited works in this paper employ clustering
techniques with input from psychology experts to select
relevant psychometric scales for analysis. In contrast, our
system autonomously selects key scales using a genetic
algorithm [
          <xref ref-type="bibr" rid="ref22">34</xref>
          ]. Genetic algorithms (GAs) are adaptive
search procedures widely utilized in Artificial
Intelligence since the 1970s [
          <xref ref-type="bibr" rid="ref23 ref24 ref25">35, 36, 37</xref>
          ]. Drawing inspiration
from biological evolution, GAs simulate aspects of the
process of natural selection proposed by Charles Darwin.
        </p>
        <p>
          They involve successive generations of candidate
solutions undergoing reproduction, mutation, and selection ifned number of clusters through an iterative process:
to converge toward optimal or near-optimal solutions. randomly selecting K samples as initial clusters (and
cenGenetic algorithms have a broad range of applications troids), assigning each sample to the cluster with the
[
          <xref ref-type="bibr" rid="ref26 ref27 ref28">38, 39, 40</xref>
          ]; any problem that can be formalized as a nearest centroid, recomputing centroids, and
terminatstring of 0s and 1s can potentially be optimized using ing the process if no data points have switched clusters
this approach. or if the distance between new and old centroids falls
        </p>
        <p>
          In summary, a general genetic algorithm workflow is below a certain threshold.
the following: firstly, an initial population of individuals Gaussian Mixture Model (GMM) endeavors to fit a
(each represented as a string of 0s and 1s) is randomly specified number (N) of normal distributions to
disgenerated. Next, a fitness value is assigned to each in- tinct subsets of the original dataset by estimating their
dividual in the population according to a certain fitness mean and variance parameters using the
Expectationfunction. Then, multiple pools of individuals are ran- Maximization (EM) algorithm [
          <xref ref-type="bibr" rid="ref29">41</xref>
          ].
domly selected, and a certain number of individuals are Spectral Clustering, on the other hand, exploits the
chosen based on their fitness value to serve as parents spectral properties of the afinity matrix to capture the
for the next population from each pool. For each pair of underlying data structure, particularly in scenarios where
parents, two children are produced using the following traditional clustering techniques may struggle with
noncriteria: a crossover index is randomly selected and deter- linear or intricate relationships between data points. In
mines how much of the first part of one parent’s string is particular, it leverages techniques such as spectral
decommerged with the second part of the other parent’s string, position (eigenvalue decomposition) or singular value
and vice versa. Finally, each bit of the generated children decomposition (SVD), to transform data into a
loweris flipped according to a certain probability simulating dimensional space and subsequently employs a standard
the mutation process. This algorithm continues until a clustering algorithm, such as K-means, to partition the
specific number of consecutive iterations occur without data points into clusters.
any improvement in the best fitness value. When the
algorithm halts, the latest best individual found is selected
as the optimal solution discovered thus far. 4. Dataset
        </p>
      </sec>
      <sec id="sec-2-7">
        <title>In this study, we utilized a dataset comprising 202 en</title>
        <p>3.2. Clustering Algorithms tries and 813 features for each entry. These features
Clustering algorithms belong to the unsupervised learn- encompass anamnestic information, boolean answers to
ing domain of artificial intelligence and are designed the MMPI’s questions, and T-scores. Figures 1, 2, and
to unveil concealed patterns and organize data points 3 provide an overview of the statistics regarding some
into coherent clusters based on their intrinsic similari- of the anamnestic information and the clinical and
conties. These algorithms rely on diferent distance metrics tent scales, calculated as T-scores, of the subjects in our
like Euclidean distance, cosine similarity, and the Jac- dataset. For preprocessing, we removed features with
card coeficient to quantify the resemblance between either a single value or a predominant value (e.g.,
‘Citizendata points. The typical representation of each resulting ship’) and those with high variability (e.g., ’Profession’).
cluster involves a centroid, acting as a central reference Additionally, we dropped the gender column since MMPI
point summarizing the collective traits of its constituent scales have the same interpretation for both men and
data points. These algorithms can be broadly categorized women. The boolean answers to the MMPI’s questions
into several methodologies. Partitioning methods, exem- were also discarded, as the normalized T-score values
plified by K-means, iteratively segment the dataset into automatically encode this information.
non-overlapping clusters, ensuring each data point exclu- To ensure data validity, according to the guidelines
sively belongs to one cluster. Hierarchical methods, such provided by the authors of the MMPI test, applicants
as Agglomerative clustering, construct a hierarchical ar- with Lie scale scores exceeding 75 were excluded.
Adrangement of clusters by iteratively merging or dividing ditionally, none of the test-takers reached the cutof of
existing clusters based on similarity criteria, culminating 30 unanswered questions on the ’cannot say’ scale that
in a tree-like structure. Model-based methods, on the should invalidate the test. We also examined other
vaother hand, assume that the data is generated by a proba- lidity scales such as F, TRINT, and VRINT, but no
enbilistic model, such as a Gaussian Mixture Model (GMM), tries were excluded based on these scales. Applicants
allowing for the probabilistic modeling of clusters. with high values indicating alcohol or drug issues were</p>
        <p>
          In our study, we focus on evaluating and comparing marked as rejected in advance.
the performance of K-means, Gaussian Mixture Model, The remaining data, consisting of 191 entries with 120
and Spectral Clustering. feature columns, was scaled to ensure all features had
In detail, K-Means partitions samples into a prede- the same magnitude within the range [
          <xref ref-type="bibr" rid="ref1">0,1</xref>
          ]. This scaling
5.
        </p>
      </sec>
    </sec>
    <sec id="sec-3">
      <title>Methodology and System’s</title>
    </sec>
    <sec id="sec-4">
      <title>Evaluation</title>
      <sec id="sec-4-1">
        <title>For clustering the dataset using a genetic algorithm, each</title>
        <p>
          feature in our dataset has been encoded with a binary
digit [
          <xref ref-type="bibr" rid="ref1">0,1</xref>
          ]. This encoding allows each individual to
represent a unique combination of features. Features
assigned the value 1 will be considered in the clustering
process, while those denoted with 0 will be discarded.
        </p>
      </sec>
      <sec id="sec-4-2">
        <title>Each individual is then evaluated using two diferent fitness functions: the minimum inter-cluster distance and the minimum centroid distance.</title>
      </sec>
      <sec id="sec-4-3">
        <title>The minimum inter-cluster distance calculates the minimum distance between two data points belonging to diferent clusters through the following formula:</title>
      </sec>
    </sec>
    <sec id="sec-5">
      <title>6. Results</title>
      <sec id="sec-5-1">
        <title>To determine the optimal number of clusters for the K</title>
      </sec>
      <sec id="sec-5-2">
        <title>Means clustering algorithm on the analyzed dataset, we</title>
        <p>where  is the mean distance between a sample and all
other points in the same cluster, and  is the mean
distance between a sample and all points in the nearest
cluster. The Silhouette Score, which is the average of
the Silhouette Coeficients for all elements in the dataset,
indicates the quality of clustering. A higher mean
Silhouette Score suggests denser and better-separated clusters.
In our study, the optimal number of clusters found for
our dataset was 2, as shown in Fig. 6. The Fig. 7 provides
a comprehensive overview of Silhouette coeficients for
diferent numbers of clusters, demonstrating the decline
in clustering quality as the number of clusters increases.</p>
        <p>Executing the PCA to the obtained clusters generates
the plot displayed in Fig. 8. It can be seen that on the
ifrst principal component (x-axis) the two clusters are
well distinguished while on the second principal
component (y-axis) they both spread homogeneously even
if the elements belonging to the green cluster are more
concentrated around the zero value of that axis.</p>
        <p>In a more detailed analysis, Fig. 9 illustrates the
intracluster average values for the four main group scales:
Validity, Clinical, Content, and Supplemental. As
observed, the elements in the green cluster consistently
show lower average values compared to those in the red
cluster, with the exception of the Validity scale. This
reversal in trend may prompt psychologists to further
examine these two clusters, as the scales within the Validity
group are designed to indicate how reliable and truthful
the test responses are. However, the diferences between
the clusters are minor, and both demonstrate a high level
of reliability in responses, with few outliers. One of the
key insights from this analysis is the notable diference in
the Content scale, suggesting that individuals in the red
cluster may exhibit more psychological issues compared
(3) to those in the green cluster.</p>
        <p>A similar trend, observed in Fig. 8, is also highlighted
employed the Silhouette Analysis. This technique
involves computing the Silhouette Coeficient  for each
element in the dataset, defined by:
 =</p>
        <p>− 
max(, )
in Fig. 11, where the x-axis represents the average values
of the Content scale and the y-axis the average values of
the Clinical scale for each element in the dataset.</p>
        <p>Finally, Fig. 10 provides a deeper analysis of the
weights associated with the psychological scales for the
ifrst and second principal components of the PCA. From
this plot, it is clear that for the elements in the green
cluster, high values on scales related to the Content group
correspond to highly positive weights, while low values
correspond to negative weights. In contrast, the red
cluster exhibits an inverted trend. For the second principal
component, the red cluster elements are more evenly
distributed across the dimension, while the green cluster
elements generally show lower values across the scales.
From these graphs, psychology experts can gain insights
into the most relevant psychological scales within the</p>
      </sec>
    </sec>
    <sec id="sec-6">
      <title>7. Conclusion</title>
      <sec id="sec-6-1">
        <title>In this study, we proposed a novel approach for analyzing</title>
        <p>MMPI-2 profiles of prospective adoptive parents using
evolutionary clustering techniques. By incorporating
a genetic algorithm to autonomously select the most
relevant psychometric scales, we aimed to streamline
the clustering process and reduce reliance on manual
selection by domain experts.</p>
        <p>By employing a genetic algorithm to automatically
select the most relevant psychological scales, combined
with K-Means clustering based on minimum centroid
distance and Silhouette analysis, we determined that two
clusters were the optimal choice to describe the analyzed
dataset.</p>
        <p>These clusters displayed distinct psychological profiles,
with notable diferences particularly in the content and
clinical scales, which may serve as valuable insights for
psychologists when assessing potential adopters.</p>
        <p>The implications of our approach are twofold: first, it
ofers a data-driven methodology that enhances the
initial interpretation of complex MMPI-2 profiles, assisting
psychologists in identifying meaningful patterns without
prior assumptions. Second, it underscores the potential
of unsupervised learning techniques, such as genetic
algorithms, in improving psychometric data analysis by
automating feature selection and optimizing clustering
quality.</p>
        <p>Future work may involve expanding the dataset and
further refining the genetic algorithm to handle larger
and more diverse MMPI profiles. Additionally, exploring
the integration of other clustering methods and
incorporating newer versions of the MMPI test, such as MMPI-3,
may provide further improvements and adaptability in
diverse psychological evaluations.</p>
      </sec>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          [1]
          <string-name>
            <given-names>D. E.</given-names>
            <surname>Johnson</surname>
          </string-name>
          ,
          <article-title>Adoption and the efect on children's development</article-title>
          ,
          <source>Early human development 68</source>
          (
          <year>2002</year>
          )
          <fpage>39</fpage>
          -
          <lpage>54</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          [2]
          <string-name>
            <given-names>L. M.</given-names>
            <surname>Beauchesne</surname>
          </string-name>
          ,
          <article-title>As if born to: The social construction of a deficit identity position for adopted persons (</article-title>
          <year>1997</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          [3]
          <string-name>
            <given-names>M.</given-names>
            <surname>DeJong</surname>
          </string-name>
          , J.
          <string-name>
            <surname>Hodges</surname>
            ,
            <given-names>O.</given-names>
          </string-name>
          <string-name>
            <surname>Malik</surname>
          </string-name>
          ,
          <article-title>Children after adoption: Exploring their psychological needs</article-title>
          ,
          <source>Clinical child psychology and psychiatry 21</source>
          (
          <year>2016</year>
          )
          <fpage>536</fpage>
          -
          <lpage>550</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          [4]
          <string-name>
            <given-names>D.</given-names>
            <surname>Brodzinsky</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Gunnar</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Palacios</surname>
          </string-name>
          ,
          <article-title>Adoption and trauma: Risks, recovery, and the lived experience of adoption, Child abuse</article-title>
          &amp; neglect
          <volume>130</volume>
          (
          <year>2022</year>
          )
          <fpage>105309</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          [5]
          <string-name>
            <given-names>S.</given-names>
            <surname>Russo</surname>
          </string-name>
          ,
          <string-name>
            <surname>S. I. Illari</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R.</given-names>
            <surname>Avanzato</surname>
          </string-name>
          ,
          <string-name>
            <surname>C.</surname>
          </string-name>
          <article-title>Napoli, Reducing the psychological burden of isolated oncological patients by means of decision trees</article-title>
          ,
          <source>in: CEUR Workshop Proceedings</source>
          , volume
          <volume>2768</volume>
          ,
          <year>2020</year>
          , p.
          <fpage>46</fpage>
          -
          <lpage>53</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          [6]
          <string-name>
            <given-names>G.</given-names>
            <surname>Lo Sciuto</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Russo</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            <surname>Napoli</surname>
          </string-name>
          ,
          <article-title>A cloud-based lfexible solution for psychometric tests validation, administration and evaluation</article-title>
          ,
          <source>in: CEUR Workshop Proceedings</source>
          , volume
          <volume>2468</volume>
          ,
          <year>2019</year>
          , p.
          <fpage>16</fpage>
          -
          <lpage>21</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          [7]
          <string-name>
            <given-names>S.</given-names>
            <surname>Russo</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            <surname>Napoli</surname>
          </string-name>
          ,
          <article-title>A comprehensive solution for psychological treatment and therapeutic</article-title>
          path plan- 2014
          <source>- 2014 IEEE Symposium Series on Computaning based on knowledge base and expertise shar- tional Intelligence - CIHLI</source>
          <year>2014</year>
          :
          <article-title>2014 IEEE Syming</article-title>
          ,
          <source>in: CEUR Workshop Proceedings</source>
          , volume
          <volume>2472</volume>
          ,
          <source>posium on Computational Intelligence for Human2019</source>
          , p.
          <fpage>41</fpage>
          -
          <lpage>47</lpage>
          . Like Intelligence, Proceedings,
          <year>2014</year>
          . doi:
          <volume>10</volume>
          .1109/
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          [8]
          <string-name>
            <given-names>S. I.</given-names>
            <surname>Illari</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Russo</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R.</given-names>
            <surname>Avanzato</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            <surname>Napoli</surname>
          </string-name>
          , A cloud-
          <source>CIHLI</source>
          .
          <year>2014</year>
          .
          <volume>7013395</volume>
          .
          <article-title>oriented architecture for the remote assessment</article-title>
          [19]
          <string-name>
            <given-names>M.</given-names>
            <surname>Woźniak</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Połap</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Gabryel</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R. K.</given-names>
            <surname>Nowicki</surname>
          </string-name>
          ,
          <article-title>and follow-up of hospitalized patients</article-title>
          , in: CEUR C.
          <string-name>
            <surname>Napoli</surname>
          </string-name>
          , E. Tramontana,
          <source>Can we process 2d imWorkshop Proceedings</source>
          , volume
          <volume>2694</volume>
          ,
          <year>2020</year>
          , p.
          <fpage>29</fpage>
          -
          <article-title>ages using artificial bee colony?</article-title>
          ,
          <source>in: Lecture Notes 35. in Artificial Intelligence (Subseries of Lecture Notes</source>
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          [9]
          <string-name>
            <given-names>S.</given-names>
            <surname>Hathaway</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>McKinley</surname>
          </string-name>
          ,
          <article-title>A multiphasic person</article-title>
          - in
          <source>Computer Science)</source>
          , volume
          <volume>9119</volume>
          ,
          <year>2015</year>
          , p.
          <fpage>660</fpage>
          -
          <article-title>ality schedule (minnesota): I. construction of the 671</article-title>
          . doi:
          <volume>10</volume>
          .1007/978- 3-
          <fpage>319</fpage>
          - 19324- 3_
          <fpage>59</fpage>
          . schedule,
          <source>The Journal of Psychology</source>
          <volume>10</volume>
          (
          <year>1940</year>
          ) [20]
          <string-name>
            <given-names>J.</given-names>
            <surname>Shapiro</surname>
          </string-name>
          ,
          <source>Genetic algorithms in machine learn249-254</source>
          . ing,
          <source>in: Advanced Course on Artificial Intelligence,</source>
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          [10]
          <string-name>
            <given-names>J. N.</given-names>
            <surname>Butcher</surname>
          </string-name>
          , Minnesota Multiphasic Personality Springer,
          <year>1999</year>
          , pp.
          <fpage>146</fpage>
          -
          <lpage>168</lpage>
          . Inventory-2: Manual for administration, scoring, [21]
          <string-name>
            <given-names>M.</given-names>
            <surname>Woźniak</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Połap</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            <surname>Napoli</surname>
          </string-name>
          , E. Tramontana, and interpretation, University of Minnesota Press,
          <article-title>Graphic object feature extraction system based on 2001. cuckoo search algorithm, Expert Systems with Ap-</article-title>
        </mixed-citation>
      </ref>
      <ref id="ref11">
        <mixed-citation>
          [11]
          <string-name>
            <given-names>J.</given-names>
            <surname>Butcher</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            <surname>Williams</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Graham</surname>
          </string-name>
          ,
          <string-name>
            <surname>A</surname>
          </string-name>
          . Tellegen, plications
          <volume>66</volume>
          (
          <year>2016</year>
          )
          <fpage>20</fpage>
          -
          <lpage>31</lpage>
          . doi:
          <volume>10</volume>
          .1016/j.eswa. Y.
          <string-name>
            <surname>Ben-Porath</surname>
            ,
            <given-names>R.</given-names>
          </string-name>
          <string-name>
            <surname>Archer</surname>
          </string-name>
          , et al.,
          <source>Manual para la ad- 2016</source>
          .
          <volume>08</volume>
          .068. ministración,
          <source>puntaje e interpretación del inven-</source>
          [22]
          <string-name>
            <given-names>K. P.</given-names>
            <surname>Sinaga</surname>
          </string-name>
          , M.-
          <string-name>
            <given-names>S.</given-names>
            <surname>Yang</surname>
          </string-name>
          ,
          <article-title>Unsupervised ktario multifacético de la personalidad en adoles- means clustering algorithm, IEEE access 8 (2020) centes, mmpi-a [manual for administration, scor- 80716-80727. ing, and interpretation of the minnesota multipha-</article-title>
          [23]
          <string-name>
            <given-names>V.</given-names>
            <surname>Ponzi</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Russo</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Wajda</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R.</given-names>
            <surname>Brociek</surname>
          </string-name>
          ,
          <string-name>
            <surname>C.</surname>
          </string-name>
          <article-title>Napoli, sic personality inventory for adolescents: Mmpi-a], Analysis pre and post covid-19 pandemic rorschach 1992</article-title>
          .
          <article-title>test data of using em algorithms</article-title>
          and gmm mod-
        </mixed-citation>
      </ref>
      <ref id="ref12">
        <mixed-citation>
          [12]
          <string-name>
            <given-names>Y.</given-names>
            <surname>Ben-Porath</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Tellegen</surname>
          </string-name>
          , Minnesota Multipha- els,
          <source>in: CEUR Workshop Proceedings</source>
          , volume
          <volume>3360</volume>
          ,
          <string-name>
            <surname>sic Personality</surname>
          </string-name>
          Inventory-3
          <source>(MMPI-3): Manual for</source>
          <year>2022</year>
          , p.
          <fpage>55</fpage>
          -
          <lpage>63</lpage>
          . administration, scoring, and interpretation, Univer- [24]
          <string-name>
            <given-names>N.</given-names>
            <surname>Brandizzi</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Russo</surname>
          </string-name>
          , G. Galati,
          <string-name>
            <given-names>C.</given-names>
            <surname>Napoli</surname>
          </string-name>
          , Addresssity of Minnesota Press,
          <year>2020</year>
          .
          <article-title>ing vehicle sharing through behavioral analysis: A</article-title>
        </mixed-citation>
      </ref>
      <ref id="ref13">
        <mixed-citation>
          [13]
          <string-name>
            <given-names>R.</given-names>
            <surname>Xu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Wunsch</surname>
          </string-name>
          ,
          <article-title>Survey of clustering algorithms, solution to user clustering using recency-frequencyIEEE Transactions on neural networks 16 (2005) monetary and vehicle relocation based on neigh645-678</article-title>
          . borhood splits,
          <source>Information (Switzerland) 13</source>
          (
          <year>2022</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref14">
        <mixed-citation>
          [14]
          <string-name>
            <given-names>M.</given-names>
            <surname>Woźniak</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Połap</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R. K.</given-names>
            <surname>Nowicki</surname>
          </string-name>
          , C. Napoli, doi:10.3390/info13110511. G. Pappalardo, E. Tramontana, Novel approach [25]
          <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 altoward medical signals classifier</article-title>
          ,
          <source>in: Proceedings gorithm: A comprehensive survey and performance of the International Joint Conference on Neural evaluation, Electronics</source>
          <volume>9</volume>
          (
          <year>2020</year>
          )
          <fpage>1295</fpage>
          .
          <string-name>
            <surname>Networks</surname>
          </string-name>
          , volume
          <year>September 2015</year>
          ,
          <year>2015</year>
          . doi:10. [26]
          <string-name>
            <given-names>N.</given-names>
            <surname>Andriyanov</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Tashlinsky</surname>
          </string-name>
          ,
          <string-name>
            <given-names>V.</given-names>
            <surname>Dementiev</surname>
          </string-name>
          , De1109/IJCNN.
          <year>2015</year>
          .
          <volume>7280556</volume>
          .
          <article-title>tailed clustering based on gaussian mixture models,</article-title>
        </mixed-citation>
      </ref>
      <ref id="ref15">
        <mixed-citation>
          [15]
          <string-name>
            <given-names>E.</given-names>
            <surname>Iacobelli</surname>
          </string-name>
          ,
          <string-name>
            <given-names>V.</given-names>
            <surname>Ponzi</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Russo</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            <surname>Napoli</surname>
          </string-name>
          ,
          <article-title>Eye- in: Intelligent Systems and Applications: Proceedtracking system with low-end hardware: Devel- ings of the 2020 Intelligent Systems Conference opment and evaluation, Information (Switzerland) (IntelliSys</article-title>
          ) Volume
          <volume>2</volume>
          , Springer,
          <year>2021</year>
          , pp.
          <fpage>437</fpage>
          -
          <lpage>448</lpage>
          . 14 (
          <year>2023</year>
          ). doi:
          <volume>10</volume>
          .3390/info14120644. [27]
          <string-name>
            <given-names>N.</given-names>
            <surname>Brandizzi</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Russo</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R.</given-names>
            <surname>Brociek</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Wajda</surname>
          </string-name>
          , First
        </mixed-citation>
      </ref>
      <ref id="ref16">
        <mixed-citation>
          [16]
          <string-name>
            <given-names>F.</given-names>
            <surname>Fiani</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Russo</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            <surname>Napoli</surname>
          </string-name>
          ,
          <article-title>An advanced solu- studies to apply the theory of mind theory to green tion based on machine learning for remote emdr and smart mobility by using gaussian area clustertherapy</article-title>
          ,
          <source>Technologies</source>
          <volume>11</volume>
          (
          <year>2023</year>
          ). doi:
          <volume>10</volume>
          .3390/ ing, in
          <source>: CEUR Workshop Proceedings</source>
          , volume
          <volume>3118</volume>
          ,
          <year>technologies11060172</year>
          .
          <year>2021</year>
          , p.
          <fpage>71</fpage>
          -
          <lpage>76</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref17">
        <mixed-citation>
          [17]
          <string-name>
            <given-names>I. E.</given-names>
            <surname>Tibermacine</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Tibermacine</surname>
          </string-name>
          , W. Guettala, [28]
          <string-name>
            <given-names>U.</given-names>
            <surname>Von Luxburg</surname>
          </string-name>
          ,
          <article-title>A tutorial on spectral clustering, C. Napoli</article-title>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Russo</surname>
          </string-name>
          ,
          <source>Enhancing sentiment anal- Statistics and computing 17</source>
          (
          <year>2007</year>
          )
          <fpage>395</fpage>
          -
          <lpage>416</lpage>
          .
          <article-title>ysis on seed-iv dataset with vision transformers</article-title>
          : [29]
          <string-name>
            <given-names>V.</given-names>
            <surname>Meuti</surname>
          </string-name>
          ,
          <string-name>
            <surname>I. Marini</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Grillo</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Lauriola</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            <surname>Leone</surname>
          </string-name>
          ,
          <article-title>A comparative study</article-title>
          , in: ACM International N.
          <string-name>
            <surname>Giacchetti</surname>
            ,
            <given-names>F.</given-names>
          </string-name>
          <string-name>
            <surname>Aceti</surname>
          </string-name>
          , et al.,
          <source>Mmpi-2: cluster Conference Proceeding Series</source>
          ,
          <year>2023</year>
          , p.
          <fpage>238</fpage>
          -
          <lpage>246</lpage>
          .
          <article-title>analysis of personality profiles in perinatal depresdoi</article-title>
          :
          <volume>10</volume>
          .1145/3638985.3639024.
          <article-title>sion-preliminary evidence</article-title>
          , The Scientific World
        </mixed-citation>
      </ref>
      <ref id="ref18">
        <mixed-citation>
          [18]
          <string-name>
            <given-names>C.</given-names>
            <surname>Napoli</surname>
          </string-name>
          ,
          <string-name>
            <given-names>G.</given-names>
            <surname>Pappalardo</surname>
          </string-name>
          ,
          <string-name>
            <given-names>E.</given-names>
            <surname>Tramontana</surname>
          </string-name>
          ,
          <string-name>
            <surname>Z. Marsza- Journal</surname>
          </string-name>
          <year>2014</year>
          (
          <year>2014</year>
          ). lek, D. Polap,
          <string-name>
            <given-names>M.</given-names>
            <surname>Wozniak</surname>
          </string-name>
          , Simplified firefly algo- [30]
          <string-name>
            <surname>J. MacQueen</surname>
          </string-name>
          , et al.,
          <article-title>Some methods for classificarithm for 2d image key-points search, in: IEEE SSCI tion and analysis of multivariate observations</article-title>
          ,
          <source>in: Proceedings of the fith Berkeley symposium on mathematical statistics and probability</source>
          , volume
          <volume>1</volume>
          , Oakland, CA, USA,
          <year>1967</year>
          , pp.
          <fpage>281</fpage>
          -
          <lpage>297</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref19">
        <mixed-citation>
          [31]
          <string-name>
            <given-names>J. L.</given-names>
            <surname>RILEY</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M. E.</given-names>
            <surname>Robinson</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M. E.</given-names>
            <surname>Geisser</surname>
          </string-name>
          , V. T. Wittmer,
          <article-title>Multivariate cluster analysis of the mmpi2 in chronic low-back pain patients</article-title>
          ,
          <year>1993</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref20">
        <mixed-citation>
          [32]
          <string-name>
            <given-names>J. D.</given-names>
            <surname>Elhai</surname>
          </string-name>
          ,
          <string-name>
            <given-names>B. C.</given-names>
            <surname>Frueh</surname>
          </string-name>
          ,
          <article-title>Subtypes of clinical presentations in malingerers of posttraumatic stress disorder: An mmpi-2 cluster analysis</article-title>
          ,
          <source>Assessment</source>
          <volume>8</volume>
          (
          <year>2001</year>
          )
          <fpage>75</fpage>
          -
          <lpage>84</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref21">
        <mixed-citation>
          [33]
          <string-name>
            <given-names>L. E.</given-names>
            <surname>Aguerrevere</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M. R.</given-names>
            <surname>Calamia</surname>
          </string-name>
          ,
          <string-name>
            <given-names>K. W.</given-names>
            <surname>Greve</surname>
          </string-name>
          ,
          <string-name>
            <given-names>K. J.</given-names>
            <surname>Bianchini</surname>
          </string-name>
          ,
          <string-name>
            <given-names>K. L.</given-names>
            <surname>Curtis</surname>
          </string-name>
          ,
          <string-name>
            <given-names>V.</given-names>
            <surname>Ramirez</surname>
          </string-name>
          ,
          <article-title>Clusters of ifnancially incentivized chronic pain patients using the minnesota multiphasic personality inventory2 restructured form (mmpi-2-rf</article-title>
          ).
          <source>, Psychological Assessment</source>
          <volume>30</volume>
          (
          <year>2018</year>
          )
          <fpage>634</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref22">
        <mixed-citation>
          [34]
          <string-name>
            <surname>K. De Jong</surname>
          </string-name>
          ,
          <article-title>Learning with genetic algorithms: An overview</article-title>
          ,
          <source>Machine learning 3</source>
          (
          <year>1988</year>
          )
          <fpage>121</fpage>
          -
          <lpage>138</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref23">
        <mixed-citation>
          [35]
          <string-name>
            <surname>K. De Jong</surname>
          </string-name>
          ,
          <article-title>Adaptive system design: a genetic approach</article-title>
          ,
          <source>IEEE Transactions on Systems, Man, and Cybernetics</source>
          <volume>10</volume>
          (
          <year>1980</year>
          )
          <fpage>566</fpage>
          -
          <lpage>574</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref24">
        <mixed-citation>
          [36]
          <string-name>
            <given-names>J. J.</given-names>
            <surname>Grefenstette</surname>
          </string-name>
          ,
          <article-title>Optimization of control parameters for genetic algorithms</article-title>
          ,
          <source>IEEE Transactions on systems, man, and cybernetics 16</source>
          (
          <year>1986</year>
          )
          <fpage>122</fpage>
          -
          <lpage>128</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref25">
        <mixed-citation>
          [37]
          <string-name>
            <surname>K. A. De Jong</surname>
          </string-name>
          ,
          <article-title>An analysis of the behavior of a class of genetic adaptive systems</article-title>
          ., University of Michigan,
          <year>1975</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref26">
        <mixed-citation>
          [38]
          <string-name>
            <given-names>H.</given-names>
            <surname>AL-Tabtabai</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A. P.</given-names>
            <surname>Alex</surname>
          </string-name>
          ,
          <article-title>Using genetic algorithms to solve optimization problems in construction, Engineering Construction and Architectural Management 6 (</article-title>
          <year>1999</year>
          )
          <fpage>121</fpage>
          -
          <lpage>132</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref27">
        <mixed-citation>
          [39]
          <string-name>
            <given-names>K.</given-names>
            <surname>Deb</surname>
          </string-name>
          ,
          <article-title>Genetic algorithm in search and optimization: the technique and applications</article-title>
          ,
          <source>in: Proceedings of International Workshop on Soft Computing and Intelligent Systems</source>
          ,(ISI, Calcutta, India),
          <source>Proceedings of International Workshop on Soft Computing and Intelligent …</source>
          ,
          <year>1998</year>
          , pp.
          <fpage>58</fpage>
          -
          <lpage>87</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref28">
        <mixed-citation>
          [40]
          <string-name>
            <given-names>A.</given-names>
            <surname>Homaifar</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C. X.</given-names>
            <surname>Qi</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S. H.</given-names>
            <surname>Lai</surname>
          </string-name>
          ,
          <article-title>Constrained optimization via genetic algorithms</article-title>
          ,
          <source>Simulation</source>
          <volume>62</volume>
          (
          <year>1994</year>
          )
          <fpage>242</fpage>
          -
          <lpage>253</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref29">
        <mixed-citation>
          [41]
          <string-name>
            <given-names>A. P.</given-names>
            <surname>Dempster</surname>
          </string-name>
          ,
          <string-name>
            <given-names>N. M.</given-names>
            <surname>Laird</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D. B.</given-names>
            <surname>Rubin</surname>
          </string-name>
          ,
          <article-title>Maximum likelihood from incomplete data via the em algorithm</article-title>
          ,
          <source>Journal of the royal statistical society: series B (methodological) 39</source>
          (
          <year>1977</year>
          )
          <fpage>1</fpage>
          -
          <lpage>22</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref30">
        <mixed-citation>
          [42]
          <string-name>
            <given-names>H.</given-names>
            <surname>Abdi</surname>
          </string-name>
          ,
          <string-name>
            <given-names>L. J.</given-names>
            <surname>Williams</surname>
          </string-name>
          ,
          <article-title>Principal component analysis</article-title>
          ,
          <source>Wiley interdisciplinary reviews: computational statistics 2</source>
          (
          <year>2010</year>
          )
          <fpage>433</fpage>
          -
          <lpage>459</lpage>
          .
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>