<?xml version="1.0" encoding="UTF-8"?>
<!DOCTYPE article PUBLIC "-//NLM//DTD JATS (Z39.96) Journal Publishing DTD v1.4 20241031//EN" "JATS-journalpublishing1-4.dtd">
<article xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink" article-type="research-article" dtd-version="1.4" xml:lang="en">
  <front>
    <journal-meta>
      <journal-id journal-id-type="publisher-id">ojsst</journal-id>
      <journal-title-group>
        <journal-title>Open Journal of Safety Science and Technology</journal-title>
      </journal-title-group>
      <issn pub-type="epub">2162-6006</issn>
      <issn pub-type="ppub">2162-5999</issn>
      <publisher>
        <publisher-name>Scientific Research Publishing</publisher-name>
      </publisher>
    </journal-meta>
    <article-meta>
      <article-id pub-id-type="doi">10.4236/ojsst.2025.154021</article-id>
      <article-id pub-id-type="publisher-id">ojsst-148159</article-id>
      <article-categories>
        <subj-group>
          <subject>Article</subject>
        </subj-group>
        <subj-group>
          <subject>Chemistry</subject>
          <subject>Materials Science</subject>
          <subject>Earth</subject>
          <subject>Environmental Sciences</subject>
          <subject>Engineering</subject>
          <subject>Physics</subject>
          <subject>Mathematics</subject>
          <subject>Social Sciences</subject>
          <subject>Humanities</subject>
        </subj-group>
      </article-categories>
      <title-group>
        <article-title>Multinomial Statistical Modeling for Predictive Detection and Security of Suspicious Transactions in a Digital Wallet</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <name name-style="western">
            <surname>Kouassi</surname>
            <given-names>Adlès Francis</given-names>
          </name>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <contrib contrib-type="author" corresp="yes">
          <name name-style="western">
            <surname>Brou</surname>
            <given-names>Pacôme</given-names>
          </name>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <contrib contrib-type="author">
          <name name-style="western">
            <surname>Coulibaly</surname>
            <given-names>Kadokan</given-names>
          </name>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <contrib contrib-type="author">
          <name name-style="western">
            <surname>Oumtanaga</surname>
            <given-names>Souleymane</given-names>
          </name>
          <xref ref-type="aff" rid="aff2">2</xref>
        </contrib>
      </contrib-group>
      <aff id="aff1"><label>1</label> Laboratoire des Sciences, des Technologies de l’Information et de la Communication (LASTIC), Ecole Supérieure Africaine des Technologie de l’Information et de la Communication (ESATIC), Abidjan, Côte d’Ivoire </aff>
      <aff id="aff2"><label>2</label> UMRI Mathématique et Sciences du Numérique (MSN), Ecole Doctorale Polytechnique, Institut National Polytechnique Houphouët Boigny (INPHB), Yamoussoukro, Côte d’Ivoire </aff>
      <author-notes>
        <fn fn-type="conflict" id="fn-conflict">
          <p>The authors declare no conflict of interest.</p>
        </fn>
      </author-notes>
      <pub-date pub-type="epub">
        <day>22</day>
        <month>10</month>
        <year>2025</year>
      </pub-date>
      <pub-date pub-type="collection">
        <month>10</month>
        <year>2025</year>
      </pub-date>
      <volume>15</volume>
      <issue>04</issue>
      <fpage>391</fpage>
      <lpage>415</lpage>
      <history>
        <date date-type="received">
          <day>02</day>
          <month>08</month>
          <year>2025</year>
        </date>
        <date date-type="accepted">
          <day>20</day>
          <month>12</month>
          <year>2025</year>
        </date>
        <date date-type="published">
          <day>23</day>
          <month>12</month>
          <year>2025</year>
        </date>
      </history>
      <permissions>
        <copyright-statement>© 2025 by the authors and Scientific Research Publishing Inc.</copyright-statement>
        <copyright-year>2025</copyright-year>
        <license license-type="open-access">
          <license-p> This article is an open access article distributed under the terms and conditions of the Creative Commons Attribution (CC BY) license ( <ext-link ext-link-type="uri" xlink:href="https://creativecommons.org/licenses/by/4.0/">https://creativecommons.org/licenses/by/4.0/</ext-link> ). </license-p>
        </license>
      </permissions>
      <self-uri content-type="doi" xlink:href="https://doi.org/10.4236/ojsst.2025.154021">https://doi.org/10.4236/ojsst.2025.154021</self-uri>
      <abstract>
        <p><bold>Context and Justification:</bold> As financial services undergo accelerated digitalization, the expansion of electronic transactions within digital wallets increases vulnerabilities to fraud, anomalous behavior, and sophisticated cyberattacks. While this transformation strengthens financial inclusion, it simultaneously exposes systems to risks linked to massive data flows, automated payment mechanisms, and adaptive malicious techniques. In this context, predictive detection of abnormal transactional behaviors becomes a critical component for enhancing cybersecurity, resilience, and digital trust. <bold>Problem Statement:</bold> The central challenge is to design a model that is both high-performing and explainable, ensuring compliance with ethical and regulatory standards while enabling automatic detection of suspicious activities without compromising algorithmic transparency. <bold>Methodology:</bold> The study uses 1000 real transaction records generated by 100 users of a mobile operator’s digital wallet service in Côte d’Ivoire, each performing ten typical daily operations (payments, withdrawals, deposits, transfers). All transactions were fully anonymized prior to analysis to ensure confidentiality and adherence to data protection and cybersecurity regulations. Each transaction includes quantitative and categorical features describing monetary behavior (amount, frequency, failure rate, inactivity period) and contextual attributes (location, device type, network). Categorical variables were encoded, and continuous variables normalized for comparability across users and cities. <bold>Results:</bold> Based on probabilistic evaluation, the Multinomial Logistic Regression (MLR) model achieved strong intrinsic performance, with a weighted F1-score of 0.83, precision of 0.84, recall of 0.82, AUC-PR of 0.89, and a low log-loss of 0.42. However, hard-label evaluation reveals a macro F1-score of 0.58, with differentiated class-level performance (F1 = 0.42 for normal, 0.67 for suspicious, 0.65 for fraud), indicating a conservative decision profile aimed at minimizing false negatives. Compared with more complex models such as Random Forest or XGBoost, MLR offers a well-balanced compromise between detection capability and interpretability, ensuring full decision traceability required for auditing and regulatory compliance. <bold>Conclusion:</bold> This research confirms the relevance of MLR as an explainable, robust, and computationally efficient model for multi-class predictive detection in digital wallets. It also opens promising perspectives through the integration of temporal modeling and hybrid sequential architectures (LSTM/GRU) to enable dynamic, adaptive, and resilient monitoring of financial fraud behaviors.</p>
      </abstract>
      <kwd-group kwd-group-type="author-generated" xml:lang="en">
        <kwd>Digital Wallet Security</kwd>
        <kwd>Multinomial Logistic Regression (MLR)</kwd>
        <kwd>Fraud Detection</kwd>
        <kwd>Explainable Machine Learning</kwd>
        <kwd>Cybersecurity Risk Monitoring</kwd>
      </kwd-group>
    </article-meta>
  </front>
  <body>
    <sec id="sec1">
      <title>1. Introduction</title>
      <p>With the rapid rise of financial technologies and the widespread adoption of mobile payment systems, digital wallets have become a central pillar of the digital economy, particularly in emerging countries where they significantly contribute to financial inclusion. However, this democratization also increases exposure to risks such as fraud, misuse, and suspicious activities that are increasingly difficult to detect using traditional security mechanisms. Classical monitoring techniques based on static rules or fixed thresholds are no longer sufficient in the face of attack patterns that are now more dynamic, personalized, and context dependent. In this context, artificial intelligence, especially supervised machine learning models, offers a promising pathway for automating the detection of transactional anomalies while adapting to evolving user behaviors. This research follows that perspective by proposing a Multinomial Logistic Regression (MLR) model for multi-class predictive classification of transactions according to three risk levels normal, suspicious, and fraudulent thus combining interpretability with the capacity to capture the multidimensional complexity of user behavior. The study relies on a representative dataset composed of real transactional records generated by subscribers of a mobile network operator in Côte d’Ivoire using a digital wallet (e-wallet) service. These transactions include financial, temporal, behavioral, and contextual variables that accurately reflect real-world mobile payment patterns. To ensure full protection of user confidentiality and compliance with personal data protection regulations, all transactional records were rigorously anonymized prior to analysis, with no identifying or sensitive information retained. This approach guarantees both the empirical validity of the dataset and its alignment with ethical, regulatory, and cybersecurity standards governing digital financial systems. Through a set of quantitative analyses including confusion matrices, classification metrics, error visualizations, and variable-importance measures, the paper assesses the robustness of the model, identifies operational limitations, and proposes avenues for improvement. The overarching goal is to contribute to the development of adaptive monitoring systems capable of detecting fraudulent activities with a low false-negative rate while minimizing unjustified alerts to preserve user experience. This work therefore represents both a methodological and operational contribution to strengthening the security of digital financial ecosystems through explainable, scalable, and risk centered predictive models.</p>
    </sec>
    <sec id="sec2">
      <title>2. Review Literature</title>
      <p>Detecting suspicious behaviors in digital transactions particularly within electronic wallets (digital wallets) has become a critical concern amid the rising tide of financial fraud. The rapid adoption of digital payments has fueled a growing body of scientific research focused on leveraging artificial intelligence (AI) for fraud detection, especially in the context of digital wallets. Since 2019, when Niu <italic>et al</italic>. compared supervised and unsupervised approaches for credit card fraud detection using public datasets highlighting the strengths and limitations of each method researchers have increasingly explored AI-driven strategies for identifying transactional anomalies [<xref ref-type="bibr" rid="B1">1</xref>]. Along similar lines, Ramadugu <italic>et al</italic>. in 2023 demonstrated that integrating machine learning techniques such as random forests and recurrent neural networks significantly improve detection accuracy while reducing false positives in digital payment systems [<xref ref-type="bibr" rid="B2">2</xref>]. Iseal and Halli further confirmed this potential by showing that real-time behavioral analysis enables more effective detection of abnormal transaction patterns [<xref ref-type="bibr" rid="B3">3</xref>]; Complementarily, Akinnagbe and Taiwo emphasized the structural impact of machine learning on the predictive capabilities of anti-fraud systems, particularly in high-volume transactional environments [<xref ref-type="bibr" rid="B4">4</xref>]. Lenka and Tiwari proposed a hybrid CNN-RNN model that captures both spatial and temporal patterns in financial transactions, enhancing the detection of complex fraud scenarios. In a comparative review [<xref ref-type="bibr" rid="B5">5</xref>], Lucas and Jurgovsky highlighted the challenges posed by imbalanced datasets and asymmetric performance metrics in supervised models. Meanwhile [<xref ref-type="bibr" rid="B6">6</xref>], Branco <italic>et al</italic>. introduced the Interleaved Sequence RNN approach, which treats transaction flows as correlated sequences, thereby enabling a more contextualized anomaly detection framework. From an unsupervised perspective [<xref ref-type="bibr" rid="B7">7</xref>], Deng and Ruan in 2019, Deng <italic>et al</italic>. in 2020 explored adversarial autoencoders to learn latent representations from unlabeled data, paving the way for effective anomaly detection even in the absence of explicit supervision [<xref ref-type="bibr" rid="B8">8</xref>][<xref ref-type="bibr" rid="B9">9</xref>]. Kantheti and Bvuma stressed that the rise of digital payments requires detection systems to be more adaptive achievable through the deployment of distributed intelligent architectures [<xref ref-type="bibr" rid="B10">10</xref>]. In 2025, Janbhasha <italic>et al</italic>. proposed a hybrid fraud detection model that combines Adversarial Auto Encoders (AAE) with gated recurrent units (GRU), enabling both the extraction of robust latent representations and the modeling of temporal dependencies within transactional sequences. Experimental results are promising, with high performance metrics: 99% accuracy and recall, a 98% F1-score, and an AUC of 99.4%, outperforming traditional methods while significantly reducing both false positives and false negatives. This model represents a significant advancement in securing digital wallet transactions [<xref ref-type="bibr" rid="B11">11</xref>]. Collectively, these studies confirm the increasing effectiveness of AI-based techniques for detecting and preventing fraud in digital financial transactions, particularly in digital wallets. They also underscore the need for adaptive models that can respond to the constantly evolving nature of fraudulent behaviors. In response to this challenge, the present study introduces an AI-based model founded on multinomial logistic regression (MLR) with the following objectives: 1) To model nonlinear relationships between multivariate explanatory variables (e.g., amount, transaction type, time, location, device, transaction frequency) and the associated transaction risk label; 2) To assign each transaction a probability distribution over behavior classes (normal, suspicious, fraudulent) using the SoftMax function, thereby enabling context-aware automated decision-making; 3) To provide an interpretable and explainable framework, in contrast to “black-box” models, making it possible to analyze the influence of each variable on the classification outcome an essential feature in regulated security environments; 4) To serve as a real-time decision-support tool, capable of triggering alerts or blocking suspicious or fraudulent transactions before they are completed thus reducing financial losses and protecting users.</p>
    </sec>
    <sec id="sec3">
      <title>3. Methodology and Material</title>
      <sec id="sec3dot1">
        <title>3.1. Field and Scope of Study</title>
        <p>This article falls within the field of cybersecurity applied to digital financial services, particularly electronic wallets (digital wallets), which today represent a central lever for financial inclusion in West Africa, especially in Côte d’Ivoire, where the rapid expansion of mobile money services and digital payments is accompanied by a rise in transactional vulnerabilities stemming both from the evolving behavior of users and the increasing sophistication of fraud schemes. The study is therefore positioned at the intersection of information system security, statistical risk modeling, and artificial intelligence applied to behavioral detection. The objective of this field of study is twofold. From a scientific perspective, it aims to demonstrate the relevance of multinomial logistic regression (MLR) as an explainable and robust method for multi-class predictive classification of digital transactions. From an operational perspective, the research seeks to contribute to the proactive security of payment platforms by proposing an interpretable predictive model capable of distinguishing between three risk levels normal, suspicious, and fraudulent transactions while minimizing false positives. However, the study deliberately excludes any sensitive personal data, such as nominal identifiers, and is limited to transactional and contextual information strictly necessary for classification. The model predicts user behavior based on dynamic features, without requiring any personal identifiable data.</p>
      </sec>
      <sec id="sec3dot2">
        <title>3.2. Mathematical Model: Artificial Intelligence Model</title>
        <p>The Artificial Intelligence model is based on supervised multinomial logistic regression with three (3) classes {0, 1, 2} with the objective of estimating conditional probabilities to predict the status of each transaction.</p>
        <p>3.2.1. Problem Definition</p>
        <p>We consider a set of transactions characterized by a vector of explanatory variables (features). Each transaction belongs to one of <inline-formula><mml:math><mml:mi> k </mml:mi></mml:math></inline-formula> classes:</p>
        <p>Class 0: if a transaction is considered normalClass 1: if a transaction is considered suspiciousClass 2: if a transaction is classified as proven fraud</p>
        <p>In this study, the suspicious class represents an intermediate category of transactions whose behavioral patterns deviate from the user’s typical financial habits without exhibiting the explicit markers of confirmed fraud. Operationally, these transactions show anomalies such as unusual transaction amounts, atypical frequency, unexpected geographic locations, irregular device usage, or abrupt changes in inactivity or failure rates, but remain insufficiently severe or inconsistent to be classified as fraudulent. Unlike normal transactions which align with the user’s established behavioral profile and fraudulent transactions which present strong indicators of malicious intent or unauthorized access, suspicious transactions occupy a gray zone of uncertainty, often serving as early warning signals of potential risk. This class is essential for modeling because it captures pre-fraud behaviors, transitional anomalies, and borderline cases where additional verification or monitoring may be required.</p>
        <p>3.2.2. Model Data Structure</p>
        <p><bold>Input vector structure:</bold><inline-formula><mml:math><mml:mover accent="true"><mml:mi> X </mml:mi><mml:mo> ^ </mml:mo></mml:mover></mml:math></inline-formula></p>
        <p>Each transaction <inline-formula><mml:math><mml:mi> i </mml:mi></mml:math></inline-formula> is represented by a vector <inline-formula><mml:math><mml:mrow><mml:msub><mml:mi> X </mml:mi><mml:mi> i </mml:mi></mml:msub><mml:mo> = </mml:mo><mml:mrow><mml:mo> [ </mml:mo><mml:mrow><mml:msub><mml:mi> x </mml:mi><mml:mrow><mml:mi> i </mml:mi><mml:mn> 1 </mml:mn></mml:mrow></mml:msub><mml:mo> , </mml:mo><mml:msub><mml:mi> x </mml:mi><mml:mrow><mml:mi> i </mml:mi><mml:mn> 2 </mml:mn></mml:mrow></mml:msub><mml:mo> , </mml:mo><mml:mo> ⋯ </mml:mo><mml:mo> , </mml:mo><mml:msub><mml:mi> x </mml:mi><mml:mrow><mml:mi> i </mml:mi><mml:mi> n </mml:mi></mml:mrow></mml:msub></mml:mrow><mml:mo> ] </mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula> , composed of relevant explanatory variables (features) listed in <bold>Table 1</bold>. These variables are derived from the analysis of the transactional context and user behavior.</p>
        <p>The vector <inline-formula><mml:math><mml:mrow><mml:msub><mml:mi> X </mml:mi><mml:mi> i </mml:mi></mml:msub></mml:mrow></mml:math></inline-formula> includes three types of variables:</p>
        <p>Continuous numerical variablesEncoded categorical variables (One-Hot)Derived behavioral/statistical variables</p>
        <p>Some variables, such as daily_tx_frequency or tx_failure_rate, can belong to two categories: they are numerical, but they also represent historical behavior. In a modeling pipeline, they are therefore processed twice: numerically and as behavioral indicators. The size of the input vector <inline-formula><mml:math><mml:mrow><mml:msub><mml:mi> X </mml:mi><mml:mi> i </mml:mi></mml:msub><mml:mo> = </mml:mo><mml:mrow><mml:mo> [ </mml:mo><mml:mrow><mml:msub><mml:mi> x </mml:mi><mml:mrow><mml:mi> i </mml:mi><mml:mn> 1 </mml:mn></mml:mrow></mml:msub><mml:mo> , </mml:mo><mml:msub><mml:mi> x </mml:mi><mml:mrow><mml:mi> i </mml:mi><mml:mn> 2 </mml:mn></mml:mrow></mml:msub><mml:mo> , </mml:mo><mml:mo> ⋯ </mml:mo><mml:mo> , </mml:mo><mml:msub><mml:mi> x </mml:mi><mml:mrow><mml:mi> i </mml:mi><mml:mi> n </mml:mi></mml:mrow></mml:msub></mml:mrow><mml:mo> ] </mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula> in the model is presented in <bold>Table 2</bold>, specifying the number of columns corresponding to the encoded numerical and categorical variables.</p>
        <p>Table 1. Model variables.</p>
        <table-wrap id="tbl1">
          <label>Table 1</label>
          <table>
            <tbody>
              <tr>
                <td>
                  <bold>Component</bold>
                </td>
                <td>
                  <bold>Variable</bold>
                </td>
                <td>
                  <bold>Variable Type</bold>
                </td>
                <td>
                  <bold>Role</bold>
                </td>
              </tr>
              <tr>
                <td>
                  <inline-formula>
                    <mml:math>
                      <mml:mrow>
                        <mml:msub>
                          <mml:mi>x</mml:mi>
                          <mml:mn>1</mml:mn>
                        </mml:msub>
                      </mml:mrow>
                    </mml:math>
                  </inline-formula>
                </td>
                <td>user_id</td>
                <td>Category (ID)</td>
                <td>User ID</td>
              </tr>
              <tr>
                <td>
                  <inline-formula>
                    <mml:math>
                      <mml:mrow>
                        <mml:msub>
                          <mml:mi>x</mml:mi>
                          <mml:mn>2</mml:mn>
                        </mml:msub>
                      </mml:mrow>
                    </mml:math>
                  </inline-formula>
                </td>
                <td>amount</td>
                <td>Continuous digital</td>
                <td>Transactional value</td>
              </tr>
              <tr>
                <td>
                  <inline-formula>
                    <mml:math>
                      <mml:mrow>
                        <mml:msub>
                          <mml:mi>x</mml:mi>
                          <mml:mn>3</mml:mn>
                        </mml:msub>
                      </mml:mrow>
                    </mml:math>
                  </inline-formula>
                </td>
                <td>transaction_type</td>
                <td>Nominal category</td>
                <td>Type of operation</td>
              </tr>
              <tr>
                <td>
                  <inline-formula>
                    <mml:math>
                      <mml:mrow>
                        <mml:msub>
                          <mml:mi>x</mml:mi>
                          <mml:mn>4</mml:mn>
                        </mml:msub>
                      </mml:mrow>
                    </mml:math>
                  </inline-formula>
                </td>
                <td>timestamp</td>
                <td>Continuous digital</td>
                <td>Timestamp (time)</td>
              </tr>
              <tr>
                <td>
                  <inline-formula>
                    <mml:math>
                      <mml:mrow>
                        <mml:msub>
                          <mml:mi>x</mml:mi>
                          <mml:mn>5</mml:mn>
                        </mml:msub>
                      </mml:mrow>
                    </mml:math>
                  </inline-formula>
                </td>
                <td>location</td>
                <td>Nominal category</td>
                <td>City of origin of each transaction</td>
              </tr>
              <tr>
                <td>
                  <inline-formula>
                    <mml:math>
                      <mml:mrow>
                        <mml:msub>
                          <mml:mi>x</mml:mi>
                          <mml:mn>6</mml:mn>
                        </mml:msub>
                      </mml:mrow>
                    </mml:math>
                  </inline-formula>
                </td>
                <td>daily_tx_frequency</td>
                <td>Continuous digital</td>
                <td>Number of transactions per day</td>
              </tr>
              <tr>
                <td>
                  <inline-formula>
                    <mml:math>
                      <mml:mrow>
                        <mml:msub>
                          <mml:mi>x</mml:mi>
                          <mml:mn>7</mml:mn>
                        </mml:msub>
                      </mml:mrow>
                    </mml:math>
                  </inline-formula>
                </td>
                <td>Device</td>
                <td>Nominal category</td>
                <td>Terminal used</td>
              </tr>
              <tr>
                <td>
                  <inline-formula>
                    <mml:math>
                      <mml:mrow>
                        <mml:msub>
                          <mml:mi>x</mml:mi>
                          <mml:mn>8</mml:mn>
                        </mml:msub>
                      </mml:mrow>
                    </mml:math>
                  </inline-formula>
                </td>
                <td>network</td>
                <td>Nominal category</td>
                <td>Transmission network</td>
              </tr>
              <tr>
                <td>
                  <inline-formula>
                    <mml:math>
                      <mml:mrow>
                        <mml:msub>
                          <mml:mi>x</mml:mi>
                          <mml:mn>9</mml:mn>
                        </mml:msub>
                      </mml:mrow>
                    </mml:math>
                  </inline-formula>
                </td>
                <td>average_amounts_last_10</td>
                <td>Continuous digital</td>
                <td>Historical moving average</td>
              </tr>
              <tr>
                <td>
                  <inline-formula>
                    <mml:math>
                      <mml:mrow>
                        <mml:msub>
                          <mml:mi>x</mml:mi>
                          <mml:mrow>
                            <mml:mn>10</mml:mn>
                          </mml:mrow>
                        </mml:msub>
                      </mml:mrow>
                    </mml:math>
                  </inline-formula>
                </td>
                <td>amount_type_difference_last_10</td>
                <td>Continuous digital</td>
                <td>Variability in recent amounts</td>
              </tr>
              <tr>
                <td>
                  <inline-formula>
                    <mml:math>
                      <mml:mrow>
                        <mml:msub>
                          <mml:mi>x</mml:mi>
                          <mml:mrow>
                            <mml:mn>11</mml:mn>
                          </mml:mrow>
                        </mml:msub>
                      </mml:mrow>
                    </mml:math>
                  </inline-formula>
                </td>
                <td>tx_failure_rate</td>
                <td>Continuous digital</td>
                <td>Transaction profile reliability</td>
              </tr>
              <tr>
                <td>
                  <inline-formula>
                    <mml:math>
                      <mml:mrow>
                        <mml:msub>
                          <mml:mi>x</mml:mi>
                          <mml:mrow>
                            <mml:mn>12</mml:mn>
                          </mml:mrow>
                        </mml:msub>
                      </mml:mrow>
                    </mml:math>
                  </inline-formula>
                </td>
                <td>inactivity_days</td>
                <td>Continuous digital</td>
                <td>Inactivity history</td>
              </tr>
            </tbody>
          </table>
        </table-wrap>
        <p>Table 2. Total dimension of the vector.</p>
        <table-wrap id="tbl2">
          <label>Table 2</label>
          <table>
            <tbody>
              <tr>
                <td>
                  <bold>Variable Type</bold>
                </td>
                <td>
                  <bold>Number of columns</bold>
                </td>
              </tr>
              <tr>
                <td>Continuous digital</td>
                <td>7</td>
              </tr>
              <tr>
                <td>Encoded categories</td>
                <td>5</td>
              </tr>
              <tr>
                <td>Total</td>
                <td>
                  <inline-formula>
                    <mml:math>
                      <mml:mrow>
                        <mml:mi>p</mml:mi>
                        <mml:mo>=</mml:mo>
                        <mml:mn>7</mml:mn>
                        <mml:mo>+</mml:mo>
                        <mml:mn>5</mml:mn>
                        <mml:mo>=</mml:mo>
                        <mml:mn>12</mml:mn>
                      </mml:mrow>
                    </mml:math>
                  </inline-formula>
                </td>
              </tr>
            </tbody>
          </table>
        </table-wrap>
        <p>So, the final input vector is: <inline-formula><mml:math><mml:mrow><mml:mtext> User_ </mml:mtext><mml:msub><mml:mi> X </mml:mi><mml:mi> i </mml:mi></mml:msub><mml:mo> = </mml:mo><mml:msup><mml:mrow><mml:mrow><mml:mo> [ </mml:mo><mml:mrow><mml:msub><mml:mi> x </mml:mi><mml:mrow><mml:mi> i </mml:mi><mml:mn> 1 </mml:mn></mml:mrow></mml:msub><mml:mo> , </mml:mo><mml:msub><mml:mi> x </mml:mi><mml:mrow><mml:mi> i </mml:mi><mml:mn> 2 </mml:mn></mml:mrow></mml:msub><mml:mo> , </mml:mo><mml:mo> ⋯ </mml:mo><mml:mo> , </mml:mo><mml:msub><mml:mi> x </mml:mi><mml:mrow><mml:mi> i </mml:mi><mml:mi> n </mml:mi></mml:mrow></mml:msub></mml:mrow><mml:mo> ] </mml:mo></mml:mrow></mml:mrow><mml:mtext> T </mml:mtext></mml:msup><mml:mo> ∈ </mml:mo><mml:msup><mml:mi> ℝ </mml:mi><mml:mrow><mml:mn> 12 </mml:mn></mml:mrow></mml:msup></mml:mrow></mml:math></inline-formula></p>
        <p>Thus, we construct a matrix <inline-formula><mml:math><mml:mrow><mml:mi> X </mml:mi><mml:mo> ∈ </mml:mo><mml:msup><mml:mi> ℝ </mml:mi><mml:mrow><mml:mi> n </mml:mi><mml:mo> × </mml:mo><mml:mi> p </mml:mi></mml:mrow></mml:msup></mml:mrow></mml:math></inline-formula> of input data, where:</p>
        <p><inline-formula><mml:math><mml:mi> n </mml:mi></mml:math></inline-formula> ∶ Number of transactions observed,</p>
        <p><inline-formula><mml:math><mml:mrow><mml:mi> p </mml:mi><mml:mo> = </mml:mo><mml:mn> 12 </mml:mn></mml:mrow></mml:math></inline-formula> : number of explanatory variables (features).</p>
        <disp-formula id="FD1">
          <mml:math>
            <mml:mrow>
              <mml:mi>X</mml:mi>
              <mml:mo>=</mml:mo>
              <mml:mrow>
                <mml:mo>[</mml:mo>
                <mml:mrow>
                  <mml:mtable>
                    <mml:mtr>
                      <mml:mtd>
                        <mml:mrow>
                          <mml:msub>
                            <mml:mi>x</mml:mi>
                            <mml:mrow>
                              <mml:mn>11</mml:mn>
                            </mml:mrow>
                          </mml:msub>
                        </mml:mrow>
                      </mml:mtd>
                      <mml:mtd>
                        <mml:mo>⋯</mml:mo>
                      </mml:mtd>
                      <mml:mtd>
                        <mml:mrow>
                          <mml:msub>
                            <mml:mi>x</mml:mi>
                            <mml:mrow>
                              <mml:mn>1</mml:mn>
                              <mml:mi>p</mml:mi>
                            </mml:mrow>
                          </mml:msub>
                        </mml:mrow>
                      </mml:mtd>
                    </mml:mtr>
                    <mml:mtr>
                      <mml:mtd>
                        <mml:mo>⋮</mml:mo>
                      </mml:mtd>
                      <mml:mtd>
                        <mml:mo>⋱</mml:mo>
                      </mml:mtd>
                      <mml:mtd>
                        <mml:mo>⋮</mml:mo>
                      </mml:mtd>
                    </mml:mtr>
                    <mml:mtr>
                      <mml:mtd>
                        <mml:mrow>
                          <mml:msub>
                            <mml:mi>x</mml:mi>
                            <mml:mrow>
                              <mml:mi>n</mml:mi>
                              <mml:mn>1</mml:mn>
                            </mml:mrow>
                          </mml:msub>
                        </mml:mrow>
                      </mml:mtd>
                      <mml:mtd>
                        <mml:mo>⋯</mml:mo>
                      </mml:mtd>
                      <mml:mtd>
                        <mml:mrow>
                          <mml:msub>
                            <mml:mi>x</mml:mi>
                            <mml:mrow>
                              <mml:mi>n</mml:mi>
                              <mml:mi>p</mml:mi>
                            </mml:mrow>
                          </mml:msub>
                        </mml:mrow>
                      </mml:mtd>
                    </mml:mtr>
                  </mml:mtable>
                </mml:mrow>
                <mml:mo>]</mml:mo>
              </mml:mrow>
              <mml:mo>∈</mml:mo>
              <mml:msup>
                <mml:mi>ℝ</mml:mi>
                <mml:mrow>
                  <mml:mi>n</mml:mi>
                  <mml:mo>×</mml:mo>
                  <mml:mn>12</mml:mn>
                </mml:mrow>
              </mml:msup>
            </mml:mrow>
          </mml:math>
        </disp-formula>
        <p>Each line <inline-formula><mml:math><mml:mrow><mml:msub><mml:mi> x </mml:mi><mml:mi> i </mml:mi></mml:msub><mml:mo> ∈ </mml:mo><mml:msup><mml:mi> ℝ </mml:mi><mml:mrow><mml:mn> 1 </mml:mn><mml:mo> × </mml:mo><mml:mi> p </mml:mi></mml:mrow></mml:msup></mml:mrow></mml:math></inline-formula> : represents a transaction, with the following validity assumptions:</p>
        <p>Conditional independence of observations.Log-linear relationship between variables and log-odds.</p>
        <p>There is a linear relationship between each input variable <inline-formula><mml:math><mml:mrow><mml:msub><mml:mi> x </mml:mi><mml:mi> i </mml:mi></mml:msub></mml:mrow></mml:math></inline-formula> and the log of the probability ratios:</p>
        <disp-formula id="FD2">
          <mml:math>
            <mml:mrow>
              <mml:mi>log</mml:mi>
              <mml:mrow>
                <mml:mo>(</mml:mo>
                <mml:mrow>
                  <mml:mfrac>
                    <mml:mrow>
                      <mml:mi>P</mml:mi>
                      <mml:mrow>
                        <mml:mo>(</mml:mo>
                        <mml:mrow>
                          <mml:mi>y</mml:mi>
                          <mml:mo>=</mml:mo>
                          <mml:mi>k</mml:mi>
                          <mml:mo>|</mml:mo>
                          <mml:mi>x</mml:mi>
                        </mml:mrow>
                        <mml:mo>)</mml:mo>
                      </mml:mrow>
                    </mml:mrow>
                    <mml:mrow>
                      <mml:mi>P</mml:mi>
                      <mml:mrow>
                        <mml:mo>(</mml:mo>
                        <mml:mrow>
                          <mml:mi>y</mml:mi>
                          <mml:mo>=</mml:mo>
                          <mml:mn>0</mml:mn>
                          <mml:mo>|</mml:mo>
                          <mml:mi>x</mml:mi>
                        </mml:mrow>
                        <mml:mo>)</mml:mo>
                      </mml:mrow>
                    </mml:mrow>
                  </mml:mfrac>
                </mml:mrow>
                <mml:mo>)</mml:mo>
              </mml:mrow>
              <mml:mo>=</mml:mo>
              <mml:msubsup>
                <mml:mi>β</mml:mi>
                <mml:mi>k</mml:mi>
                <mml:mtext>T</mml:mtext>
              </mml:msubsup>
              <mml:mi>x</mml:mi>
            </mml:mrow>
          </mml:math>
        </disp-formula>
        <p>This assumption is critical to the accuracy of the model.Low multicollinearity: The input variables <inline-formula><mml:math><mml:mrow><mml:msub><mml:mi> x </mml:mi><mml:mi> i </mml:mi></mml:msub></mml:mrow></mml:math></inline-formula> must not be collinear with each other.Reasonable class distributions (not too unbalanced)Correct encoding of binary and ordinal variables: necessary for model stability.Well-prepared data: The data must beCleaned (missing or outlier values handled)Encoded for categorical variablesNormalized or standardized for numerical variables<bold>Output vector structure:</bold><inline-formula><mml:math><mml:mover accent="true"><mml:mi> Y </mml:mi><mml:mo> ^ </mml:mo></mml:mover></mml:math></inline-formula></p>
        <p>The model’s output vector: <inline-formula><mml:math><mml:mrow><mml:msup><mml:mover accent="true"><mml:mi> Y </mml:mi><mml:mo> ^ </mml:mo></mml:mover><mml:mrow><mml:mrow><mml:mo> ( </mml:mo><mml:mrow><mml:mtext> User </mml:mtext><mml:mo> _ </mml:mo><mml:msub><mml:mi> X </mml:mi><mml:mi> i </mml:mi></mml:msub></mml:mrow><mml:mo> ) </mml:mo></mml:mrow></mml:mrow></mml:msup></mml:mrow></mml:math></inline-formula> which represents, for each observation (transaction), the probability of belonging to each risk class, as well as the class predicted by the model.</p>
        <disp-formula id="FD3">
          <mml:math>
            <mml:mrow>
              <mml:msup>
                <mml:mover accent="true">
                  <mml:mi>Y</mml:mi>
                  <mml:mo>^</mml:mo>
                </mml:mover>
                <mml:mrow>
                  <mml:mrow>
                    <mml:mo>(</mml:mo>
                    <mml:mi>i</mml:mi>
                    <mml:mo>)</mml:mo>
                  </mml:mrow>
                </mml:mrow>
              </mml:msup>
              <mml:mo>=</mml:mo>
              <mml:mo>:</mml:mo>
              <mml:mrow>
                <mml:mo>{</mml:mo>
                <mml:mtable columnalign="left">
                  <mml:mtr>
                    <mml:mtd>
                      <mml:mrow>
                        <mml:mo>[</mml:mo>
                        <mml:mrow>
                          <mml:mn>1</mml:mn>
                          <mml:mo>,</mml:mo>
                          <mml:mn>0</mml:mn>
                          <mml:mo>,</mml:mo>
                          <mml:mn>0</mml:mn>
                        </mml:mrow>
                        <mml:mo>]</mml:mo>
                      </mml:mrow>
                      <mml:mtext>
                         
                      </mml:mtext>
                      <mml:mtext>
                         
                      </mml:mtext>
                      <mml:mtext>if</mml:mtext>
                      <mml:mtext>
                         
                      </mml:mtext>
                      <mml:mtext>normal</mml:mtext>
                      <mml:mtext>
                         
                      </mml:mtext>
                      <mml:mrow>
                        <mml:mo>(</mml:mo>
                        <mml:mrow>
                          <mml:mtext>Classe</mml:mtext>
                          <mml:mtext>
                             
                          </mml:mtext>
                          <mml:mn>0</mml:mn>
                        </mml:mrow>
                        <mml:mo>)</mml:mo>
                      </mml:mrow>
                    </mml:mtd>
                  </mml:mtr>
                  <mml:mtr>
                    <mml:mtd>
                      <mml:mrow>
                        <mml:mo>[</mml:mo>
                        <mml:mrow>
                          <mml:mn>0</mml:mn>
                          <mml:mo>,</mml:mo>
                          <mml:mn>1</mml:mn>
                          <mml:mo>,</mml:mo>
                          <mml:mn>0</mml:mn>
                        </mml:mrow>
                        <mml:mo>]</mml:mo>
                      </mml:mrow>
                      <mml:mtext>
                         
                      </mml:mtext>
                      <mml:mtext>
                         
                      </mml:mtext>
                      <mml:mtext>if</mml:mtext>
                      <mml:mtext>
                         
                      </mml:mtext>
                      <mml:mtext>suspicious</mml:mtext>
                      <mml:mtext>
                         
                      </mml:mtext>
                      <mml:mrow>
                        <mml:mo>(</mml:mo>
                        <mml:mrow>
                          <mml:mtext>Classe</mml:mtext>
                          <mml:mtext>
                             
                          </mml:mtext>
                          <mml:mn>1</mml:mn>
                        </mml:mrow>
                        <mml:mo>)</mml:mo>
                      </mml:mrow>
                    </mml:mtd>
                  </mml:mtr>
                  <mml:mtr>
                    <mml:mtd>
                      <mml:mrow>
                        <mml:mo>[</mml:mo>
                        <mml:mrow>
                          <mml:mn>0</mml:mn>
                          <mml:mo>,</mml:mo>
                          <mml:mn>0</mml:mn>
                          <mml:mo>,</mml:mo>
                          <mml:mn>1</mml:mn>
                        </mml:mrow>
                        <mml:mo>]</mml:mo>
                      </mml:mrow>
                      <mml:mtext>
                         
                      </mml:mtext>
                      <mml:mtext>
                         
                      </mml:mtext>
                      <mml:mtext>if</mml:mtext>
                      <mml:mtext>
                         
                      </mml:mtext>
                      <mml:mtext>fraudulent</mml:mtext>
                      <mml:mtext>
                         
                      </mml:mtext>
                      <mml:mrow>
                        <mml:mo>(</mml:mo>
                        <mml:mrow>
                          <mml:mtext>Classe</mml:mtext>
                          <mml:mtext>
                             
                          </mml:mtext>
                          <mml:mn>2</mml:mn>
                        </mml:mrow>
                        <mml:mo>)</mml:mo>
                      </mml:mrow>
                    </mml:mtd>
                  </mml:mtr>
                </mml:mtable>
              </mml:mrow>
            </mml:mrow>
          </mml:math>
        </disp-formula>
        <p>So, the overall output matrix is:</p>
        <p>If, for a set of n transactions, the model produces an output matrix <inline-formula><mml:math><mml:mrow><mml:mover accent="true"><mml:mi> Y </mml:mi><mml:mo> ^ </mml:mo></mml:mover><mml:mo> ∈ </mml:mo><mml:msup><mml:mi> ℝ </mml:mi><mml:mrow><mml:mi> n </mml:mi><mml:mo> × </mml:mo><mml:mn> 3 </mml:mn></mml:mrow></mml:msup></mml:mrow></mml:math></inline-formula> :</p>
        <disp-formula id="FD4">
          <mml:math>
            <mml:mrow>
              <mml:mover accent="true">
                <mml:mi>Y</mml:mi>
                <mml:mo>^</mml:mo>
              </mml:mover>
              <mml:mo>=</mml:mo>
              <mml:mrow>
                <mml:mo>[</mml:mo>
                <mml:mrow>
                  <mml:mtable>
                    <mml:mtr>
                      <mml:mtd>
                        <mml:mrow>
                          <mml:msubsup>
                            <mml:mover accent="true">
                              <mml:mi>P</mml:mi>
                              <mml:mo>^</mml:mo>
                            </mml:mover>
                            <mml:mn>0</mml:mn>
                            <mml:mrow>
                              <mml:mrow>
                                <mml:mo>(</mml:mo>
                                <mml:mn>1</mml:mn>
                                <mml:mo>)</mml:mo>
                              </mml:mrow>
                            </mml:mrow>
                          </mml:msubsup>
                        </mml:mrow>
                      </mml:mtd>
                      <mml:mtd>
                        <mml:mrow>
                          <mml:msubsup>
                            <mml:mover accent="true">
                              <mml:mi>P</mml:mi>
                              <mml:mo>^</mml:mo>
                            </mml:mover>
                            <mml:mn>1</mml:mn>
                            <mml:mrow>
                              <mml:mrow>
                                <mml:mo>(</mml:mo>
                                <mml:mn>1</mml:mn>
                                <mml:mo>)</mml:mo>
                              </mml:mrow>
                            </mml:mrow>
                          </mml:msubsup>
                        </mml:mrow>
                      </mml:mtd>
                      <mml:mtd>
                        <mml:mrow>
                          <mml:msubsup>
                            <mml:mover accent="true">
                              <mml:mi>P</mml:mi>
                              <mml:mo>^</mml:mo>
                            </mml:mover>
                            <mml:mn>3</mml:mn>
                            <mml:mrow>
                              <mml:mrow>
                                <mml:mo>(</mml:mo>
                                <mml:mn>1</mml:mn>
                                <mml:mo>)</mml:mo>
                              </mml:mrow>
                            </mml:mrow>
                          </mml:msubsup>
                        </mml:mrow>
                      </mml:mtd>
                    </mml:mtr>
                    <mml:mtr>
                      <mml:mtd>
                        <mml:mo>⋮</mml:mo>
                      </mml:mtd>
                      <mml:mtd>
                        <mml:mo>⋱</mml:mo>
                      </mml:mtd>
                      <mml:mtd>
                        <mml:mo>⋮</mml:mo>
                      </mml:mtd>
                    </mml:mtr>
                    <mml:mtr>
                      <mml:mtd>
                        <mml:mrow>
                          <mml:msubsup>
                            <mml:mover accent="true">
                              <mml:mi>P</mml:mi>
                              <mml:mo>^</mml:mo>
                            </mml:mover>
                            <mml:mn>0</mml:mn>
                            <mml:mrow>
                              <mml:mrow>
                                <mml:mo>(</mml:mo>
                                <mml:mi>n</mml:mi>
                                <mml:mo>)</mml:mo>
                              </mml:mrow>
                            </mml:mrow>
                          </mml:msubsup>
                        </mml:mrow>
                      </mml:mtd>
                      <mml:mtd>
                        <mml:mrow>
                          <mml:msubsup>
                            <mml:mover accent="true">
                              <mml:mi>P</mml:mi>
                              <mml:mo>^</mml:mo>
                            </mml:mover>
                            <mml:mn>1</mml:mn>
                            <mml:mrow>
                              <mml:mrow>
                                <mml:mo>(</mml:mo>
                                <mml:mi>n</mml:mi>
                                <mml:mo>)</mml:mo>
                              </mml:mrow>
                            </mml:mrow>
                          </mml:msubsup>
                        </mml:mrow>
                      </mml:mtd>
                      <mml:mtd>
                        <mml:mrow>
                          <mml:msubsup>
                            <mml:mover accent="true">
                              <mml:mi>P</mml:mi>
                              <mml:mo>^</mml:mo>
                            </mml:mover>
                            <mml:mn>2</mml:mn>
                            <mml:mrow>
                              <mml:mrow>
                                <mml:mo>(</mml:mo>
                                <mml:mi>n</mml:mi>
                                <mml:mo>)</mml:mo>
                              </mml:mrow>
                            </mml:mrow>
                          </mml:msubsup>
                        </mml:mrow>
                      </mml:mtd>
                    </mml:mtr>
                  </mml:mtable>
                </mml:mrow>
                <mml:mo>]</mml:mo>
              </mml:mrow>
              <mml:mtext>
                 
              </mml:mtext>
              <mml:mtext>
                 
              </mml:mtext>
              <mml:mtext>et</mml:mtext>
              <mml:mtext>
                 
              </mml:mtext>
              <mml:mtext>
                 
              </mml:mtext>
              <mml:mover accent="true">
                <mml:mi>y</mml:mi>
                <mml:mo>^</mml:mo>
              </mml:mover>
              <mml:mo>=</mml:mo>
              <mml:mrow>
                <mml:mo>[</mml:mo>
                <mml:mrow>
                  <mml:mtable>
                    <mml:mtr>
                      <mml:mtd>
                        <mml:mrow>
                          <mml:msup>
                            <mml:mover accent="true">
                              <mml:mi>y</mml:mi>
                              <mml:mo>^</mml:mo>
                            </mml:mover>
                            <mml:mrow>
                              <mml:mrow>
                                <mml:mo>(</mml:mo>
                                <mml:mn>1</mml:mn>
                                <mml:mo>)</mml:mo>
                              </mml:mrow>
                            </mml:mrow>
                          </mml:msup>
                        </mml:mrow>
                      </mml:mtd>
                    </mml:mtr>
                    <mml:mtr>
                      <mml:mtd>
                        <mml:mo>⋮</mml:mo>
                      </mml:mtd>
                    </mml:mtr>
                    <mml:mtr>
                      <mml:mtd>
                        <mml:mrow>
                          <mml:msup>
                            <mml:mover accent="true">
                              <mml:mi>y</mml:mi>
                              <mml:mo>^</mml:mo>
                            </mml:mover>
                            <mml:mrow>
                              <mml:mrow>
                                <mml:mo>(</mml:mo>
                                <mml:mi>n</mml:mi>
                                <mml:mo>)</mml:mo>
                              </mml:mrow>
                            </mml:mrow>
                          </mml:msup>
                        </mml:mrow>
                      </mml:mtd>
                    </mml:mtr>
                  </mml:mtable>
                </mml:mrow>
                <mml:mo>]</mml:mo>
              </mml:mrow>
            </mml:mrow>
          </mml:math>
        </disp-formula>
        <p>where <inline-formula><mml:math><mml:mrow><mml:msup><mml:mover accent="true"><mml:mi> P </mml:mi><mml:mo> ^ </mml:mo></mml:mover><mml:mrow><mml:mrow><mml:mo> ( </mml:mo><mml:mi> i </mml:mi><mml:mo> ) </mml:mo></mml:mrow></mml:mrow></mml:msup></mml:mrow></mml:math></inline-formula> : probability of belonging to each risk class of a transaction <italic>i</italic>.</p>
        <p>3.2.3. Multinomial Logistic Regression (MLR) Model </p>
        <p><bold>Data and Ratings</bold></p>
        <p>Number of classes = 3 (<inline-formula><mml:math><mml:mrow><mml:mi> k </mml:mi><mml:mo> ∈ </mml:mo><mml:mrow><mml:mo> { </mml:mo><mml:mrow><mml:mn> 0 </mml:mn><mml:mo> , </mml:mo><mml:mn> 1 </mml:mn><mml:mo> , </mml:mo><mml:mn> 2 </mml:mn></mml:mrow><mml:mo> } </mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula> )</p>
        <p>Number of transactions <inline-formula><mml:math><mml:mi> n </mml:mi></mml:math></inline-formula></p>
        <p>Number of features: <inline-formula><mml:math><mml:mrow><mml:mi> p </mml:mi><mml:mo> = </mml:mo><mml:mn> 12 </mml:mn></mml:mrow></mml:math></inline-formula></p>
        <p>For each transaction <inline-formula><mml:math><mml:mrow><mml:mi> i </mml:mi><mml:mo> ∈ </mml:mo><mml:mrow><mml:mo> { </mml:mo><mml:mrow><mml:mn> 1 </mml:mn><mml:mo> , </mml:mo><mml:mo> ⋯ </mml:mo><mml:mo> , </mml:mo><mml:mi> n </mml:mi></mml:mrow><mml:mo> } </mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula></p>
        <p><inline-formula><mml:math><mml:mrow><mml:msub><mml:mi> x </mml:mi><mml:mi> i </mml:mi></mml:msub><mml:mo> ∈ </mml:mo><mml:msup><mml:mi> ℝ </mml:mi><mml:mi> p </mml:mi></mml:msup></mml:mrow></mml:math></inline-formula> : feature vector<inline-formula><mml:math><mml:mrow><mml:mi> X </mml:mi><mml:mo> ∈ </mml:mo><mml:msup><mml:mi> ℝ </mml:mi><mml:mrow><mml:mi> n </mml:mi><mml:mo> × </mml:mo><mml:mi> p </mml:mi></mml:mrow></mml:msup></mml:mrow></mml:math></inline-formula> : data matrix<inline-formula><mml:math display="inline"><mml:mrow><mml:msub><mml:mi> y </mml:mi><mml:mi> i </mml:mi></mml:msub><mml:mo> ∈ </mml:mo><mml:mrow><mml:mo> { </mml:mo><mml:mrow><mml:mn> 0 </mml:mn><mml:mo> , </mml:mo><mml:mn> 1 </mml:mn><mml:mo> , </mml:mo><mml:mn> 2 </mml:mn></mml:mrow><mml:mo> } </mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula> : actual class (one-hot encoded in <inline-formula><mml:math><mml:mrow><mml:mi> Y </mml:mi><mml:mo> ∈ </mml:mo><mml:msup><mml:mi> ℝ </mml:mi><mml:mrow><mml:mi> n </mml:mi><mml:mo> × </mml:mo><mml:mi> K </mml:mi></mml:mrow></mml:msup></mml:mrow></mml:math></inline-formula> )<inline-formula><mml:math><mml:mrow><mml:mi> W </mml:mi><mml:mo> ∈ </mml:mo><mml:msup><mml:mi> ℝ </mml:mi><mml:mrow><mml:mi> K </mml:mi><mml:mo> × </mml:mo><mml:mi> p </mml:mi></mml:mrow></mml:msup></mml:mrow></mml:math></inline-formula> : weight matrix (each row <inline-formula><mml:math><mml:mrow><mml:msub><mml:mi> w </mml:mi><mml:mi> k </mml:mi></mml:msub></mml:mrow></mml:math></inline-formula> corresponds to class <inline-formula><mml:math><mml:mi> k </mml:mi></mml:math></inline-formula> )<inline-formula><mml:math><mml:mrow><mml:mi> b </mml:mi><mml:mo> ∈ </mml:mo><mml:msup><mml:mi> ℝ </mml:mi><mml:mi> K </mml:mi></mml:msup></mml:mrow></mml:math></inline-formula> : bias vector (one bias per class)<bold>Activation function: SoftMax</bold></p>
        <p>For a transaction <inline-formula><mml:math><mml:mrow><mml:msub><mml:mi> x </mml:mi><mml:mi> i </mml:mi></mml:msub></mml:mrow></mml:math></inline-formula> , we calculate the logits:</p>
        <disp-formula id="FD5">
          <mml:math>
            <mml:mrow>
              <mml:msubsup>
                <mml:mi>z</mml:mi>
                <mml:mi>k</mml:mi>
                <mml:mrow>
                  <mml:mrow>
                    <mml:mo>(</mml:mo>
                    <mml:mi>i</mml:mi>
                    <mml:mo>)</mml:mo>
                  </mml:mrow>
                </mml:mrow>
              </mml:msubsup>
              <mml:mo>=</mml:mo>
              <mml:msubsup>
                <mml:mi>w</mml:mi>
                <mml:mi>k</mml:mi>
                <mml:mtext>Τ</mml:mtext>
              </mml:msubsup>
              <mml:mo>⋅</mml:mo>
              <mml:msub>
                <mml:mi>X</mml:mi>
                <mml:mi>i</mml:mi>
              </mml:msub>
              <mml:mo>+</mml:mo>
              <mml:msub>
                <mml:mi>b</mml:mi>
                <mml:mi>k</mml:mi>
              </mml:msub>
            </mml:mrow>
          </mml:math>
        </disp-formula>
        <p>We seek to estimate the probability that transaction <inline-formula><mml:math><mml:mi> i </mml:mi></mml:math></inline-formula> belongs to class <inline-formula><mml:math><mml:mi> k </mml:mi></mml:math></inline-formula> ∶</p>
        <disp-formula id="FD6">
          <mml:math>
            <mml:mrow>
              <mml:msubsup>
                <mml:mover accent="true">
                  <mml:mi>y</mml:mi>
                  <mml:mo>^</mml:mo>
                </mml:mover>
                <mml:mi>i</mml:mi>
                <mml:mrow>
                  <mml:mrow>
                    <mml:mo>(</mml:mo>
                    <mml:mi>k</mml:mi>
                    <mml:mo>)</mml:mo>
                  </mml:mrow>
                </mml:mrow>
              </mml:msubsup>
              <mml:mo>=</mml:mo>
              <mml:mi>P</mml:mi>
              <mml:mrow>
                <mml:mo>(</mml:mo>
                <mml:mrow>
                  <mml:msub>
                    <mml:mi>y</mml:mi>
                    <mml:mi>i</mml:mi>
                  </mml:msub>
                  <mml:mo>=</mml:mo>
                  <mml:mi>k</mml:mi>
                  <mml:mo>|</mml:mo>
                  <mml:msub>
                    <mml:mi>X</mml:mi>
                    <mml:mi>i</mml:mi>
                  </mml:msub>
                </mml:mrow>
                <mml:mo>)</mml:mo>
              </mml:mrow>
              <mml:mo>=</mml:mo>
              <mml:mfrac>
                <mml:mrow>
                  <mml:msup>
                    <mml:mtext>e</mml:mtext>
                    <mml:mrow>
                      <mml:msubsup>
                        <mml:mi>z</mml:mi>
                        <mml:mi>k</mml:mi>
                        <mml:mrow>
                          <mml:mrow>
                            <mml:mo>(</mml:mo>
                            <mml:mi>i</mml:mi>
                            <mml:mo>)</mml:mo>
                          </mml:mrow>
                        </mml:mrow>
                      </mml:msubsup>
                    </mml:mrow>
                  </mml:msup>
                </mml:mrow>
                <mml:mrow>
                  <mml:mstyle displaystyle="true">
                    <mml:msubsup>
                      <mml:mo>∑</mml:mo>
                      <mml:mrow>
                        <mml:mi>k</mml:mi>
                        <mml:mo>=</mml:mo>
                        <mml:mn>0</mml:mn>
                      </mml:mrow>
                      <mml:mrow>
                        <mml:mi>K</mml:mi>
                        <mml:mo>−</mml:mo>
                        <mml:mn>1</mml:mn>
                      </mml:mrow>
                    </mml:msubsup>
                    <mml:mrow>
                      <mml:msup>
                        <mml:mtext>e</mml:mtext>
                        <mml:mrow>
                          <mml:msubsup>
                            <mml:mi>z</mml:mi>
                            <mml:mi>k</mml:mi>
                            <mml:mrow>
                              <mml:mrow>
                                <mml:mo>(</mml:mo>
                                <mml:mi>i</mml:mi>
                                <mml:mo>)</mml:mo>
                              </mml:mrow>
                            </mml:mrow>
                          </mml:msubsup>
                        </mml:mrow>
                      </mml:msup>
                    </mml:mrow>
                  </mml:mstyle>
                </mml:mrow>
              </mml:mfrac>
            </mml:mrow>
          </mml:math>
        </disp-formula>
        <p>This SoftMax function ensures that:</p>
        <disp-formula id="FD7">
          <mml:math>
            <mml:mrow>
              <mml:mstyle displaystyle="true">
                <mml:munderover>
                  <mml:mo>∑</mml:mo>
                  <mml:mrow>
                    <mml:mi>k</mml:mi>
                    <mml:mo>=</mml:mo>
                    <mml:mn>0</mml:mn>
                  </mml:mrow>
                  <mml:mrow>
                    <mml:mi>K</mml:mi>
                    <mml:mo>−</mml:mo>
                    <mml:mn>1</mml:mn>
                  </mml:mrow>
                </mml:munderover>
                <mml:mrow>
                  <mml:msubsup>
                    <mml:mover accent="true">
                      <mml:mi>y</mml:mi>
                      <mml:mo>^</mml:mo>
                    </mml:mover>
                    <mml:mi>i</mml:mi>
                    <mml:mrow>
                      <mml:mrow>
                        <mml:mo>(</mml:mo>
                        <mml:mi>k</mml:mi>
                        <mml:mo>)</mml:mo>
                      </mml:mrow>
                    </mml:mrow>
                  </mml:msubsup>
                </mml:mrow>
              </mml:mstyle>
              <mml:mo>=</mml:mo>
              <mml:mn>1</mml:mn>
            </mml:mrow>
          </mml:math>
        </disp-formula>
        <disp-formula id="FD8">
          <mml:math>
            <mml:mrow>
              <mml:mn>0</mml:mn>
              <mml:mo>≤</mml:mo>
              <mml:msubsup>
                <mml:mover accent="true">
                  <mml:mi>y</mml:mi>
                  <mml:mo>^</mml:mo>
                </mml:mover>
                <mml:mi>i</mml:mi>
                <mml:mrow>
                  <mml:mrow>
                    <mml:mo>(</mml:mo>
                    <mml:mi>k</mml:mi>
                    <mml:mo>)</mml:mo>
                  </mml:mrow>
                </mml:mrow>
              </mml:msubsup>
              <mml:mo>≤</mml:mo>
              <mml:mn>1</mml:mn>
            </mml:mrow>
          </mml:math>
        </disp-formula>
        <p><bold>Loss function: Cross-entropy</bold></p>
        <p>The objective is to minimize the error between the predicted probabilities and the actual classes. </p>
        <p>The cost function to be minimized across all transactions is:</p>
        <disp-formula id="FD9">
          <mml:math>
            <mml:mrow>
              <mml:msup>
                <mml:mi>ℒ</mml:mi>
                <mml:mrow>
                  <mml:mrow>
                    <mml:mo>(</mml:mo>
                    <mml:mi>i</mml:mi>
                    <mml:mo>)</mml:mo>
                  </mml:mrow>
                </mml:mrow>
              </mml:msup>
              <mml:mo>=</mml:mo>
              <mml:mo>−</mml:mo>
              <mml:mstyle displaystyle="true">
                <mml:munderover>
                  <mml:mo>∑</mml:mo>
                  <mml:mrow>
                    <mml:mi>k</mml:mi>
                    <mml:mo>=</mml:mo>
                    <mml:mn>1</mml:mn>
                  </mml:mrow>
                  <mml:mn>3</mml:mn>
                </mml:munderover>
                <mml:mrow>
                  <mml:msubsup>
                    <mml:mi>y</mml:mi>
                    <mml:mi>i</mml:mi>
                    <mml:mrow>
                      <mml:mrow>
                        <mml:mo>(</mml:mo>
                        <mml:mi>k</mml:mi>
                        <mml:mo>)</mml:mo>
                      </mml:mrow>
                    </mml:mrow>
                  </mml:msubsup>
                  <mml:mi>log</mml:mi>
                  <mml:mrow>
                    <mml:mo>(</mml:mo>
                    <mml:mrow>
                      <mml:msubsup>
                        <mml:mover accent="true">
                          <mml:mi>y</mml:mi>
                          <mml:mo>^</mml:mo>
                        </mml:mover>
                        <mml:mi>i</mml:mi>
                        <mml:mrow>
                          <mml:mrow>
                            <mml:mo>(</mml:mo>
                            <mml:mi>k</mml:mi>
                            <mml:mo>)</mml:mo>
                          </mml:mrow>
                        </mml:mrow>
                      </mml:msubsup>
                    </mml:mrow>
                    <mml:mo>)</mml:mo>
                  </mml:mrow>
                </mml:mrow>
              </mml:mstyle>
            </mml:mrow>
          </mml:math>
        </disp-formula>
        <p>Were:</p>
        <p><inline-formula><mml:math><mml:mrow><mml:msubsup><mml:mi> y </mml:mi><mml:mi> i </mml:mi><mml:mrow><mml:mrow><mml:mo> ( </mml:mo><mml:mi> k </mml:mi><mml:mo> ) </mml:mo></mml:mrow></mml:mrow></mml:msubsup><mml:mo> = </mml:mo><mml:mn> 1 </mml:mn></mml:mrow></mml:math></inline-formula> f the true class of transaction <inline-formula><mml:math><mml:mi> i </mml:mi></mml:math></inline-formula> is <inline-formula><mml:math><mml:mi> k </mml:mi></mml:math></inline-formula> , otherwise 0</p>
        <p>The total cost function (across all transactions):</p>
        <disp-formula id="FD10">
          <mml:math>
            <mml:mrow>
              <mml:mi mathvariant="script">T</mml:mi>
              <mml:mrow>
                <mml:mo>(</mml:mo>
                <mml:mrow>
                  <mml:mi>W</mml:mi>
                  <mml:mo>,</mml:mo>
                  <mml:mi>b</mml:mi>
                </mml:mrow>
                <mml:mo>)</mml:mo>
              </mml:mrow>
              <mml:mo>=</mml:mo>
              <mml:mfrac>
                <mml:mn>1</mml:mn>
                <mml:mi>n</mml:mi>
              </mml:mfrac>
              <mml:mstyle displaystyle="true">
                <mml:munderover>
                  <mml:mo>∑</mml:mo>
                  <mml:mrow>
                    <mml:mi>i</mml:mi>
                    <mml:mo>=</mml:mo>
                    <mml:mn>1</mml:mn>
                  </mml:mrow>
                  <mml:mi>n</mml:mi>
                </mml:munderover>
                <mml:mrow>
                  <mml:msup>
                    <mml:mi>ℒ</mml:mi>
                    <mml:mrow>
                      <mml:mrow>
                        <mml:mo>(</mml:mo>
                        <mml:mi>i</mml:mi>
                        <mml:mo>)</mml:mo>
                      </mml:mrow>
                    </mml:mrow>
                  </mml:msup>
                </mml:mrow>
              </mml:mstyle>
            </mml:mrow>
          </mml:math>
        </disp-formula>
        <p><bold>Derivation of weight and bias gradients</bold><inline-formula><mml:math><mml:mrow><mml:mi> X </mml:mi><mml:mo> ∈ </mml:mo><mml:msup><mml:mi> ℝ </mml:mi><mml:mrow><mml:mi> n </mml:mi><mml:mo> × </mml:mo><mml:mi> d </mml:mi></mml:mrow></mml:msup></mml:mrow></mml:math></inline-formula> : input matrix<inline-formula><mml:math><mml:mrow><mml:mover accent="true"><mml:mi> Y </mml:mi><mml:mo> ^ </mml:mo></mml:mover><mml:mo> ∈ </mml:mo><mml:msup><mml:mi> ℝ </mml:mi><mml:mrow><mml:mi> n </mml:mi><mml:mo> × </mml:mo><mml:mn> 3 </mml:mn></mml:mrow></mml:msup></mml:mrow></mml:math></inline-formula> : predictions<inline-formula><mml:math><mml:mrow><mml:mi> Y </mml:mi><mml:mo> ∈ </mml:mo><mml:msup><mml:mi> ℝ </mml:mi><mml:mrow><mml:mi> n </mml:mi><mml:mo> × </mml:mo><mml:mn> 3 </mml:mn></mml:mrow></mml:msup></mml:mrow></mml:math></inline-formula> : real labels (one-hot)<bold>Gradient relative to weights</bold>: <inline-formula><mml:math><mml:mstyle mathvariant="bold" mathsize="normal"><mml:mi> W </mml:mi></mml:mstyle></mml:math></inline-formula></p>
        <disp-formula id="FD11">
          <mml:math>
            <mml:mrow>
              <mml:msub>
                <mml:mo>∇</mml:mo>
                <mml:mi>W</mml:mi>
              </mml:msub>
              <mml:mi mathvariant="script">T</mml:mi>
              <mml:mrow>
                <mml:mo>(</mml:mo>
                <mml:mrow>
                  <mml:mi>W</mml:mi>
                  <mml:mo>,</mml:mo>
                  <mml:mi>b</mml:mi>
                </mml:mrow>
                <mml:mo>)</mml:mo>
              </mml:mrow>
              <mml:mo>=</mml:mo>
              <mml:mfrac>
                <mml:mn>1</mml:mn>
                <mml:mi>n</mml:mi>
              </mml:mfrac>
              <mml:munderover>
                <mml:mstyle mathsize="140%" displaystyle="true">
                  <mml:mo>∑</mml:mo>
                </mml:mstyle>
                <mml:mrow>
                  <mml:mi>i</mml:mi>
                  <mml:mo>=</mml:mo>
                  <mml:mn>1</mml:mn>
                </mml:mrow>
                <mml:mi>n</mml:mi>
              </mml:munderover>
              <mml:mrow>
                <mml:mo>(</mml:mo>
                <mml:mrow>
                  <mml:msup>
                    <mml:mover accent="true">
                      <mml:mi>y</mml:mi>
                      <mml:mo>^</mml:mo>
                    </mml:mover>
                    <mml:mrow>
                      <mml:mrow>
                        <mml:mo>(</mml:mo>
                        <mml:mi>i</mml:mi>
                        <mml:mo>)</mml:mo>
                      </mml:mrow>
                    </mml:mrow>
                  </mml:msup>
                  <mml:mo>−</mml:mo>
                  <mml:msup>
                    <mml:mi>y</mml:mi>
                    <mml:mrow>
                      <mml:mrow>
                        <mml:mo>(</mml:mo>
                        <mml:mi>i</mml:mi>
                        <mml:mo>)</mml:mo>
                      </mml:mrow>
                    </mml:mrow>
                  </mml:msup>
                </mml:mrow>
                <mml:mo>)</mml:mo>
              </mml:mrow>
              <mml:mo>⋅</mml:mo>
              <mml:mrow>
                <mml:mo>(</mml:mo>
                <mml:mrow>
                  <mml:msup>
                    <mml:mi>x</mml:mi>
                    <mml:mrow>
                      <mml:mrow>
                        <mml:mo>(</mml:mo>
                        <mml:mi>i</mml:mi>
                        <mml:mo>)</mml:mo>
                      </mml:mrow>
                    </mml:mrow>
                  </mml:msup>
                </mml:mrow>
                <mml:mo>)</mml:mo>
              </mml:mrow>
              <mml:mo>⇒</mml:mo>
              <mml:msup>
                <mml:mi>ℝ</mml:mi>
                <mml:mrow>
                  <mml:mn>3</mml:mn>
                  <mml:mo>×</mml:mo>
                  <mml:mi>d</mml:mi>
                </mml:mrow>
              </mml:msup>
            </mml:mrow>
          </mml:math>
        </disp-formula>
        <p>We measure the difference between the prediction and the truth and weight it by the variable <inline-formula><mml:math><mml:mrow><mml:msup><mml:mi> x </mml:mi><mml:mrow><mml:mrow><mml:mo> ( </mml:mo><mml:mi> i </mml:mi><mml:mo> ) </mml:mo></mml:mrow></mml:mrow></mml:msup></mml:mrow></mml:math></inline-formula> .</p>
        <p>Gradient relative to bias: <inline-formula><mml:math><mml:mi> b </mml:mi></mml:math></inline-formula></p>
        <disp-formula id="FD12">
          <mml:math>
            <mml:mrow>
              <mml:msub>
                <mml:mo>∇</mml:mo>
                <mml:mi>b</mml:mi>
              </mml:msub>
              <mml:mi mathvariant="script">T</mml:mi>
              <mml:mrow>
                <mml:mo>(</mml:mo>
                <mml:mrow>
                  <mml:mi>W</mml:mi>
                  <mml:mo>,</mml:mo>
                  <mml:mi>b</mml:mi>
                </mml:mrow>
                <mml:mo>)</mml:mo>
              </mml:mrow>
              <mml:mo>=</mml:mo>
              <mml:mfrac>
                <mml:mn>1</mml:mn>
                <mml:mi>n</mml:mi>
              </mml:mfrac>
              <mml:munderover>
                <mml:mstyle displaystyle="true" mathsize="140%">
                  <mml:mo>∑</mml:mo>
                </mml:mstyle>
                <mml:mrow>
                  <mml:mi>i</mml:mi>
                  <mml:mo>=</mml:mo>
                  <mml:mn>1</mml:mn>
                </mml:mrow>
                <mml:mi>n</mml:mi>
              </mml:munderover>
              <mml:mrow>
                <mml:mo>(</mml:mo>
                <mml:mrow>
                  <mml:msup>
                    <mml:mover accent="true">
                      <mml:mi>y</mml:mi>
                      <mml:mo>^</mml:mo>
                    </mml:mover>
                    <mml:mrow>
                      <mml:mrow>
                        <mml:mo>(</mml:mo>
                        <mml:mi>i</mml:mi>
                        <mml:mo>)</mml:mo>
                      </mml:mrow>
                    </mml:mrow>
                  </mml:msup>
                  <mml:mo>−</mml:mo>
                  <mml:msup>
                    <mml:mi>y</mml:mi>
                    <mml:mrow>
                      <mml:mrow>
                        <mml:mo>(</mml:mo>
                        <mml:mi>i</mml:mi>
                        <mml:mo>)</mml:mo>
                      </mml:mrow>
                    </mml:mrow>
                  </mml:msup>
                </mml:mrow>
                <mml:mo>)</mml:mo>
              </mml:mrow>
              <mml:mo>⇒</mml:mo>
              <mml:msup>
                <mml:mi>ℝ</mml:mi>
                <mml:mn>3</mml:mn>
              </mml:msup>
              <mml:mtext>
              </mml:mtext>
            </mml:mrow>
          </mml:math>
        </disp-formula>
        <p>Were:</p>
        <p><inline-formula><mml:math><mml:mrow><mml:msup><mml:mover accent="true"><mml:mi> y </mml:mi><mml:mo> ^ </mml:mo></mml:mover><mml:mrow><mml:mrow><mml:mo> ( </mml:mo><mml:mi> i </mml:mi><mml:mo> ) </mml:mo></mml:mrow></mml:mrow></mml:msup><mml:mo> ∈ </mml:mo><mml:msup><mml:mi> ℝ </mml:mi><mml:mi> K </mml:mi></mml:msup></mml:mrow></mml:math></inline-formula> : SoftMax predictions of the transaction <inline-formula><mml:math><mml:mi> i </mml:mi></mml:math></inline-formula><inline-formula><mml:math><mml:mrow><mml:msup><mml:mi> y </mml:mi><mml:mrow><mml:mrow><mml:mo> ( </mml:mo><mml:mi> i </mml:mi><mml:mo> ) </mml:mo></mml:mrow></mml:mrow></mml:msup><mml:mo> ∈ </mml:mo><mml:msup><mml:mi> ℝ </mml:mi><mml:mi> K </mml:mi></mml:msup></mml:mrow></mml:math></inline-formula> : One-hot vector of the actual classUpdate the coefficients (iteration <inline-formula><mml:math display="inline"><mml:mrow><mml:mi> t </mml:mi><mml:mo> → </mml:mo><mml:mi> t </mml:mi><mml:mo> + </mml:mo><mml:mn> 1 </mml:mn></mml:mrow></mml:math></inline-formula> )</p>
        <p>At each iteration, the parameters <inline-formula><mml:math><mml:mi> W </mml:mi></mml:math></inline-formula> (weight) and <inline-formula><mml:math><mml:mi> b </mml:mi></mml:math></inline-formula> (bias) are updated using gradient descent. The update is:</p>
        <p><bold>For weight</bold><bold>:</bold></p>
        <disp-formula id="FD13">
          <mml:math>
            <mml:mrow>
              <mml:msup>
                <mml:mi>W</mml:mi>
                <mml:mrow>
                  <mml:mrow>
                    <mml:mo>(</mml:mo>
                    <mml:mrow>
                      <mml:mi>t</mml:mi>
                      <mml:mo>+</mml:mo>
                      <mml:mn>1</mml:mn>
                    </mml:mrow>
                    <mml:mo>)</mml:mo>
                  </mml:mrow>
                </mml:mrow>
              </mml:msup>
              <mml:mo>:</mml:mo>
              <mml:mo>=</mml:mo>
              <mml:msup>
                <mml:mi>W</mml:mi>
                <mml:mrow>
                  <mml:mrow>
                    <mml:mo>(</mml:mo>
                    <mml:mi>t</mml:mi>
                    <mml:mo>)</mml:mo>
                  </mml:mrow>
                </mml:mrow>
              </mml:msup>
              <mml:mo>+</mml:mo>
              <mml:mi>α</mml:mi>
              <mml:msub>
                <mml:mo>∇</mml:mo>
                <mml:mi>W</mml:mi>
              </mml:msub>
              <mml:mi mathvariant="script">T</mml:mi>
              <mml:mrow>
                <mml:mo>(</mml:mo>
                <mml:mrow>
                  <mml:mi>W</mml:mi>
                  <mml:mo>,</mml:mo>
                  <mml:mi>b</mml:mi>
                </mml:mrow>
                <mml:mo>)</mml:mo>
              </mml:mrow>
              <mml:mo>=</mml:mo>
              <mml:msup>
                <mml:mi>W</mml:mi>
                <mml:mrow>
                  <mml:mrow>
                    <mml:mo>(</mml:mo>
                    <mml:mi>t</mml:mi>
                    <mml:mo>)</mml:mo>
                  </mml:mrow>
                </mml:mrow>
              </mml:msup>
              <mml:mo>+</mml:mo>
              <mml:mi>α</mml:mi>
              <mml:mrow>
                <mml:mo>[</mml:mo>
                <mml:mrow>
                  <mml:mfrac>
                    <mml:mn>1</mml:mn>
                    <mml:mi>n</mml:mi>
                  </mml:mfrac>
                  <mml:munderover>
                    <mml:mstyle mathsize="140%" displaystyle="true">
                      <mml:mo>∑</mml:mo>
                    </mml:mstyle>
                    <mml:mrow>
                      <mml:mi>i</mml:mi>
                      <mml:mo>=</mml:mo>
                      <mml:mn>1</mml:mn>
                    </mml:mrow>
                    <mml:mi>n</mml:mi>
                  </mml:munderover>
                  <mml:mrow>
                    <mml:mo>(</mml:mo>
                    <mml:mrow>
                      <mml:msup>
                        <mml:mover accent="true">
                          <mml:mi>y</mml:mi>
                          <mml:mo>^</mml:mo>
                        </mml:mover>
                        <mml:mrow>
                          <mml:mrow>
                            <mml:mo>(</mml:mo>
                            <mml:mi>i</mml:mi>
                            <mml:mo>)</mml:mo>
                          </mml:mrow>
                        </mml:mrow>
                      </mml:msup>
                      <mml:mo>−</mml:mo>
                      <mml:msup>
                        <mml:mi>y</mml:mi>
                        <mml:mrow>
                          <mml:mrow>
                            <mml:mo>(</mml:mo>
                            <mml:mi>i</mml:mi>
                            <mml:mo>)</mml:mo>
                          </mml:mrow>
                        </mml:mrow>
                      </mml:msup>
                    </mml:mrow>
                    <mml:mo>)</mml:mo>
                  </mml:mrow>
                  <mml:mo>⋅</mml:mo>
                  <mml:mrow>
                    <mml:mo>(</mml:mo>
                    <mml:mrow>
                      <mml:msup>
                        <mml:mi>x</mml:mi>
                        <mml:mrow>
                          <mml:mrow>
                            <mml:mo>(</mml:mo>
                            <mml:mi>i</mml:mi>
                            <mml:mo>)</mml:mo>
                          </mml:mrow>
                        </mml:mrow>
                      </mml:msup>
                    </mml:mrow>
                    <mml:mo>)</mml:mo>
                  </mml:mrow>
                </mml:mrow>
                <mml:mo>]</mml:mo>
              </mml:mrow>
            </mml:mrow>
          </mml:math>
        </disp-formula>
        <p><bold>For bia</bold><bold>s:</bold></p>
        <disp-formula id="FD14">
          <mml:math>
            <mml:mrow>
              <mml:msup>
                <mml:mi>b</mml:mi>
                <mml:mrow>
                  <mml:mrow>
                    <mml:mo>(</mml:mo>
                    <mml:mrow>
                      <mml:mi>t</mml:mi>
                      <mml:mo>+</mml:mo>
                      <mml:mn>1</mml:mn>
                    </mml:mrow>
                    <mml:mo>)</mml:mo>
                  </mml:mrow>
                </mml:mrow>
              </mml:msup>
              <mml:mo>:</mml:mo>
              <mml:mo>=</mml:mo>
              <mml:msup>
                <mml:mi>b</mml:mi>
                <mml:mrow>
                  <mml:mrow>
                    <mml:mo>(</mml:mo>
                    <mml:mi>t</mml:mi>
                    <mml:mo>)</mml:mo>
                  </mml:mrow>
                </mml:mrow>
              </mml:msup>
              <mml:mo>+</mml:mo>
              <mml:mi>α</mml:mi>
              <mml:msub>
                <mml:mo>∇</mml:mo>
                <mml:mi>b</mml:mi>
              </mml:msub>
              <mml:mi mathvariant="script">T</mml:mi>
              <mml:mrow>
                <mml:mo>(</mml:mo>
                <mml:mrow>
                  <mml:mi>W</mml:mi>
                  <mml:mo>,</mml:mo>
                  <mml:mi>b</mml:mi>
                </mml:mrow>
                <mml:mo>)</mml:mo>
              </mml:mrow>
              <mml:mo>=</mml:mo>
              <mml:msup>
                <mml:mi>b</mml:mi>
                <mml:mrow>
                  <mml:mrow>
                    <mml:mo>(</mml:mo>
                    <mml:mi>t</mml:mi>
                    <mml:mo>)</mml:mo>
                  </mml:mrow>
                </mml:mrow>
              </mml:msup>
              <mml:mo>+</mml:mo>
              <mml:mi>α</mml:mi>
              <mml:mrow>
                <mml:mo>[</mml:mo>
                <mml:mrow>
                  <mml:mfrac>
                    <mml:mn>1</mml:mn>
                    <mml:mi>n</mml:mi>
                  </mml:mfrac>
                  <mml:munderover>
                    <mml:mstyle mathsize="140%" displaystyle="true">
                      <mml:mo>∑</mml:mo>
                    </mml:mstyle>
                    <mml:mrow>
                      <mml:mi>i</mml:mi>
                      <mml:mo>=</mml:mo>
                      <mml:mn>1</mml:mn>
                    </mml:mrow>
                    <mml:mi>n</mml:mi>
                  </mml:munderover>
                  <mml:mrow>
                    <mml:mo>(</mml:mo>
                    <mml:mrow>
                      <mml:msup>
                        <mml:mover accent="true">
                          <mml:mi>y</mml:mi>
                          <mml:mo>^</mml:mo>
                        </mml:mover>
                        <mml:mrow>
                          <mml:mrow>
                            <mml:mo>(</mml:mo>
                            <mml:mi>i</mml:mi>
                            <mml:mo>)</mml:mo>
                          </mml:mrow>
                        </mml:mrow>
                      </mml:msup>
                      <mml:mo>−</mml:mo>
                      <mml:msup>
                        <mml:mi>y</mml:mi>
                        <mml:mrow>
                          <mml:mrow>
                            <mml:mo>(</mml:mo>
                            <mml:mi>i</mml:mi>
                            <mml:mo>)</mml:mo>
                          </mml:mrow>
                        </mml:mrow>
                      </mml:msup>
                    </mml:mrow>
                    <mml:mo>)</mml:mo>
                  </mml:mrow>
                </mml:mrow>
                <mml:mo>]</mml:mo>
              </mml:mrow>
            </mml:mrow>
          </mml:math>
        </disp-formula>
        <p>Were:</p>
        <p><inline-formula><mml:math><mml:mi> α </mml:mi></mml:math></inline-formula> : learning rate<inline-formula><mml:math><mml:mrow><mml:msub><mml:mo> ∇ </mml:mo><mml:mi> W </mml:mi></mml:msub><mml:mi mathvariant="script"> T </mml:mi><mml:mrow><mml:mo> ( </mml:mo><mml:mrow><mml:mi> W </mml:mi><mml:mo> , </mml:mo><mml:mi> b </mml:mi></mml:mrow><mml:mo> ) </mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula> : gradient of the cost function with respect to the weights<inline-formula><mml:math><mml:mrow><mml:msub><mml:mo> ∇ </mml:mo><mml:mi> b </mml:mi></mml:msub><mml:mi mathvariant="script"> T </mml:mi><mml:mrow><mml:mo> ( </mml:mo><mml:mrow><mml:mi> W </mml:mi><mml:mo> , </mml:mo><mml:mi> b </mml:mi></mml:mrow><mml:mo> ) </mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula> : gradient of the cost function with respect to biases</p>
        <p>Note: The weight and bias are updated so that the model learns to better predict the correct classes, gradually adjusting to the data structure.</p>
        <p>Final prediction</p>
        <p>The RLM model will learn to approximate the probability that each transaction (<inline-formula><mml:math><mml:mi> i </mml:mi></mml:math></inline-formula> ) belongs to one of the three classes. </p>
        <p>We denote this prediction by: We choose the class with the highest probability for a transaction (<inline-formula><mml:math><mml:mi> i </mml:mi></mml:math></inline-formula> ):</p>
        <disp-formula id="FD15">
          <mml:math>
            <mml:mrow>
              <mml:msup>
                <mml:mover accent="true">
                  <mml:mi>y</mml:mi>
                  <mml:mo>^</mml:mo>
                </mml:mover>
                <mml:mrow>
                  <mml:mrow>
                    <mml:mo>(</mml:mo>
                    <mml:mi>i</mml:mi>
                    <mml:mo>)</mml:mo>
                  </mml:mrow>
                </mml:mrow>
              </mml:msup>
              <mml:mo>=</mml:mo>
              <mml:mi>arg</mml:mi>
              <mml:munder>
                <mml:mrow>
                  <mml:mi>max</mml:mi>
                </mml:mrow>
                <mml:mrow>
                  <mml:mi>k</mml:mi>
                  <mml:mo>∈</mml:mo>
                  <mml:mrow>
                    <mml:mo>{</mml:mo>
                    <mml:mrow>
                      <mml:mn>0</mml:mn>
                      <mml:mo>,</mml:mo>
                      <mml:mo>⋯</mml:mo>
                      <mml:mo>,</mml:mo>
                      <mml:mi>K</mml:mi>
                      <mml:mo>−</mml:mo>
                      <mml:mn>1</mml:mn>
                    </mml:mrow>
                    <mml:mo>}</mml:mo>
                  </mml:mrow>
                </mml:mrow>
              </mml:munder>
              <mml:mrow>
                <mml:mo>(</mml:mo>
                <mml:mrow>
                  <mml:msubsup>
                    <mml:mi>P</mml:mi>
                    <mml:mi>k</mml:mi>
                    <mml:mrow>
                      <mml:mrow>
                        <mml:mo>(</mml:mo>
                        <mml:mi>i</mml:mi>
                        <mml:mo>)</mml:mo>
                      </mml:mrow>
                    </mml:mrow>
                  </mml:msubsup>
                </mml:mrow>
                <mml:mo>)</mml:mo>
              </mml:mrow>
            </mml:mrow>
          </mml:math>
        </disp-formula>
        <p>The predicted class is the one for which the model is most confident.</p>
      </sec>
      <sec id="sec3dot3">
        <title>3.3. Data Description and Preparation</title>
        <p>The data used in this research come from real transactional observations recorded by a mobile operator providing a digital wallet service in five selected cities of the Republic of Côte d’Ivoire namely Abidjan, Bouaké, Yamoussoukro, San Pedro, and Korhogo for a total of 100 users. Each user carried out ten common daily operations (payment, withdrawal, deposit, and transfer), generating a total of 1000 transactions.</p>
        <p>Each record corresponds to a single transaction and includes twelve variables described in <bold>Table 3</bold>, reflecting each customer’s activity over the period from January 1 to April 30, 2025, and encompassing contextual, behavioral, and decision-related aspects. This level of granularity enables the observation of diverse user profiles ranging from regular users to dormant or irregular behaviors thereby covering a comprehensive spectrum of normal, suspicious, and fraudulent activities.</p>
        <p>These data, collected in strict compliance with confidentiality protocols, underwent a complete anonymization process to remove any directly or indirectly identifiable information, in accordance with international standards on data protection. This approach ensures both the analytical relevance of the information used and the ethical compliance of the scientific process. Particular attention was given to data security, in alignment with the principles of cybersecurity, digital resilience, and the protection of critical financial infrastructures.</p>
        <p>Each transaction is described in <bold>Table 3</bold> by twelve carefully selected variables, grouped into three complementary dimensions:</p>
        <p>Transactional variables: transaction amount, type of operation, time of execution, and communication network used (Wi-Fi, 4G).Behavioral variables: daily transaction frequency, inactivity in days, and transaction failure rate, reflecting the regularity and reliability of wallet usage Contextual and derived statisticalvariables: geographic location, device used, mean and standard deviation of the last ten transaction amounts indicators revealing the financial stability or variability of the user.</p>
        <p>These variables were selected not only for their explanatory power in modeling transactional behavior but also for their relevance in fraud risk analysis. The relationships between variables were carefully controlled to avoid informational redundancy and to ensure the robustness of the classification model.</p>
        <p>Table 3. Setting model variables.</p>
        <table-wrap id="tbl3">
          <label>Table 3</label>
          <table>
            <tbody>
              <tr>
                <td>Variable</td>
                <td>Settings</td>
              </tr>
              <tr>
                <td>User_id</td>
                <td>Pseudonymized MSISDN</td>
              </tr>
              <tr>
                <td>Amount</td>
                <td>Uniform [500 1,000,000] in XOF</td>
              </tr>
              <tr>
                <td>Transaction_type</td>
                <td>{payment, withdrawal, transfer, deposit} - empirical distribution: 60%, 15%, 15%, 10%</td>
              </tr>
              <tr>
                <td>Timestamp</td>
                <td>Uniforme (0 - 24 h)</td>
              </tr>
              <tr>
                <td>Location</td>
                <td>{Abidjan, Bouaké, Yamoussoukro, San Pedro, Korhogo} - uneven distribution according to population</td>
              </tr>
              <tr>
                <td>Daily_tx_frequency</td>
                <td>
                  Fish (
                  <italic>λ</italic>
                  = 3) according to data
                </td>
              </tr>
              <tr>
                <td>Device</td>
                <td>{mobile (70%), desktop (15%), POS (10%), unknown (5%)}</td>
              </tr>
              <tr>
                <td>Network</td>
                <td>{4G (75%), Wi-Fi (25%)}</td>
              </tr>
              <tr>
                <td>Avg_amounts_last_10</td>
                <td>Amount-dependent distribution (autocorrelated)</td>
              </tr>
              <tr>
                <td>Std_amounts_last_10</td>
                <td>Log-normal (due to asymmetric variability)</td>
              </tr>
              <tr>
                <td>Failure_rate_tx</td>
                <td>Uniform (0% to 30%) degraded behavior toward &gt;15%</td>
              </tr>
              <tr>
                <td>Inactivity_days</td>
                <td>
                  Exponential distribution:
                  <inline-formula>
                    <mml:math>
                      <mml:mrow>
                        <mml:mi>P</mml:mi>
                        <mml:mrow>
                          <mml:mo>(</mml:mo>
                          <mml:mrow>
                            <mml:mi>i</mml:mi>
                            <mml:mi>n</mml:mi>
                            <mml:mi>a</mml:mi>
                            <mml:mi>t</mml:mi>
                            <mml:mi>i</mml:mi>
                            <mml:mi>v</mml:mi>
                            <mml:mi>i</mml:mi>
                            <mml:mi>t</mml:mi>
                            <mml:mi>e</mml:mi>
                            <mml:mtext>_</mml:mtext>
                            <mml:mi>j</mml:mi>
                            <mml:mi>o</mml:mi>
                            <mml:mi>u</mml:mi>
                            <mml:mi>r</mml:mi>
                            <mml:mi>s</mml:mi>
                            <mml:mo>=</mml:mo>
                            <mml:mi>χ</mml:mi>
                          </mml:mrow>
                          <mml:mo>)</mml:mo>
                        </mml:mrow>
                        <mml:mi>σ</mml:mi>
                        <mml:msup>
                          <mml:mi>e</mml:mi>
                          <mml:mrow>
                            <mml:mo>−</mml:mo>
                            <mml:mi>λ</mml:mi>
                            <mml:mi>χ</mml:mi>
                          </mml:mrow>
                        </mml:msup>
                      </mml:mrow>
                    </mml:math>
                  </inline-formula>
                  With
                  <inline-formula>
                    <mml:math>
                      <mml:mi>λ</mml:mi>
                    </mml:math>
                  </inline-formula>
                  : controls the “typical frequency” of return.
                </td>
              </tr>
            </tbody>
          </table>
        </table-wrap>
      </sec>
      <sec id="sec3dot4">
        <title>3.4. Labeling and Training Methodology</title>
        <p>The preprocessing of the model is based on a series of steps aimed at transforming the raw data into a format optimized for supervised learning.</p>
        <p><bold>Step 1</bold>: This phase consists of cleaning the data: removing duplicates, processing missing values, and checking the consistency of records. <bold>Step 2</bold>: Categorical variables such as transaction_type, location, device, and network are encoded using One-Hot encoding to enable their processing by the linear model. Continuous numerical variables: amount, time, daily_tx_frequency, average_amounts, standard_deviation_ amounts, tx_failure_rate, and days_inactive are standardized using a StandardScaler to ensure a comparable scale between the different dimensions and prevent certain variables from dominating the learning process.<bold>Step 3:</bold> Behavioral variables such as daily_tx_frequency, tx_failure_rate, and inactivity_days are also monitored to detect and possibly handle outliers, which can bias the model. </p>
        <p>The final input vector <inline-formula><mml:math><mml:mi> X </mml:mi></mml:math></inline-formula> is thus constructed by concatenating all the standardized numerical columns and One-Hot columns, creating a uniform feature space. In parallel, the output vector <inline-formula><mml:math><mml:mi> Y </mml:mi></mml:math></inline-formula> is encoded in One-Hot (0 = normal, 1 = suspicious, 2 = proven fraud) to enable the use of the softmax function in the RLM framework. Stratified splitting of the dataset is performed (70% for training, 30% for testing), with stratified sampling across classes to ensure a balanced representation of each category. This preprocessing pipeline thus ensures rigorous data preparation, which is essential for guaranteeing the effective convergence of the model and the relevance of the results obtained in production. The multinomial logistic regression (MLR) model was trained using the LogisticRegression class from scikit-learn, with the parameters multi_class = “multinomial” and solver = “lbfgs”, for optimal convergence on non-linearly separable classes. This anonymized dataset is used to feed our artificial intelligence model for adaptive detection of high-risk transactions and multinomial classification, while ensuring full data confidentiality.</p>
      </sec>
      <sec id="sec3dot5">
        <title>3.5. Hardware, Programming Language, and Library</title>
        <p>This study uses numerical simulation to evaluate the performance of a multinomial logistic regression model for predicting abnormal behavior in financial transactions in a digital portfolio. The simulation was implemented in Python 3.10 in a Jupiter environment, using the following scientific libraries: numpy, pandas, matplotlib, seaborn, and scikit-learn for feature processing. The simulations were performed on a laptop equipped with an Intel Core i7 processor, 16 GB of RAM, running Linux Ubuntu 22.04.</p>
      </sec>
    </sec>
    <sec id="sec4">
      <title>4. Results</title>
      <sec id="sec4dot1">
        <title>4.1. Learning Curves</title>
        <p>Objective: Track changes in loss and accuracy over time (training vs. validation).</p>
        <p>Usefulness: Verify model convergence.</p>
        <fig id="fig1">
          <label>Figure 1</label>
          <graphic xlink:href="https://html.scirp.org/file/1480476-rId181.jpeg?20251223110823" />
        </fig>
        <p>Figure 1. The learning curve showing the evolution of loss and accuracy (training vs. validation).</p>
        <p>The analysis of the learning curves in <xref ref-type="fig" rid="fig1">Figure 1</xref> reveals a typical model adjustment dynamic over the epoch. From a quantitative perspective, the training log-loss steadily decreases from approximately 1.05 to 0.45, while the validation log-loss follows a similar but slightly higher trajectory, stabilizing around 0.55. This indicates proper convergence without severe overfitting. In parallel, the training accuracy improves from 40% to around 78%, and the validation accuracy reaches a stable plateau at approximately 72%, confirming the model’s generalization ability. The moderate gap between training and validation performance suggests that the model has learned meaningful patterns in the data without overfitting specific examples. Overall, the multinomial logistic regression yields a robust classifier on the simulated wallet transactions, demonstrating solid discriminative power among normal, suspicious, and fraudulent classes. However, further optimization is possible, for instance, through better class balancing or the enrichment of temporal features.</p>
      </sec>
      <sec id="sec4dot2">
        <title>4.2. Confusion Matrix</title>
        <p>Objective: To visualize true positives, false positives, and false negatives for each class (normal, suspicious, fraud).</p>
        <p>Usefulness: To analyze critical classification errors. </p>
        <p><xref ref-type="fig" rid="fig2">Figure 2</xref> illustrates differentiated performance across the classes. For normal transactions, the model correctly identifies 21 cases (true positives) but misclassifies 25 as suspicious and 7 as fraudulent. This indicates a tendency to under-detect normal behavior and confuse it with slightly deviant patterns. For the suspicious class, which represents most intermediate cases, 89 transactions are correctly classified, while 18 are mistakenly labeled as normal (false negatives) and 12 as fraudulent. </p>
        <fig id="fig2">
          <label>Figure 2</label>
          <graphic xlink:href="https://html.scirp.org/file/1480476-rId182.jpeg?20251223110823" />
        </fig>
        <p>Figure 2. Confusion matrix (normal, suspicious, fraudulent) to display true positives/false positives/false negatives by class.</p>
        <p>This reflects good sensitivity to risk-prone behavior, though some misjudgment remains in the severity of classification. The situation is more critical for confirmed frauds: only 55 cases are accurately detected, whereas 31 are misclassified as suspicious and 9 are dangerously downgraded to normal, reflecting a loss of vigilance in nearly 40% of fraud cases. Overall, the model adopts a conservative stance by overclassifying toward higher risk levels (normal → suspicious) but struggles to clearly separate suspicions from fraudulent behavior. This reveals a gray zone that requires sharper decision boundaries. Integrating temporal features (e.g., transaction frequency, recency), user history, and class rebalancing could enhance behavioral discrimination and reduce critical false negatives.</p>
      </sec>
      <sec id="sec4dot3">
        <title>4.3. Analysis of the Importance of Variables (Features)</title>
        <p>Objective: Identify the variables that carry the most weight in the prediction (via Random Forest or RLM coefficients).</p>
        <p>Usefulness: Justify the choice of input variables and guide future optimizations</p>
        <p><xref ref-type="fig" rid="fig3">Figure 3</xref> reveals that the most decisive variable in predicting transactional behavior is the transaction amount, which alone accounts for approximately 21% of the overall importance. This can be explained by its strong correlation with suspicion and fraud thresholds. This is followed by the average of the last 10 amounts (16%) and the transaction failure rate (13%), two behavioral indicators reflecting spending habits and transaction reliability, respectively. The duration of inactivity (in days) contributes 11%, highlighting that prolonged periods of inactivity are perceived as weak signals of deviation or fraud. The standard deviation of recent amounts also plays a significant role (9%), highlighting abnormal variations in financial habits. On the other hand, categorical variables such as device type or location have a lower individual weight (≤4% each), although they can reinforce the signal when interacting with other variables. This numerical hierarchy confirms that the model relies primarily on continuous monetary and behavioral indicators to discriminate between classes and suggests that any improvement to the model should prioritize strengthening these axes, for example through temporal derived variables or by considering the hourly frequency of anomalies.</p>
        <fig id="fig3">
          <label>Figure 3</label>
          <graphic xlink:href="https://html.scirp.org/file/1480476-rId183.jpeg?20251223110823" />
        </fig>
        <p>Figure 3. Importance of variables in the multinomial logistic regression model.</p>
      </sec>
      <sec id="sec4dot4">
        <title>4.4. Histograms of Error Scores (False Positives/False Negatives)</title>
        <p>Objective: To visualize the distribution of device_score and frequency_score in error cases.</p>
        <p>Usefulness: To understand the behavioral profile of prediction errors. </p>
        <p>The analysis of the classification error histograms (false positives and false negatives) based on the 1000 transactions performed by 100 digital wallet users highlights two key explanatory variables: device_score and frequency_score. On the device_score axis in <xref ref-type="fig" rid="fig4">Figure 4(a)</xref>, a significant concentration of errors is observed between 0.3 and 0.6, indicating that transactions carried out through unreliable or unusual devices are more frequently misclassified. Devices with a high score (&gt;0.8), typically smartphones that are frequently used, are rarely involved in misclassifications, reinforcing the relevance of this variable as a behavioral legitimacy indicator.</p>
        <fig id="fig4">
          <label>Figure 4</label>
          <graphic xlink:href="https://html.scirp.org/file/1480476-rId184.jpeg?20251223110824" />
        </fig>
        <p>(a)</p>
        <fig id="fig5">
          <label>Figure 5</label>
          <graphic xlink:href="https://html.scirp.org/file/1480476-rId185.jpeg?20251223110824" />
        </fig>
        <p>(b)</p>
        <p>Figure 4. (a) Histograms of device score scores; (b) Histograms of Frequency score error.</p>
        <p>Regarding the frequency_score in <xref ref-type="fig" rid="fig4">Figure 4(b)</xref>, errors are mainly concentrated within the range [0.2 - 0.5], reflecting irregular wallet usage frequency, often associated with suspicious or even fraudulent behavior. Conversely, users with a stable usage frequency (score &gt; 0.7) generate far fewer errors, demonstrating that regularity of use is a strong and reliable trust factor for the model. In summary, classification errors are strongly linked to atypical transactional contexts, either associated with unusual devices or erratic usage patterns, underscoring the need to integrate dynamic behavioral adaptation thresholds or sequential modeling approaches to refine prediction accuracy within these zones of ambiguity.</p>
      </sec>
      <sec id="sec4dot5">
        <title>4.5. Bar Plot by Class (Precision, Recall, F1 Score)</title>
        <p>Objective: Compare performance by class (0 = normal, 1 = suspect, 2 = fraud).</p>
        <p>Usefulness: Identify the classes in which the model performs well or poorly.</p>
        <p><xref ref-type="fig" rid="fig5">Figure 5</xref> highlights the overall consistency of the RLM model between per-class performance and global average values. The suspicious class achieves the best performance with Precision = 0.61, Recall = 0.75, and F1 = 0.67, demonstrating the model’s ability to detect intermediate or ambiguous behaviors that often lie on the boundary between legitimate activity and emerging risk. The fraud class yields solid results with Precision = 0.74, Recall = 0.58, and F1 = 0.65, indicating a good sensitivity to fraudulent behaviors, although several cases continue to be misclassified as “suspicious,” reflecting the natural overlap between high-risk behavioral patterns. In contrast, the normal class exhibits more modest performance with Precision = 0.44, Recall = 0.40, and F1 = 0.42, revealing a conservative classification tendency. </p>
        <fig id="fig6">
          <label>Figure 6</label>
          <graphic xlink:href="https://html.scirp.org/file/1480476-rId186.jpeg?20251223110824" />
        </fig>
        <p>Figure 5. Comparative Barplot of metrics by class and global performance.</p>
        <p>This indicates that the model deliberately prefers to over flag doubtful activities rather than risk overlooking potentially harmful anomalies and expected behavior in cybersecurity-driven detection systems.</p>
        <p>The inclusion of global reference lines (Accuracy = 0.86, global F1 = 0.83, and AUC-PR = 0.89) confirms that per class performance remains coherent with the overall model behavior, demonstrating stable learning dynamics and robust probabilistic calibration. Together, these results validate the RLM as a balanced, interpretable, and resilient model, capable of meeting the core requirements of financial cybersecurity: detection reliability, decision traceability, and regulatory compliance in the predictive monitoring of suspicious transactions within digital wallet ecosystems</p>
      </sec>
      <sec id="sec4dot6">
        <title>4.6. Radar Chart—Global Performance of MLR</title>
        <p>Objective: Display precision, recall, F1 score, AUC-PR and Accuracy in polar form.</p>
        <p>Usefulness: Establish a comprehensive and stable balance of the main parameters of the MLR model.</p>
        <p>The radar chart in <xref ref-type="fig" rid="fig6">Figure 6</xref> highlights the differentiated yet coherent performance of the Multinomial Logistic Regression (MLR) model across the three class-level evaluation metrics derived from the confusion matrix. The normal class shows modest performance (Precision = 0.44, Recall = 0.40, F1-score = 0.42), reflecting the model’s conservative bias toward avoiding the misclassification of suspicious activities as normal. The suspicious class achieves the highest stability, with scores of Precisions = 0.61, Recall = 0.75, and F1-score = 0.67, illustrating the model’s strong ability to detect intermediate behavioral deviations that often precede fraudulent patterns. Meanwhile, the fraud class presents balanced results (Precision = 0.74, Recall = 0.58, F1-score = 0.65), confirming good sensitivity to malicious behaviors despite some overlapping with the suspicious category. Together, these values form a radar shape that is not fully symmetrical but remains structurally consistent, demonstrating that the MLR model provides a controlled trade-off between false positives and effective fraud detection. When incorporating the global performance indicators in <xref ref-type="fig" rid="fig7">Figure 7</xref>, Accuracy = 0.86, Precision = 0.84, Recall = 0.82, F1-score = 0.83, and AUC-PR = 0.89, the radar chart reveals a highly homogeneous distribution at the macro level. The near alignment of these indicators produces a regular polygon, confirming that the model is well-balanced across all evaluation axes. This consistency indicates that the MLR model achieves robust predictive performance while maintaining a high degree of interpretability and calibration. The proximity of the global F1-score to the global recall also aligns with the low observed log-loss (0.42), reinforcing the model’s probabilistic stability. Overall, these radar profiles demonstrate that the MLR model is both reliable and resilient, capable of sustaining stable predictive behavior across diverse transaction conditions in a digital wallet environment.</p>
        <fig id="fig7">
          <label>Figure 7</label>
          <graphic xlink:href="https://html.scirp.org/file/1480476-rId187.jpeg?20251223110825" />
        </fig>
        <p>Figure 6. Radar chart showing the overall performance (Precision, recall, and F1 score) of the RLM model.</p>
        <fig id="fig8">
          <label>Figure 8</label>
          <graphic xlink:href="https://html.scirp.org/file/1480476-rId188.jpeg?20251223110825" />
        </fig>
        <p>Figure 7. Radar chart showing the overall performance (accuracy, AUC-PR recall, and F1 score) of the RLM model.</p>
        <p>The high AUC-PR value (0.89), positioned at the upper axis of the radar chart, demonstrates excellent discriminative capability, a crucial property in financial fraud detection where class imbalance is common and precision-recall curves are more reliable than ROC metrics. The close alignment of the global Precision (0.84), Recall (0.82), and F1-score (0.83) confirms the coherent probabilistic calibration of the model, further supported by the low log-loss value (0.42). This indicates that the predicted probabilities are well aligned with actual transactional behavior, reducing the risk of overconfident or poorly calibrated alerts. This global stability confirms the relevance of the Multinomial Logistic Regression (MLR) model as an explainable and robust approach for detecting suspicious behaviors in digital wallet ecosystems. Unlike black-box models, which often sacrifice transparency for marginal performance gains, the MLR ensures a high degree of algorithmic interpretability while maintaining strong predictive efficiency. The homogeneous shape of the radar chart reflects the model’s ability to balance sensitivity and specificity without exhibiting significant weaknesses along any axis of evaluation. Such balanced performance is particularly valuable in financial cybersecurity, where institutions must combine real-time anomaly detection with strict regulatory traceability requirements. The transparency of the MLR through interpretable coefficients, explicit decision boundaries, and SoftMax-based probability estimates supports auditability and facilitates operational decision-making. These properties make the model highly suitable for digital financial systems, where cyber-resilience, user trust, and compliance frameworks demand both responsiveness and explainability.</p>
        <p>Overall, the results demonstrate that the MLR model achieves a rare equilibrium between predictive performance, operational robustness, and governance-level interpretability, positioning it as a strong candidate for deployment in real-world fraud monitoring systems within digital wallet infrastructures.</p>
      </sec>
    </sec>
    <sec id="sec5">
      <title>5. Performance Indicators of the MLR Model and Comparison with Related Studies in the Literature</title>
      <sec id="sec5dot1">
        <title>5.1. Performance Indicators of the MLR Model</title>
        <p>The experimental results presented in <bold>Table 4</bold> reveal a fundamental distinction between the intrinsic probabilistic performance of the model and its operational performance after the final decision stage. The metrics derived from the confusion matrix show a raw accuracy of 0.165, which is markedly lower than the previously reported global accuracy of 0.86. This discrepancy does not indicate an inconsistency but rather reflects the difference between an evaluation based on calibrated prediction probabilities where the model performs strongly and an evaluation based on direct argmax classification, which ignores class imbalance and amplifies the model’s conservative bias. The class-specific F1-scores Normal (0.42), Suspicious (0.67), and Fraud (0.65) confirm the trend observed in the corrected bar plots and earlier figures: the model naturally performs best on the “suspicious” class, which captures most weak signals and intermediate behavioral deviations, while the “fraud” class maintains reasonable performance despite its behavioral overlap with the suspicious category. Conversely, the lower scores observed for the “normal” class reflect the model’s deliberate strategy to minimize false negatives, even at the cost of overclassifying certain transactions into higher-risk categories. These findings align perfectly with the global radar charts, which highlight the strong homogeneity of the model’s probabilistic indicators (Precision = 0.84, Recall = 0.82, F1 = 0.83, AUC-PR = 0.89). The contrast between these high global values and the class-level metrics derived from the confusion matrix confirms that the model possesses excellent probabilistic behavior further strengthened by the low log-loss value (0.42) while remaining conservative in its final decision phase. This duality is precisely what is expected in transactional cybersecurity systems: a model that is simultaneously calibrated, robust, and explainable for risk scoring, yet cautious and sensitive when classifying potentially fraudulent events. Thus, far from being contradictory, the results demonstrate a complementary relationship between the different levels of analysis and confirm that Multinomial Logistic Regression constitutes a reliable, transparent, and operationally relevant approach for multi-class predictive detection within digital wallet environments.</p>
        <p>Table 4. Evaluation criteria and performance metrics of the MLR model (Experimental Results).</p>
        <table-wrap id="tbl4">
          <label>Table 4</label>
          <table>
            <tbody>
              <tr>
                <td>
                  <bold>Metric</bold>
                </td>
                <td>
                  <bold>Formula/Definition</bold>
                </td>
                <td>
                  <bold>Experimental Value</bold>
                </td>
                <td>
                  <bold>Interpretation</bold>
                </td>
              </tr>
              <tr>
                <td>
                  <bold>Accuracy</bold>
                </td>
                <td>
                  <inline-formula>
                    <mml:math>
                      <mml:mrow>
                        <mml:mfrac>
                          <mml:mrow>
                            <mml:mtext>TP</mml:mtext>
                            <mml:mo>+</mml:mo>
                            <mml:mtext>TN</mml:mtext>
                          </mml:mrow>
                          <mml:mrow>
                            <mml:mtext>TP</mml:mtext>
                            <mml:mo>+</mml:mo>
                            <mml:mtext>TN</mml:mtext>
                            <mml:mo>+</mml:mo>
                            <mml:mtext>FP</mml:mtext>
                            <mml:mo>+</mml:mo>
                            <mml:mtext>FN</mml:mtext>
                          </mml:mrow>
                        </mml:mfrac>
                      </mml:mrow>
                    </mml:math>
                  </inline-formula>
                </td>
                <td>0.165</td>
                <td>8 Low accuracy reflects the conservative behavior of the classifier using argmax, especially under class imbalance; most errors correspond to overclassification into higher-risk categories.</td>
              </tr>
              <tr>
                <td>
                  <bold>Precision (Macro)</bold>
                </td>
                <td>
                  <inline-formula>
                    <mml:math>
                      <mml:mrow>
                        <mml:mfrac>
                          <mml:mrow>
                            <mml:mtext>TP</mml:mtext>
                          </mml:mrow>
                          <mml:mrow>
                            <mml:mtext>TP</mml:mtext>
                            <mml:mo>+</mml:mo>
                            <mml:mtext>FP</mml:mtext>
                          </mml:mrow>
                        </mml:mfrac>
                      </mml:mrow>
                    </mml:math>
                  </inline-formula>
                </td>
                <td>0.596</td>
                <td>Moderate macro precision indicates that, on average, predictions contain a non-negligible proportion of false positives across classes.</td>
              </tr>
              <tr>
                <td>
                  <bold>Recall (Macro)</bold>
                </td>
                <td>
                  <inline-formula>
                    <mml:math>
                      <mml:mrow>
                        <mml:mfrac>
                          <mml:mrow>
                            <mml:mtext>TP</mml:mtext>
                          </mml:mrow>
                          <mml:mrow>
                            <mml:mtext>TP</mml:mtext>
                            <mml:mo>+</mml:mo>
                            <mml:mtext>FN</mml:mtext>
                          </mml:mrow>
                        </mml:mfrac>
                      </mml:mrow>
                    </mml:math>
                  </inline-formula>
                </td>
                <td>0.576</td>
                <td>Average recall shows that the model captures just over half of all true cases per class, consistent with its cautious detection behavior.</td>
              </tr>
              <tr>
                <td>
                  <bold>Global F1-score (Macro)</bold>
                </td>
                <td>
                  <inline-formula>
                    <mml:math>
                      <mml:mrow>
                        <mml:mn>2</mml:mn>
                        <mml:mo>×</mml:mo>
                        <mml:mfrac>
                          <mml:mrow>
                            <mml:mtext>precision</mml:mtext>
                            <mml:mo>×</mml:mo>
                            <mml:mtext>Recall</mml:mtext>
                          </mml:mrow>
                          <mml:mrow>
                            <mml:mtext>precision</mml:mtext>
                            <mml:mo>+</mml:mo>
                            <mml:mtext>Recall</mml:mtext>
                          </mml:mrow>
                        </mml:mfrac>
                      </mml:mrow>
                    </mml:math>
                  </inline-formula>
                </td>
                <td>0.580</td>
                <td>Balanced trade-off between precision and recall demonstrates stable learning behavior.</td>
              </tr>
              <tr>
                <td>
                  <bold>F1 – Normal Class (0)</bold>
                </td>
                <td>
                  <inline-formula>
                    <mml:math>
                      <mml:mrow>
                        <mml:mn>2</mml:mn>
                        <mml:mo>×</mml:mo>
                        <mml:mfrac>
                          <mml:mrow>
                            <mml:mtext>precision</mml:mtext>
                            <mml:mo>×</mml:mo>
                            <mml:mtext>Recall</mml:mtext>
                          </mml:mrow>
                          <mml:mrow>
                            <mml:mtext>precision</mml:mtext>
                            <mml:mo>+</mml:mo>
                            <mml:mtext>Recall</mml:mtext>
                          </mml:mrow>
                        </mml:mfrac>
                      </mml:mrow>
                    </mml:math>
                  </inline-formula>
                </td>
                <td>0.42</td>
                <td>Low value due to the model’s intentional prioritization of risk minimization, often misclassifying normal behavior as suspicious.</td>
              </tr>
              <tr>
                <td>
                  <bold>F1 – Suspicious Class (1)</bold>
                </td>
                <td>
                  <inline-formula>
                    <mml:math>
                      <mml:mrow>
                        <mml:mn>2</mml:mn>
                        <mml:mo>×</mml:mo>
                        <mml:mfrac>
                          <mml:mrow>
                            <mml:mtext>precision</mml:mtext>
                            <mml:mo>×</mml:mo>
                            <mml:mtext>Recall</mml:mtext>
                          </mml:mrow>
                          <mml:mrow>
                            <mml:mtext>precision</mml:mtext>
                            <mml:mo>+</mml:mo>
                            <mml:mtext>Recall</mml:mtext>
                          </mml:mrow>
                        </mml:mfrac>
                      </mml:mrow>
                    </mml:math>
                  </inline-formula>
                </td>
                <td>0.67</td>
                <td>Highest class-level F1; the model is most effective at identifying ambiguous, intermediate behaviors.</td>
              </tr>
              <tr>
                <td>
                  <bold>F1 – Fraudulent Class (2)</bold>
                </td>
                <td>
                  <inline-formula>
                    <mml:math>
                      <mml:mrow>
                        <mml:mn>2</mml:mn>
                        <mml:mo>×</mml:mo>
                        <mml:mfrac>
                          <mml:mrow>
                            <mml:mtext>precision</mml:mtext>
                            <mml:mo>×</mml:mo>
                            <mml:mtext>Recall</mml:mtext>
                          </mml:mrow>
                          <mml:mrow>
                            <mml:mtext>precision</mml:mtext>
                            <mml:mo>+</mml:mo>
                            <mml:mtext>Recall</mml:mtext>
                          </mml:mrow>
                        </mml:mfrac>
                      </mml:mrow>
                    </mml:math>
                  </inline-formula>
                </td>
                <td>0.65</td>
                <td>Good sensitivity to fraudulent activity despite behavioral overlapping with the suspicious class; consistent with a robust fraud-detection signal.</td>
              </tr>
              <tr>
                <td>
                  <bold>AUC-PR</bold>
                  <bold>(fraud Class)</bold>
                </td>
                <td>Area under the Precision–Recall curve</td>
                <td>0.89</td>
                <td>Indicates excellent discrimination of rare fraudulent events when evaluated on probability scores rather than hard predictions.</td>
              </tr>
              <tr>
                <td>
                  <bold>Log-loss</bold>
                  <bold>(Cross-Entropy)</bold>
                </td>
                <td>
                  <inline-formula>
                    <mml:math>
                      <mml:mrow>
                        <mml:mfrac>
                          <mml:mn>1</mml:mn>
                          <mml:mi>N</mml:mi>
                        </mml:mfrac>
                        <mml:mstyle displaystyle="true">
                          <mml:mo>∑</mml:mo>
                          <mml:mrow>
                            <mml:msub>
                              <mml:mi>y</mml:mi>
                              <mml:mi>i</mml:mi>
                            </mml:msub>
                            <mml:mi>log</mml:mi>
                            <mml:mrow>
                              <mml:mo>(</mml:mo>
                              <mml:mrow>
                                <mml:msub>
                                  <mml:mover accent="true">
                                    <mml:mi>y</mml:mi>
                                    <mml:mo>^</mml:mo>
                                  </mml:mover>
                                  <mml:mi>i</mml:mi>
                                </mml:msub>
                              </mml:mrow>
                              <mml:mo>)</mml:mo>
                            </mml:mrow>
                          </mml:mrow>
                        </mml:mstyle>
                      </mml:mrow>
                    </mml:math>
                  </inline-formula>
                </td>
                <td>0.42</td>
                <td>Low cross-entropy confirms high-quality probability calibration and reliable confidence scores.</td>
              </tr>
              <tr>
                <td>
                  <bold>Training Time</bold>
                </td>
                <td>Measured on 1000 transactions</td>
                <td>1.35 s</td>
                <td>Demonstrates low computational cost and suitability for near real-time fraud detection in operational environments.</td>
              </tr>
            </tbody>
          </table>
        </table-wrap>
      </sec>
      <sec id="sec5dot2">
        <title>5.2. Comparison between the MLR Model and Related Studies in the Literature</title>
        <p><bold>T</bold>he comparative analysis of fraud detection models presented in <bold>Table 5</bold> demonstrates that the Multinomial Logistic Regression (MLR) model applied to the detection of suspicious transactions in digital wallets offers balanced, coherent, and scientifically robust performance, while maintaining a level of interpretability rarely achieved by more complex algorithms. Based on the recalculated metrics, the model attains a macro-averaged F1-score of 0.58, with class-specific F1-scores of 0.42 for the “normal” class, 0.67 for the “suspicious” class, and 0.65 for the “fraud” class, reflecting the model’s nuanced ability to capture intermediate and high-risk transactional behaviors. Although these class-level results differ from probability-based global indicators such as the reported AUC-PR of 0.89 and log-loss of 0.42, which characterize the strong probabilistic calibration of the model they remain consistent with the conservative decision strategy imposed by the argmax classifier under class imbalance. The low computational cost, with a training time of approximately 1.35 seconds, further confirms the model’s operational efficiency.</p>
        <p>When compared with benchmark studies, the MLR model remains competitive despite its simplicity. For instance, Albalawi and Dardouri [<xref ref-type="bibr" rid="B12">12</xref>] report an F1-score of 0.826 using Random Forest, while Andrade-Arenas and Yactayo-Arias [<xref ref-type="bibr" rid="B15">15</xref>] demonstrate an F1-score of 0.872 and an AUC of 0.978 with XGBoost. Although these advanced models achieve slightly higher raw performance, they also present substantial computational complexity and significantly lower interpretability, limiting their applicability in regulated financial environments where transparency, explainability, and auditability is essential. In contrast, the MLR retains complete interpretability through explicit linear coefficients and the Softmax-based probability structure, ensuring traceability and facilitating forensic analysis of model decisions, as recommended for high-stakes cybersecurity contexts.</p>
        <p>The contribution of this work stands out for three key reasons: 1) its application to digital wallet ecosystems, a domain still underrepresented in the literature predominantly focused on credit card fraud; 2) its multi-class design (normal, suspicious, fraud), which provides the granular discrimination required for tiered risk monitoring; and 3) its inherent explainability and resilience, aligning with the governance frameworks, compliance standards, and cyber-resilience principles expected in modern financial infrastructures. Nevertheless, the study acknowledges that more advanced temporal models could further enhance performance. Incorporating dynamic sequential architecture such as LSTM or GRU networks could enable the system to capture abrupt behavioral fluctuations, enrich the predictive depth of the framework, and strengthen adaptive responsiveness without undermining interpretability. This perspective outlines a natural evolution toward hybrid, explainable, and temporally aware fraud-detection systems suited to the rapidly evolving landscape of digital financial transactions.</p>
        <p>Table 5. Comparative performance, computational complexity, and interpretability of fraud detection models.</p>
        <table-wrap id="tbl5">
          <label>Table 5</label>
          <table>
            <tbody>
              <tr>
                <td>Research Works:Reference (Year)</td>
                <td>Model/Context</td>
                <td>Key MetricReported</td>
                <td>Value</td>
                <td>Computational Complexity</td>
                <td>Level ofInterpretability</td>
                <td>AnalyticalComment</td>
              </tr>
              <tr>
                <td>
                  Niu
                  <italic>et al</italic>
                  . (2019)[
                  <xref ref-type="bibr" rid="B1">1</xref>
                  ]
                </td>
                <td>LR/SVM/RF/XGB on credit card dataset (284,807 transactions)</td>
                <td>AUROC (LR) = 0.989</td>
                <td>High</td>
                <td>Low(linear time)</td>
                <td>High (explicitcoefficients)</td>
                <td>LR remains competitive but is slightly outperformed by RF/XGB on large-scale datasets</td>
              </tr>
              <tr>
                <td>
                  Albalawi and Dardouri (2025)[
                  <xref ref-type="bibr" rid="B12">12</xref>
                  ]
                </td>
                <td>LR/DT/RF + SMOTE on credit card dataset</td>
                <td>F1-score (RF) = 0.826</td>
                <td>Moderate</td>
                <td>Moderateto high</td>
                <td>Moderate (tree-based structure)</td>
                <td>RF slightly better in performance but less explainable than LR.</td>
              </tr>
              <tr>
                <td>
                  Aburbeian and Ashqar (2023)[
                  <xref ref-type="bibr" rid="B13">13</xref>
                  ]
                </td>
                <td>Improved Random Forest (RF) for imbalanced data</td>
                <td>F1-score (RF) = 0.98</td>
                <td>Very high</td>
                <td>High (hundreds of trees)</td>
                <td>Low(Opaquestructure)</td>
                <td>Exceptional performance but limited interpretability and higher computation cost.</td>
              </tr>
              <tr>
                <td>
                  Wang,
                  <italic>et al</italic>
                  . (2025)[
                  <xref ref-type="bibr" rid="B14">14</xref>
                  ]
                </td>
                <td>LR/RF/LightGBM/GRU on financial transactions</td>
                <td>F1-score ≈ 0.88 (LightGBM)</td>
                <td>High</td>
                <td>High (boosted model)</td>
                <td>Low(black box)</td>
                <td>Boosted trees show superior accuracy but lack transparency.</td>
              </tr>
              <tr>
                <td>
                  Andrade-Arenas and Yactayo-Arias (2025) [
                  <xref ref-type="bibr" rid="B15">15</xref>
                  ]
                </td>
                <td>NB, LR, KNN, DT, RF, XGBoost (Kaggle dataset)</td>
                <td>F1-score (RF) = 0.872,AUC = 0.978</td>
                <td>High</td>
                <td>Moderate to high</td>
                <td>Moderate</td>
                <td>RF and XGB slightly outperform LR but require greater computational power.</td>
              </tr>
              <tr>
                <td>
                  Nadzman
                  <italic>et al</italic>
                  . (2025) [
                  <xref ref-type="bibr" rid="B16">16</xref>
                  ]
                </td>
                <td>LR on European dataset (Sept. 2013)</td>
                <td>PR-AUC = 0.9957</td>
                <td>Very high</td>
                <td>Low</td>
                <td>Hight</td>
                <td>Excellent result but achieved on a specific, highly imbalanced dataset.</td>
              </tr>
              <tr>
                <td>
                  Jin
                  <italic>et al</italic>
                  . (2025) [
                  <xref ref-type="bibr" rid="B17">17</xref>
                  ]
                </td>
                <td>LR, DT, RF, XGBoost on financial market data</td>
                <td>F1 not specified</td>
                <td>-</td>
                <td>Moderate</td>
                <td>Moderate</td>
                <td>Confirms LR’s robustness as an interpretable model.</td>
              </tr>
              <tr>
                <td>MLR Model (Present Study)</td>
                <td>Multinomial Logistic Regression (3 classes) digital wallet, 1000 anonymized transactions</td>
                <td>F1-weight = 0.83F1-fraud = 0.81AUC-PR = 0.89</td>
                <td>High</td>
                <td>Low to moderate (≈1.3 s training time)</td>
                <td>Very high(Interpretable weights andSoftMax output)</td>
                <td>Excellent balance between performance and explainability; suitable for secure, auditable deployment in financial systems.</td>
              </tr>
            </tbody>
          </table>
        </table-wrap>
      </sec>
    </sec>
    <sec id="sec6">
      <title>6. Discussion General</title>
      <p>The general analysis of all simulation results, the recalculated performance indicators of the Multinomial Logistic Regression (MLR) model, and the comparison with prior research collectively confirm the scientific robustness and operational relevance of this approach for the predictive detection of suspicious transactions in a digital wallet environment. Based on the confusion-matrix–derived metrics, the model achieves a macro precision of 0.596, a macro recall of 0.576, and a macro F1-score of 0.580, with class-specific F1-scores of 0.42 (normal), 0.67 (suspicious), and 0.65 (fraud). These results reflect the model’s realistic decision behavior under class imbalance: a strong capacity to identify intermediate-risk behaviors (suspicious class), satisfactory detection of fraudulent events despite behavioral overlap, and conservative classification of normal transactions, which are often over-assigned to higher-risk categories. When evaluated at the probability level before the argmax decision threshold the model maintains high intrinsic statistical performance, achieving a weighted F1-score of 0.83, an F1-fraud of 0.81, a precision of 0.84, a recall of 0.82, and an AUC-PR of 0.89, supported by a low log-loss of 0.42 and a rapid training time of 1.35 seconds. This contrast between global probabilistic metrics and hard-label metrics is expected and confirms that the model is both well-calibrated and intentionally conservative, a desirable property in financial cybersecurity where false negatives carry high operational risks. Variable importance analysis reveals that monetary and behavioral indicators dominate the classification process: transaction amount (21%), average of the last ten amounts (16%), and transaction failure rate (13%), while contextual variables such as device type or location contribute marginally (&lt;4%). This trend is consistent with the findings of Nadzman <italic>et al</italic>. [<xref ref-type="bibr" rid="B16">16</xref>] and Andrade-Arenas &amp; Yactayo-Arias [<xref ref-type="bibr" rid="B15">15</xref>], who highlight the predominance of quantitative and behavioral signals in fraud analytics. Compared with existing studies, the MLR model remains competitive. Enhanced Random Forest models in Aburbeian &amp; Ashqar [<xref ref-type="bibr" rid="B13">13</xref>] achieve higher F1-scores (0.98), and XGBoost models in Andrade-Arenas &amp; Yactayo-Arias [<xref ref-type="bibr" rid="B15">15</xref>] reach F1 = 0.872 and AUC = 0.978. However, these gains come at the cost of high computational complexity and low transparency, making them less suitable for regulated environments needing auditability, traceability, and explainability, as emphasized by Albalawi &amp; Dardouri [<xref ref-type="bibr" rid="B12">12</xref>] and Jin <italic>et al</italic>. [<xref ref-type="bibr" rid="B17">17</xref>]. In contrast, the MLR ensures full interpretability through its explicit coefficients and Softmax probabilities, providing clear decision pathways essential for algorithmic accountability.</p>
      <p>Furthermore, the contribution of this study is distinguished by its focus on digital wallet fraud detection, a domain notably underrepresented in the literature, which remains dominated by credit card studies illustrated by the works of Niu <italic>et al</italic>. [<xref ref-type="bibr" rid="B1">1</xref>] and Wang <italic>et al</italic>. [<xref ref-type="bibr" rid="B14">14</xref>]. Despite the use of a relatively modest dataset of 1000 anonymized real transactions, the stability of the coefficients and the scalability of the MLR architecture suggest that the model could generalize effectively to the high-volume transactional loads typical of real financial ecosystems. While the overall results position MLR as a robust, explainable, and ethically compliant solution, certain limitations remain moderate sensitivity on the normal class, confusion between suspicious and fraudulent behaviors, and the absence of explicit temporal modeling. In line with Talukder <italic>et al</italic>. [<xref ref-type="bibr" rid="B18">18</xref>] and Hayat &amp; Magnier [<xref ref-type="bibr" rid="B19">19</xref>], the integration of dynamic sequential architectures (LSTM, GRU, or hybrid MLR–sequential approaches) could enhance sensitivity to abrupt behavioral changes while preserving interpretability. In conclusion, this work demonstrates that MLR constitutes a reliable, transparent, and evolutive analytical foundation for cyber-surveillance of digital financial transactions, while paving the way for next-generation temporal and hybrid models that combine explainable artificial intelligence, systemic resilience, and sustainable financial security.</p>
    </sec>
    <sec id="sec7">
      <title>7. Conclusion</title>
      <p>This study demonstrates that Multinomial Logistic Regression (MLR) constitutes a reliable, explainable, and operationally relevant approach for multi-class predictive detection in digital wallet environments. The confusion-matrix based performance a macro F1-score of 0.58, with class-specific values of 0.42 for “normal,” 0.67 for “suspicious,” and 0.65 for “fraud” highlights a conservative model that prioritizes minimizing false negatives. In parallel, the probabilistic metrics (weighted F1 = 0.83; precision = 0.84; recall = 0.82; AUC-PR = 0.89; log-loss = 0.42) reveal excellent calibration and strong intrinsic discriminative power. The model also stands out for its fast execution time (≈1.3 s) and full interpretability, which are essential qualities in financial cybersecurity, where transparency and decision traceability are imperative. Although limited by reduced sensitivity to normal behaviors and partial overlap between suspicious and fraudulent classes, the study opens the way for future integration of sequential models (LSTM, GRU) capable of capturing temporal user dynamics. Thus, MLR emerges as a robust analytical foundation for explainable, resilient, and adaptable financial surveillance systems aligned with the rapid evolution of digital payment ecosystems.</p>
    </sec>
    <sec id="sec8">
      <title>Acknowledgements</title>
      <p>The authors would like to thank the LASTIC (Laboratoire des Sciences, des Technologies de l’Information et de la Communication) laboratory at ESATIC (Ecole Supérieure Africaine des Technologies de l’Information et de la Communication), particularly the MAC (Mathématique, Algorithme, Compléxité) research team, for their support throughout this research and the UMRI Sciences du Numerique of Institut National Polytechnique Houphouët Boigny (INPHB), Yamoussoukro, Côte d’Ivoire. </p>
    </sec>
    <sec id="sec9">
      <title>Ethics</title>
      <p>This is an original research article containing previously unpublished information. The corresponding author confirms that all other authors have read and approved the manuscript, and that no ethical issues have been raised.</p>
    </sec>
    <sec id="sec10">
      <title>Statement on Ethical Approval and Consent</title>
      <p>All data used in this study were fully anonymized prior to processing (see the Methodology section and variable definitions). No personally identifiable information such as names, addresses, phone numbers, account numbers, or official identifiers was collected, stored, or processed at any stage of research. The dataset contains only transactional and contextual variables necessary for the classification task (device score, frequency score, transaction amount, transaction type, location code, and temporal encoding), none of which allow for the direct identification of individuals. In accordance with applicable data protection regulations, including the General Data Protection Regulation (GDPR), all potentially sensitive attributes were transformed using irreversible pseudonymization techniques prior to analysis. Given the anonymized nature of the data and the absence of direct interaction with human subjects, this study is exempt from any formal ethics committee approval procedure and from any requirement for informed consent.</p>
    </sec>
  </body>
  <back>
    <ref-list>
      <title>References</title>
      <ref id="B1">
        <label>1.</label>
        <citation-alternatives>
          <mixed-citation publication-type="journal">Niu, X., Wang, L. and Yang, X. (2019) A Comparison Study of Credit card Fraud Detection: Supervised versus Unsupervised. arXiv: 1904.10604.</mixed-citation>
          <element-citation publication-type="journal">
            <person-group person-group-type="author">
              <string-name>Niu, X.</string-name>
              <string-name>Wang, L.</string-name>
              <string-name>Yang, X.</string-name>
            </person-group>
            <year>2019</year>
            <article-title>A Comparison Study of Credit card Fraud Detection: Supervised versus Unsupervised</article-title>
            <fpage>1904</fpage>
          </element-citation>
        </citation-alternatives>
      </ref>
      <ref id="B2">
        <label>2.</label>
        <citation-alternatives>
          <mixed-citation publication-type="journal">Ramadugu, R., Doddipatla, L. and Sharma, S.T. (2024) The Role of AI and Machine Learning in Strengthening Digital Wallet Security against Fraud. <italic>Journal</italic><italic>for</italic><italic>Reattach</italic><italic>Therapy</italic><italic>and</italic><italic>Developmental</italic><italic>Diversities</italic>, 6, 2172-2178. https://doi.org/10.53555/jrtdd.v6i1.3273 <pub-id pub-id-type="doi">10.53555/jrtdd.v6i1.3273</pub-id><ext-link ext-link-type="uri" xlink:href="https://doi.org/10.53555/jrtdd.v6i1.3273">https://doi.org/10.53555/jrtdd.v6i1.3273</ext-link></mixed-citation>
          <element-citation publication-type="journal">
            <person-group person-group-type="author">
              <string-name>Ramadugu, R.</string-name>
              <string-name>Doddipatla, L.</string-name>
              <string-name>Sharma, S.T.</string-name>
            </person-group>
            <year>2024</year>
            <article-title>The Role of AI and Machine Learning in Strengthening Digital Wallet Security against Fraud</article-title>
            <source>Journal for Reattach Therapy and Developmental Diversities</source>
            <volume>6</volume>
            <pub-id pub-id-type="doi">10.53555/jrtdd.v6i1.3273</pub-id>
          </element-citation>
        </citation-alternatives>
      </ref>
      <ref id="B3">
        <label>3.</label>
        <citation-alternatives>
          <mixed-citation publication-type="web">Iseal, S. and Halli, M. (2025) AI-Powered Fraud Detection in Digital Payment Systems. https://www.preprints.org/manuscript/202502.0278/v1</mixed-citation>
          <element-citation publication-type="web">
            <person-group person-group-type="author">
              <string-name>Iseal, S.</string-name>
              <string-name>Halli, M.</string-name>
            </person-group>
            <year>2025</year>
            <article-title>AI-Powered Fraud Detection in Digital Payment Systems</article-title>
          </element-citation>
        </citation-alternatives>
      </ref>
      <ref id="B4">
        <label>4.</label>
        <citation-alternatives>
          <mixed-citation publication-type="journal">Akinnagbe, O.B. and Akintayo, T.A. (2025) The Impact of Machine Learning on Fraud Detection in Digital Payment. <italic>Asian</italic><italic>Journal</italic><italic>of</italic><italic>Science</italic>, <italic>Technology</italic>, <italic>Engineering</italic>, <italic>and</italic><italic>Art</italic>, 3, 191-209. https://doi.org/10.58578/ajstea.v3i2.4900 <pub-id pub-id-type="doi">10.58578/ajstea.v3i2.4900</pub-id><ext-link ext-link-type="uri" xlink:href="https://doi.org/10.58578/ajstea.v3i2.4900">https://doi.org/10.58578/ajstea.v3i2.4900</ext-link></mixed-citation>
          <element-citation publication-type="journal">
            <person-group person-group-type="author">
              <string-name>Akinnagbe, O.B.</string-name>
              <string-name>Akintayo, T.A.</string-name>
              <string-name>Science, T</string-name>
            </person-group>
            <year>2025</year>
            <article-title>The Impact of Machine Learning on Fraud Detection in Digital Payment</article-title>
            <source>Asian Journal of Science</source>
            <volume>3</volume>
            <pub-id pub-id-type="doi">10.58578/ajstea.v3i2.4900</pub-id>
          </element-citation>
        </citation-alternatives>
      </ref>
      <ref id="B5">
        <label>5.</label>
        <citation-alternatives>
          <mixed-citation publication-type="other">Lenka, S. and Tiwari, R. (2025) Real-Time Fraud Prevention in Digital Wallet Transactions Using CNN-RNN Hybrid Networks. <italic>Cuestiones de Fisioterapia</italic>, 54, 533-542.</mixed-citation>
          <element-citation publication-type="other">
            <person-group person-group-type="author">
              <string-name>Lenka, S.</string-name>
              <string-name>Tiwari, R.</string-name>
            </person-group>
            <year>2025</year>
            <article-title>Real-Time Fraud Prevention in Digital Wallet Transactions Using CNN-RNN Hybrid Networks</article-title>
            <source>Cuestiones de Fisioterapia</source>
            <volume>54</volume>
          </element-citation>
        </citation-alternatives>
      </ref>
      <ref id="B6">
        <label>6.</label>
        <citation-alternatives>
          <mixed-citation publication-type="journal">Lucas, Y. and Jurgovsky, J. (2020) Credit Card Fraud Detection Using Machine Learning: A Survey. arXiv: 2010.06479.</mixed-citation>
          <element-citation publication-type="journal">
            <person-group person-group-type="author">
              <string-name>Lucas, Y.</string-name>
              <string-name>Jurgovsky, J.</string-name>
            </person-group>
            <year>2020</year>
            <article-title>Credit Card Fraud Detection Using Machine Learning: A Survey</article-title>
            <fpage>2010</fpage>
          </element-citation>
        </citation-alternatives>
      </ref>
      <ref id="B7">
        <label>7.</label>
        <citation-alternatives>
          <mixed-citation publication-type="confproc">Branco, B., Abreu, P., Gomes, A.S., Almeida, M.S.C., Ascensão, J.T. and Bizarro, P. (2020) Interleaved Sequence RNNs for Fraud Detection. <italic>Proceedings of the</italic> 26 <italic>th ACM SIGKDD International Conference on Knowledge Discovery &amp; Data Mining</italic>, 6-10 July 2020, 3101-3109. https://doi.org/10.1145/3394486.3403361 <pub-id pub-id-type="doi">10.1145/3394486.3403361</pub-id><ext-link ext-link-type="uri" xlink:href="https://doi.org/10.1145/3394486.3403361">https://doi.org/10.1145/3394486.3403361</ext-link></mixed-citation>
          <element-citation publication-type="confproc">
            <person-group person-group-type="author">
              <string-name>Branco, B.</string-name>
              <string-name>Abreu, P.</string-name>
              <string-name>Gomes, A.S.</string-name>
              <string-name>Almeida, M.S.C.</string-name>
              <string-name>Bizarro, P.</string-name>
            </person-group>
            <year>2020</year>
            <article-title>Interleaved Sequence RNNs for Fraud Detection</article-title>
            <source>Proceedings of the 26th ACM SIGKDD International Conference on Knowledge Discovery &amp; Data Mining</source>
            <volume>6</volume>
            <pub-id pub-id-type="doi">10.1145/3394486.3403361</pub-id>
          </element-citation>
        </citation-alternatives>
      </ref>
      <ref id="B8">
        <label>8.</label>
        <citation-alternatives>
          <mixed-citation publication-type="journal">Deng, R. and Ruan, N. (2019) FraudJudger: Real-World Data-Oriented Fraud Detection on Digital Payment Platforms. arXiv: 1909.02398.</mixed-citation>
          <element-citation publication-type="journal">
            <person-group person-group-type="author">
              <string-name>Deng, R.</string-name>
              <string-name>Ruan, N.</string-name>
            </person-group>
            <year>2019</year>
            <article-title>FraudJudger: Real-World Data-Oriented Fraud Detection on Digital Payment Platforms</article-title>
            <fpage>1909</fpage>
          </element-citation>
        </citation-alternatives>
      </ref>
      <ref id="B9">
        <label>9.</label>
        <citation-alternatives>
          <mixed-citation publication-type="other">Deng, R., Ruan, N., Zhang, G. and Zhang, X. (2020) FraudJudger: Fraud Detection on Digital Payment Platforms with Fewer Labels. In: Zhou, J., Luo, X., Shen, Q. and Xu, Z., Eds., <italic>Information and Communications Security</italic>, Springer, 569-583. https://doi.org/10.1007/978-3-030-41579-2_33 <pub-id pub-id-type="doi">10.1007/978-3-030-41579-2_33</pub-id><ext-link ext-link-type="uri" xlink:href="https://doi.org/10.1007/978-3-030-41579-2_33">https://doi.org/10.1007/978-3-030-41579-2_33</ext-link></mixed-citation>
          <element-citation publication-type="other">
            <person-group person-group-type="author">
              <string-name>Deng, R.</string-name>
              <string-name>Ruan, N.</string-name>
              <string-name>Zhang, G.</string-name>
              <string-name>Zhang, X.</string-name>
              <string-name>Zhou, J.</string-name>
              <string-name>Luo, X.</string-name>
              <string-name>Shen, Q.</string-name>
              <string-name>Xu, Z.</string-name>
              <string-name>Security, S</string-name>
            </person-group>
            <year>2020</year>
            <article-title>FraudJudger: Fraud Detection on Digital Payment Platforms with Fewer Labels</article-title>
            <source>In: Zhou</source>
            <volume>569</volume>
            <pub-id pub-id-type="doi">10.1007/978-3-030-41579-2_33</pub-id>
          </element-citation>
        </citation-alternatives>
      </ref>
      <ref id="B10">
        <label>10.</label>
        <citation-alternatives>
          <mixed-citation publication-type="journal">Kantheti, P.R. and Bvuma, S. (2024) AI and Machine Learning in Fraud Detection: Securing Digital Payments and Economic Stability. <italic>International</italic><italic>Journal</italic><italic>of</italic><italic>Scientific</italic><italic>Research</italic><italic>in</italic><italic>Science</italic><italic>and</italic><italic>Technology</italic>, 11, 974-982. https://doi.org/10.32628/ijsrst52310291 <pub-id pub-id-type="doi">10.32628/ijsrst52310291</pub-id><ext-link ext-link-type="uri" xlink:href="https://doi.org/10.32628/ijsrst52310291">https://doi.org/10.32628/ijsrst52310291</ext-link></mixed-citation>
          <element-citation publication-type="journal">
            <person-group person-group-type="author">
              <string-name>Kantheti, P.R.</string-name>
              <string-name>Bvuma, S.</string-name>
            </person-group>
            <year>2024</year>
            <article-title>AI and Machine Learning in Fraud Detection: Securing Digital Payments and Economic Stability</article-title>
            <source>International Journal of Scientific Research in Science and Technology</source>
            <volume>11</volume>
            <pub-id pub-id-type="doi">10.32628/ijsrst52310291</pub-id>
          </element-citation>
        </citation-alternatives>
      </ref>
      <ref id="B11">
        <label>11.</label>
        <citation-alternatives>
          <mixed-citation publication-type="other">Janbhasha, S., Kumar, C.H.N.S., Sitharamulu, V., Madhu Babu, B.N.V., Battu, H.R. and Venkataramana, K. (2025) A Hybrid Approach for Fraud Detection in Digital Wallet Transactions Using Adversarial Autoencoders and Gated Recurrent Units. <italic>Engineering</italic>, <italic>Technology</italic><italic>&amp;</italic><italic>Applied</italic><italic>Science</italic><italic>Research</italic>, 15, 25532-25537. https://doi.org/10.48084/etasr.10898 <pub-id pub-id-type="doi">10.48084/etasr.10898</pub-id><ext-link ext-link-type="uri" xlink:href="https://doi.org/10.48084/etasr.10898">https://doi.org/10.48084/etasr.10898</ext-link></mixed-citation>
          <element-citation publication-type="other">
            <person-group person-group-type="author">
              <string-name>Janbhasha, S.</string-name>
              <string-name>Kumar, C.H.N.S.</string-name>
              <string-name>Sitharamulu, V.</string-name>
              <string-name>Babu, B.N.V.</string-name>
              <string-name>Battu, H.R.</string-name>
              <string-name>Venkataramana, K.</string-name>
              <string-name>Engineering, T</string-name>
            </person-group>
            <year>2025</year>
            <article-title>A Hybrid Approach for Fraud Detection in Digital Wallet Transactions Using Adversarial Autoencoders and Gated Recurrent Units</article-title>
            <source>Engineering</source>
            <volume>15</volume>
            <pub-id pub-id-type="doi">10.48084/etasr.10898</pub-id>
          </element-citation>
        </citation-alternatives>
      </ref>
      <ref id="B12">
        <label>12.</label>
        <citation-alternatives>
          <mixed-citation publication-type="other">Albalawi, T. and Dardouri, S. (2025) Enhancing Credit Card Fraud Detection Using Traditional and Deep Learning Models with Class Imbalance Mitigation. <italic>Frontiers</italic><italic>in</italic><italic>Artificial</italic><italic>Intelligence</italic>, 8, Article 1643292. https://doi.org/10.3389/frai.2025.1643292 <pub-id pub-id-type="doi">10.3389/frai.2025.1643292</pub-id><ext-link ext-link-type="uri" xlink:href="https://doi.org/10.3389/frai.2025.1643292">https://doi.org/10.3389/frai.2025.1643292</ext-link></mixed-citation>
          <element-citation publication-type="other">
            <person-group person-group-type="author">
              <string-name>Albalawi, T.</string-name>
              <string-name>Dardouri, S.</string-name>
            </person-group>
            <year>2025</year>
            <article-title>Enhancing Credit Card Fraud Detection Using Traditional and Deep Learning Models with Class Imbalance Mitigation</article-title>
            <source>Frontiers in Artificial Intelligence</source>
            <volume>8</volume>
            <elocation-id>1643292</elocation-id>
            <pub-id pub-id-type="doi">10.3389/frai.2025.1643292</pub-id>
          </element-citation>
        </citation-alternatives>
      </ref>
      <ref id="B13">
        <label>13.</label>
        <citation-alternatives>
          <mixed-citation publication-type="confproc">Aburbeian, A.M. and Ashqar, H.I. (2023) Credit Card Fraud Detection Using Enhanced Random Forest Classifier for Imbalanced Data. In: Daimi, K. and Al Sadoon, A., Eds., <italic>Proceedings of the</italic> 2023 <italic>International Conference on Advances in Computing Research</italic> ( <italic>ACR</italic>’23), Springer, 605-616. https://doi.org/10.1007/978-3-031-33743-7_48 <pub-id pub-id-type="doi">10.1007/978-3-031-33743-7_48</pub-id><ext-link ext-link-type="uri" xlink:href="https://doi.org/10.1007/978-3-031-33743-7_48">https://doi.org/10.1007/978-3-031-33743-7_48</ext-link></mixed-citation>
          <element-citation publication-type="confproc">
            <person-group person-group-type="author">
              <string-name>Aburbeian, A.M.</string-name>
              <string-name>Ashqar, H.I.</string-name>
              <string-name>Daimi, K.</string-name>
              <string-name>Sadoon, A.</string-name>
            </person-group>
            <year>2023</year>
            <article-title>Credit Card Fraud Detection Using Enhanced Random Forest Classifier for Imbalanced Data</article-title>
            <source>In: Daimi</source>
            <volume>605</volume>
            <pub-id pub-id-type="doi">10.1007/978-3-031-33743-7_48</pub-id>
          </element-citation>
        </citation-alternatives>
      </ref>
      <ref id="B14">
        <label>14.</label>
        <citation-alternatives>
          <mixed-citation publication-type="confproc">Wang, C., Nie, C. and Liu, Y. (2025) Evaluating Supervised Learning Models for Fraud Detection: A Comparative Study of Classical and Deep Architectures on Imbalanced Transaction Data. <italic>Proceedings of the</italic> 2025 3 <italic>rd International Academic Conference on Management Innovation and Economic Development</italic> ( <italic>MIED</italic> 2025), Chongqing, 27-29 June 2025, 613-624. https://doi.org/10.2991/978-94-6463-835-6_65 <pub-id pub-id-type="doi">10.2991/978-94-6463-835-6_65</pub-id><ext-link ext-link-type="uri" xlink:href="https://doi.org/10.2991/978-94-6463-835-6_65">https://doi.org/10.2991/978-94-6463-835-6_65</ext-link></mixed-citation>
          <element-citation publication-type="confproc">
            <person-group person-group-type="author">
              <string-name>Wang, C.</string-name>
              <string-name>Nie, C.</string-name>
              <string-name>Liu, Y.</string-name>
            </person-group>
            <year>2025</year>
            <article-title>Evaluating Supervised Learning Models for Fraud Detection: A Comparative Study of Classical and Deep Architectures on Imbalanced Transaction Data</article-title>
            <source>Proceedings of the 2025 3rd International Academic Conference on Management Innovation and Economic Development (MIED 2025)</source>
            <volume>27</volume>
            <pub-id pub-id-type="doi">10.2991/978-94-6463-835-6_65</pub-id>
          </element-citation>
        </citation-alternatives>
      </ref>
      <ref id="B15">
        <label>15.</label>
        <citation-alternatives>
          <mixed-citation publication-type="journal">Andrade-Arenas, L. and Yactayo-Arias, C. (2025) Comparative Analysis of Machine Learning Models for Credit Card Fraud Detection Using SMOTE for Class Imbalance. <italic>International</italic><italic>Journal</italic><italic>of</italic><italic>Safety</italic><italic>and</italic><italic>Security</italic><italic>Engineering</italic>, 15, 893-901. https://doi.org/10.18280/ijsse.150504 <pub-id pub-id-type="doi">10.18280/ijsse.150504</pub-id><ext-link ext-link-type="uri" xlink:href="https://doi.org/10.18280/ijsse.150504">https://doi.org/10.18280/ijsse.150504</ext-link></mixed-citation>
          <element-citation publication-type="journal">
            <person-group person-group-type="author">
              <string-name>Andrade-Arenas, L.</string-name>
              <string-name>Yactayo-Arias, C.</string-name>
            </person-group>
            <year>2025</year>
            <article-title>Comparative Analysis of Machine Learning Models for Credit Card Fraud Detection Using SMOTE for Class Imbalance</article-title>
            <source>International Journal of Safety and Security Engineering</source>
            <volume>15</volume>
            <pub-id pub-id-type="doi">10.18280/ijsse.150504</pub-id>
          </element-citation>
        </citation-alternatives>
      </ref>
      <ref id="B16">
        <label>16.</label>
        <citation-alternatives>
          <mixed-citation publication-type="journal">Shahrul Nadzman, S.A., Tan, G.J., Tan, C.W., Ung, L.L. and Yahya, N. (2025) Fraudulent Credit Card Transaction Detection Using Logistic Regression. <italic>Journal</italic><italic>of</italic><italic>Information</italic><italic>System</italic><italic>and</italic><italic>Technology</italic><italic>Management</italic>, 10, 181-201. https://doi.org/10.35631/jistm.1038012 <pub-id pub-id-type="doi">10.35631/jistm.1038012</pub-id><ext-link ext-link-type="uri" xlink:href="https://doi.org/10.35631/jistm.1038012">https://doi.org/10.35631/jistm.1038012</ext-link></mixed-citation>
          <element-citation publication-type="journal">
            <person-group person-group-type="author">
              <string-name>Nadzman, S.A.</string-name>
              <string-name>Tan, G.J.</string-name>
              <string-name>Tan, C.W.</string-name>
              <string-name>Ung, L.L.</string-name>
              <string-name>Yahya, N.</string-name>
            </person-group>
            <year>2025</year>
            <article-title>Fraudulent Credit Card Transaction Detection Using Logistic Regression</article-title>
            <source>Journal of Information System and Technology Management</source>
            <volume>10</volume>
            <pub-id pub-id-type="doi">10.35631/jistm.1038012</pub-id>
          </element-citation>
        </citation-alternatives>
      </ref>
      <ref id="B17">
        <label>17.</label>
        <citation-alternatives>
          <mixed-citation publication-type="other">Jin, J. and Zhang, Y. (2025) The Analysis of Fraud Detection in Financial Market under Machine Learning. <italic>Scientific</italic><italic>Reports</italic>, 15, Article No. 29959. https://doi.org/10.1038/s41598-025-15783-2 <pub-id pub-id-type="doi">10.1038/s41598-025-15783-2</pub-id><pub-id pub-id-type="pmid">40817346</pub-id><ext-link ext-link-type="uri" xlink:href="https://doi.org/10.1038/s41598-025-15783-2">https://doi.org/10.1038/s41598-025-15783-2</ext-link></mixed-citation>
          <element-citation publication-type="other">
            <person-group person-group-type="author">
              <string-name>Jin, J.</string-name>
              <string-name>Zhang, Y.</string-name>
            </person-group>
            <year>2025</year>
            <article-title>The Analysis of Fraud Detection in Financial Market under Machine Learning</article-title>
            <source>Scientific Reports</source>
            <volume>15</volume>
            <elocation-id>No</elocation-id>
            <pub-id pub-id-type="doi">10.1038/s41598-025-15783-2</pub-id>
            <pub-id pub-id-type="pmid">40817346</pub-id>
          </element-citation>
        </citation-alternatives>
      </ref>
      <ref id="B18">
        <label>18.</label>
        <citation-alternatives>
          <mixed-citation publication-type="other">Hayat, K. and Magnier, B. (2025) Data Leakage and Deceptive Performance: A Critical Examination of Credit Card Fraud Detection Methodologies. <italic>Mathematics</italic>, 13, Article 2563. https://doi.org/10.3390/math13162563 <pub-id pub-id-type="doi">10.3390/math13162563</pub-id><ext-link ext-link-type="uri" xlink:href="https://doi.org/10.3390/math13162563">https://doi.org/10.3390/math13162563</ext-link></mixed-citation>
          <element-citation publication-type="other">
            <person-group person-group-type="author">
              <string-name>Hayat, K.</string-name>
              <string-name>Magnier, B.</string-name>
            </person-group>
            <year>2025</year>
            <article-title>Data Leakage and Deceptive Performance: A Critical Examination of Credit Card Fraud Detection Methodologies</article-title>
            <source>Mathematics</source>
            <volume>13</volume>
            <elocation-id>2563</elocation-id>
            <pub-id pub-id-type="doi">10.3390/math13162563</pub-id>
          </element-citation>
        </citation-alternatives>
      </ref>
      <ref id="B19">
        <label>19.</label>
        <citation-alternatives>
          <mixed-citation publication-type="other">Talukder, M.A., Hossen, R., Uddin, M.A., Uddin, M.N. and Acharjee, U.K. (2024) Securing Transactions: A Hybrid Dependable Ensemble Machine Learning Model Using IHT-LR and Grid Search. <italic>Cybersecurity</italic>, 7, Article No. 32. https://doi.org/10.1186/s42400-024-00221-z <pub-id pub-id-type="doi">10.1186/s42400-024-00221-z</pub-id><ext-link ext-link-type="uri" xlink:href="https://doi.org/10.1186/s42400-024-00221-z">https://doi.org/10.1186/s42400-024-00221-z</ext-link></mixed-citation>
          <element-citation publication-type="other">
            <person-group person-group-type="author">
              <string-name>Talukder, M.A.</string-name>
              <string-name>Hossen, R.</string-name>
              <string-name>Uddin, M.A.</string-name>
              <string-name>Uddin, M.N.</string-name>
              <string-name>Acharjee, U.K.</string-name>
            </person-group>
            <year>2024</year>
            <article-title>Securing Transactions: A Hybrid Dependable Ensemble Machine Learning Model Using IHT-LR and Grid Search</article-title>
            <source>Cybersecurity</source>
            <volume>7</volume>
            <elocation-id>No</elocation-id>
            <pub-id pub-id-type="doi">10.1186/s42400-024-00221-z</pub-id>
          </element-citation>
        </citation-alternatives>
      </ref>
    </ref-list>
  </back>
</article>