<?xml version="1.0" encoding="UTF-8"?>
<!DOCTYPE article PUBLIC "-//NLM//DTD JATS (Z39.96) Journal Publishing DTD v1.1 20151215//EN" "http://jats.nlm.nih.gov/publishing/1.1/JATS-journalpublishing1.dtd">
<article xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:mml="http://www.w3.org/1998/Math/MathML" xml:lang="en" article-type="research-article" dtd-version="1.1">
<front>
<journal-meta>
<journal-id journal-id-type="pmc">IASC</journal-id>
<journal-id journal-id-type="nlm-ta">IASC</journal-id>
<journal-id journal-id-type="publisher-id">IASC</journal-id>
<journal-title-group>
<journal-title>Intelligent Automation &#x0026; Soft Computing</journal-title>
</journal-title-group>
<issn pub-type="epub">2326-005X</issn>
<issn pub-type="ppub">1079-8587</issn>
<publisher>
<publisher-name>Tech Science Press</publisher-name>
<publisher-loc>USA</publisher-loc>
</publisher>
</journal-meta>
<article-meta>
<article-id pub-id-type="publisher-id">37606</article-id>
<article-id pub-id-type="doi">10.32604/iasc.2023.037606</article-id>
<article-categories>
<subj-group subj-group-type="heading">
<subject>Article</subject>
</subj-group>
</article-categories>
<title-group>
<article-title>Intelligent Financial Fraud Detection Using Artificial Bee Colony Optimization Based Recurrent Neural Network</article-title>
<alt-title alt-title-type="left-running-head">Intelligent Financial Fraud Detection Using Artificial Bee Colony Optimization Based Recurrent Neural Network</alt-title>
<alt-title alt-title-type="right-running-head">Intelligent Financial Fraud Detection Using Artificial Bee Colony Optimization Based Recurrent Neural Network</alt-title>
</title-group>
<contrib-group>
<contrib id="author-1" contrib-type="author" corresp="yes">
<name name-style="western"><surname>Karthikeyan</surname><given-names>T.</given-names></name><xref ref-type="aff" rid="aff-1">1</xref><email>karthi4cse@gmail.com</email></contrib>
<contrib id="author-2" contrib-type="author">
<name name-style="western"><surname>Govindarajan</surname><given-names>M.</given-names></name><xref ref-type="aff" rid="aff-1">1</xref></contrib>
<contrib id="author-3" contrib-type="author">
<name name-style="western"><surname>Vijayakumar</surname><given-names>V.</given-names></name><xref ref-type="aff" rid="aff-2">2</xref></contrib>
<aff id="aff-1"><label>1</label><institution>Department of Computer Science and Engineering, Annamalai University</institution>, <addr-line>Annamalai Nagar, Tamil Nadu</addr-line>, <country>India</country></aff>
<aff id="aff-2"><label>2</label><institution>Department of Computer Science and Engineering, Sri Manakula Vinayagar Engineering College</institution>, <addr-line>Puducherry</addr-line>, <country>India</country></aff>
</contrib-group>
<author-notes>
<corresp id="cor1"><label>&#x002A;</label>Corresponding Author: T. Karthikeyan. Email: <email>karthi4cse@gmail.com</email></corresp>
</author-notes>
<pub-date date-type="collection" publication-format="electronic">
<year>2023</year></pub-date>
<pub-date date-type="pub" publication-format="electronic"><day>23</day>
<month>6</month>
<year>2023</year></pub-date>
<volume>37</volume>
<issue>2</issue>
<fpage>1483</fpage>
<lpage>1498</lpage>
<history>
<date date-type="received"><day>10</day><month>11</month><year>2022</year></date>
<date date-type="accepted"><day>10</day><month>3</month><year>2023</year></date>
</history>
<permissions>
<copyright-statement>&#x00A9; 2023 Karthikeyan et al.</copyright-statement>
<copyright-year>2023</copyright-year>
<copyright-holder>Karthikeyan et al.</copyright-holder>
<license xlink:href="https://creativecommons.org/licenses/by/4.0/">
<license-p>This work is licensed under a <ext-link ext-link-type="uri" xlink:type="simple" xlink:href="https://creativecommons.org/licenses/by/4.0/">Creative Commons Attribution 4.0 International License</ext-link>, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.</license-p>
</license>
</permissions>
<self-uri content-type="pdf" xlink:href="TSP_IASC_37606.pdf"></self-uri>
<abstract>
<p>Frauds don&#x2019;t follow any recurring patterns. They require the use of unsupervised learning since their behaviour is continually changing. Fraudsters have access to the most recent technology, which gives them the ability to defraud people through online transactions. Fraudsters make assumptions about consumers&#x2019; routine behaviour, and fraud develops swiftly. Unsupervised learning must be used by fraud detection systems to recognize online payments since some fraudsters start out using online channels before moving on to other techniques. Building a deep convolutional neural network model to identify anomalies from conventional competitive swarm optimization patterns with a focus on fraud situations that cannot be identified using historical data or supervised learning is the aim of this paper Artificial Bee Colony (ABC). Using real-time data and other datasets that are readily available, the ABC-Recurrent Neural Network (RNN) categorizes fraud behaviour and compares it to the current algorithms. When compared to the current approach, the findings demonstrate that the accuracy is high and the training error is minimal in ABC_RNN. In this paper, we measure the Accuracy, F1 score, Mean Square Error (MSE) and Mean Absolute Error (MAE). Our system achieves 97&#x0025; accuracy, 92&#x0025; precision rate and F1 score 97&#x0025;. Also we compare the simulation results with existing methods.</p>
</abstract>
<kwd-group kwd-group-type="author">
<kwd>Fraud activity</kwd>
<kwd>optimization</kwd>
<kwd>deep learning</kwd>
<kwd>classification</kwd>
<kwd>online transaction</kwd>
<kwd>neural network</kwd>
<kwd>credit card</kwd>
</kwd-group>
</article-meta>
</front>
<body>
<sec id="s1"><label>1</label><title>Introduction</title>
<p>The current state of traditional commerce is changing as a result of virtual businesses and the internet. E-commerce has greater value now that there is a worldwide market, more freedom, and more competition. E-commerce also makes it simpler and more accessible to innovate in the banking and payment sectors. E-commerce makes life simple for users, whether they are consumers or business owners. It is important in the more competitive and global economy [<xref ref-type="bibr" rid="ref-1">1</xref>]. People are moving away from conventional markets and toward the growing global market. It has a variety of restrictions in addition to providing customers with conveniences. For e-commerce or the digital market, online payment is essential [<xref ref-type="bibr" rid="ref-2">2</xref>].</p>
<p>The demand for the financial and banking sectors has grown as the size of the global market has expanded. With the use of smart devices like a laptop, mobile phone, desktop, personal digital assistance (PDA), etc., online payments enable you to conduct transactions from any location, at any time [<xref ref-type="bibr" rid="ref-3">3</xref>]. The elimination of traditional commerce&#x2019;s constraints is the primary driver of the expansion of electronic payments. The user may physically visit the bank to complete the transaction without having to wait in a big line. It offers a number of advantages, such as speedier transactions that may be completed in a matter of minutes without having to visit a bank or wait in line [<xref ref-type="bibr" rid="ref-4">4</xref>].</p>
<p>There are two methods of execution both online and offline electronic payments. Virtual payment may be recognized as online payment. Account holder name, Postal Index Number (PIN), card number, expiration date, and other sensitive details are needed for online payments [<xref ref-type="bibr" rid="ref-5">5</xref>]. Physical payment can be identified as offline payment. Cardholder presence and PIN are needed for offline payments. The first item needed for online payment fraud is a cardholder&#x2019;s credit card number. These frauds can be carried out in a variety of ways. Phishing, identity theft, skimming, using lost or stolen credit cards, card cloning, etc. are some common techniques for online credit card fraud [<xref ref-type="bibr" rid="ref-6">6</xref>].</p>
<p>In addition to these techniques, there are other systems that enable credit card fraud, such as malware or key loggers that may steal credit card information during an online transaction, or scanning equipment that can read your credit card information. Online payments make the procedure simpler even though they don&#x2019;t require a signature or your card&#x2019;s PIN information. Most websites steal card information and sell it to other parties; many fraudsters are active on the dark web, making them tough to catch [<xref ref-type="bibr" rid="ref-7">7</xref>,<xref ref-type="bibr" rid="ref-8">8</xref>]. There are several payment methods on the market that may be used for online purchases.</p>
<p>Depending on their needs and preferences, users use various payment methods. There are many different kinds of payment methods, including credit cards, debit cards, net banking, and electronic wallets. The danger associated with online payments is another reason why over 60&#x0025; of Internet users still favor the Cash on Delivery (COD), payment method [<xref ref-type="bibr" rid="ref-9">9</xref>,<xref ref-type="bibr" rid="ref-10">10</xref>]. CC is a popular, widely used, and promising electronic payment method for online purchasing. As banks are giving customers credits for transactions that last a certain amount of time. Customer can choose to pay using CC with ease. Today, more people are using online payment methods [<xref ref-type="bibr" rid="ref-11">11</xref>]. The credit card is used both online and offline [<xref ref-type="bibr" rid="ref-12">12</xref>].</p>
<p>The Reserve Bank is attempting to strengthen security in light of the increasing incidence of cybercrimes. In particular, a digital transaction is seeing significant increase nowadays. The goal of the central bank is to improve cyber risk security [<xref ref-type="bibr" rid="ref-13">13</xref>]. This is to assure constant security in addition to the evolving types of security extortion on the internet. Electronic Commerce (E-Commerce) is widely available in the Indian market. It now offers facilities to organizations of all ages. Where customers may conveniently purchase online. In comparison to offline or conventional shopping methods, it offers the current generation additional advantages. E-commerce provides a vast array of options, amenities, discounts, and promotions [<xref ref-type="bibr" rid="ref-14">14</xref>]. The remainder of the article is organized as follows, the existing approaches are given in Section 2, the proposed methodology is elucidated in Section 3, the results are discussed in Section 4, and the article is concluded in Section 5.</p>
</sec>
<sec id="s2"><label>2</label><title>Literature Review</title>
<p>India has tapped into the global market by attracting the interest of foreign businesses. Users&#x2019; interest in online buying has risen due to additional facilities and offers [<xref ref-type="bibr" rid="ref-15">15</xref>]. In the digital world, fraud detection is seen as a critical procedure, and this article focuses on the classification of fraud activities. For the competitive swarm-based deep convolutional neural network-based categorization of legitimate and fraudulent transactions, an efficient optimization-based technique is created.</p>
<p>Sequence and static learners can achieve the credit card fraud classification [<xref ref-type="bibr" rid="ref-16">16</xref>]. The generalised adversarial network, which is based on deep learning, is used to perform the classification procedure [<xref ref-type="bibr" rid="ref-17">17</xref>]. Support vector machines, recurrent neural networks and Auto Encoder based Restricted Boltzmann Machines (AERBM) are deep learning- and machine learning-based approaches, respectively, that are used to classify credit card fraud [<xref ref-type="bibr" rid="ref-18">18</xref>].</p>
<p>Using a hybrid data resampling approach and a neural network ensemble classifier, an efficient method for identifying credit card fraud [<xref ref-type="bibr" rid="ref-19">19</xref>]. The ensemble classifier in the adaptive boosting (AdaBoost) method is built utilising a long short-term memory (LSTM) neural network as the basis learner. In the meanwhile, hybrid resampling is carried out using the edited nearest neighbour method and the synthetic minority oversampling methodology. The utility of the proposed strategy is demonstrated using publicly accessible real-world credit card transaction datasets. Machine learning (ML)-based methods for detecting fraudulent credit card transactions have been described in recent study, however their detection scores still need to be improved because of the imbalance of classes in any given dataset. A few approaches have generated remarkable results on diverse datasets [<xref ref-type="bibr" rid="ref-20">20</xref>].</p>
<p>Internet-enabled worldwide online communication has boosted credit card theft, which costs customers and financial institutions billions of dollars every year in lost revenue. The thieves always come up with new schemes to carry out illicit activities. Therefore, it is essential to combat fraud using novel detection methods in order to reduce these losses. This study describes the staking ensemble strategy for combining many classifiers to identify credit card fraud. The categorization method in the current system has the issue of being incapable of processing fast computation. Error frequency might result in misclassification. The current approach is inefficient due to the computational cost and accuracy. Low data amount and low training quality are both problems. An efficient recurrent neural network based on Artificial Bee Colony optimization is created by taking these limitations into account.</p>
</sec>
<sec id="s3"><label>3</label><title>Existing System</title>
<p>The complexity of the network also rises as the number of levels develops. The depth of the network is often increased by adding more layers or recurrent connections, which enables the network to do &#x201C;deep learning,&#x201D; or several degrees of feature extraction and data representation. The higher layers of these networks, which are often constructed from nonlinear but basic units, provide a more abstract representation of the data and reduce unwelcome variability. Recurrent Neural Networks (RNNs), which are Artificial Neural Network (ANN) with recurrent connections and can represent sequential input for sequence recognition and prediction, are a subclass of ANNs. High-dimensional hidden states with non-linear dynamics make up RNNs. The network&#x2019;s memory is implemented in the hidden state structure, and each layer&#x2019;s current state is dependent on its previous state.</p>
<p>The RNNs can store, recall, and process historical complicated signals for extended periods of time thanks to their structure. RNNs are able to predict the sequence in the following time step and transfer an input sequence to an output sequence in the present time step. RNN training has greatly benefited from the development of back-propagation utilizing gradient descent (GD). The development of RNNs has advanced practically because of this straightforward training method.</p>
<p>Long Short Term Memory (LSTM) networks were introduced by and to estimate the sequence of transactions. LSTM improved accuracy in detecting offline transactions when cardholders are physically present at merchant sites when comparing to the basic classification of the Russian Federation. Manual feature merging routines are useful for both sequential and non-sequential training systems. After reviewing the true positives, it was found that both methodologies detect different types of fraud, indicates that both can be used together.</p>
<p>Scalable Real-time Fraud Finder which was a combination of Kafka, Spark and Cassandra and computer vision to eliminate imbalances, non-stationary attributes and feedback delays. Theirs experimental results on large databases of credit card transactions showed that their approach was accurate, efficient, and scalable on most transactions. Time series eigen sequences for transaction similarity, where the evaluated transactions sequence. A time simulation strategy in this context may be more robust to modest changes in actual purchasing behavior. LSTMs combined with SVMs were experimented with real-time credit card transactions. The research focused on making the right choices features, data pre-processing and evaluation metrics to provide a clear basis for comparison, where the latter will facilitate comparison of results obtained from oriented datasets. Large real-world transactional data sets have shown that their proposed technique significantly improves the accuracy of alerts, the key the concern of fraud investigations.</p>
<p>To detect behavioral patterns of fraud while learning labeled data and proposed a CNN for fraud detection where feature matrices represented large amounts of transactional data. CNN is used for estimation inactive patterns or patterns in the data and when tested on real bank transactions it was demonstrated that their technique outperformed many other existing approaches. The increase in activity in terms of online shopping makes it clear that users&#x2019; transaction behavior is often different and their behaviours must be able to determine the variability of transactions. Conventional models are not enough for such consumers and therefore this work focuses on detecting fraudulent transactions based on a user&#x2019;s behaviours.</p>
</sec>
<sec id="s4"><label>4</label><title>Proposed System</title>
<p>This section elaborates the process of feature selection and classification of credit card fraud activity. The significant features are reclaimed using artificial bee colony optimization approach that is utilized by the convolutional neural network for classification of credit card fraud. The Artificial Bee Colony (ABC) optimization algorithm is a new stochastic population based meta heuristics optimization algorithm. It is good in exploring the search space efficiently. It is based on the foraging behavior of the honey bees to explore the new food sources. The process of initialization is given as,
<disp-formula id="eqn-1"><label>(1)</label><mml:math id="mml-eqn-1" display="block"><mml:msub><mml:mi>a</mml:mi><mml:mrow><mml:mi>m</mml:mi><mml:mi>i</mml:mi></mml:mrow></mml:msub><mml:mo>=</mml:mo><mml:msub><mml:mi>l</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub><mml:mo>+</mml:mo><mml:mi>r</mml:mi><mml:mi>a</mml:mi><mml:mi>n</mml:mi><mml:mi>d</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mn>0</mml:mn><mml:mo>,</mml:mo><mml:mn>1</mml:mn><mml:mo>)</mml:mo></mml:mrow><mml:mo>&#x2217;</mml:mo><mml:mrow><mml:mo>(</mml:mo><mml:msub><mml:mi>u</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub><mml:mo>&#x2212;</mml:mo><mml:msub><mml:mi>l</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub><mml:mo>)</mml:mo></mml:mrow></mml:math></disp-formula>where the food sources are indicated by <inline-formula id="ieqn-1"><mml:math id="mml-ieqn-1"><mml:msub><mml:mi>a</mml:mi><mml:mrow><mml:mi>m</mml:mi><mml:mi>i</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula>, the upper and lower bound is indicated as <inline-formula id="ieqn-2"><mml:math id="mml-ieqn-2"><mml:msub><mml:mi>u</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub><mml:mtext>&#x00A0;</mml:mtext><mml:mi>a</mml:mi><mml:mi>n</mml:mi><mml:mi>d</mml:mi><mml:mtext>&#x00A0;</mml:mtext><mml:msub><mml:mi>l</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula>, respectively. The phases of ABC optimization algorithm are,</p>
<p>Employee bee phase: The employee bees search for the food sources and bring the nectar from the food sources to their hives and perform a wangle dance in the dance area allocated in hive. The nearby source of food is given as,
<disp-formula id="eqn-2"><label>(2)</label><mml:math id="mml-eqn-2" display="block"><mml:msub><mml:mi>b</mml:mi><mml:mrow><mml:mi>m</mml:mi><mml:mi>i</mml:mi></mml:mrow></mml:msub><mml:mo>=</mml:mo><mml:msub><mml:mi>a</mml:mi><mml:mrow><mml:mi>m</mml:mi><mml:mi>i</mml:mi></mml:mrow></mml:msub><mml:mo>+</mml:mo><mml:msub><mml:mi>&#x2205;</mml:mi><mml:mrow><mml:mi>m</mml:mi><mml:mi>i</mml:mi></mml:mrow></mml:msub><mml:mrow><mml:mo>(</mml:mo><mml:msub><mml:mi>a</mml:mi><mml:mrow><mml:mi>m</mml:mi><mml:mi>i</mml:mi></mml:mrow></mml:msub><mml:mo>&#x2212;</mml:mo><mml:msub><mml:mi>a</mml:mi><mml:mrow><mml:mi>k</mml:mi><mml:mi>i</mml:mi></mml:mrow></mml:msub><mml:mo>)</mml:mo></mml:mrow></mml:math></disp-formula>where randomly opted source of food is indicated as <inline-formula id="ieqn-3"><mml:math id="mml-ieqn-3"><mml:msub><mml:mi>a</mml:mi><mml:mrow><mml:mi>k</mml:mi><mml:mi>i</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula>, index is indicated as i, and the range of random number <inline-formula id="ieqn-4"><mml:math id="mml-ieqn-4"><mml:msub><mml:mi>&#x2205;</mml:mi><mml:mrow><mml:mi>m</mml:mi><mml:mi>i</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> is [&#x02212;a, a]. A new source of food <inline-formula id="ieqn-5"><mml:math id="mml-ieqn-5"><mml:msub><mml:mi>b</mml:mi><mml:mrow><mml:mi>m</mml:mi><mml:mi>i</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> and its fitness is estimated whereby selection of greedy technique is employed among <inline-formula id="ieqn-6"><mml:math id="mml-ieqn-6"><mml:msub><mml:mi>b</mml:mi><mml:mrow><mml:mi>m</mml:mi><mml:mi>i</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> and <inline-formula id="ieqn-7"><mml:math id="mml-ieqn-7"><mml:msub><mml:mi>a</mml:mi><mml:mrow><mml:mi>m</mml:mi><mml:mi>i</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula>.</p>
<p>Onlooker bee phase: The onlooker bees select the best employed bee having the highest nectar amount by the dance they perform. The bee which dances faster is the bee having large amount of nectar. The value of probability is expressed as,
<disp-formula id="eqn-3"><label>(3)</label><mml:math id="mml-eqn-3" display="block"><mml:msub><mml:mi>p</mml:mi><mml:mrow><mml:mi>m</mml:mi></mml:mrow></mml:msub><mml:mo>=</mml:mo><mml:mfrac><mml:mrow><mml:mi>f</mml:mi><mml:mi>i</mml:mi><mml:msub><mml:mi>t</mml:mi><mml:mrow><mml:mi>m</mml:mi></mml:mrow></mml:msub><mml:mrow><mml:mo>(</mml:mo><mml:mover><mml:msub><mml:mi>a</mml:mi><mml:mrow><mml:mi>m</mml:mi></mml:mrow></mml:msub><mml:mo stretchy="false">&#x2192;</mml:mo></mml:mover><mml:mo>)</mml:mo></mml:mrow></mml:mrow><mml:mrow><mml:msubsup><mml:mrow><mml:mo>&#x2211;</mml:mo></mml:mrow><mml:mrow><mml:mi>m</mml:mi><mml:mo>=</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mrow><mml:mi>S</mml:mi><mml:mi>N</mml:mi></mml:mrow></mml:msubsup><mml:mi>f</mml:mi><mml:mi>i</mml:mi><mml:msub><mml:mi>t</mml:mi><mml:mrow><mml:mi>m</mml:mi></mml:mrow></mml:msub><mml:mrow><mml:mo>(</mml:mo><mml:mover><mml:msub><mml:mi>a</mml:mi><mml:mrow><mml:mi>m</mml:mi></mml:mrow></mml:msub><mml:mo stretchy="false">&#x2192;</mml:mo></mml:mover><mml:mo>)</mml:mo></mml:mrow></mml:mrow></mml:mfrac></mml:math></disp-formula></p>
<p>Scout bee phase: The scout bee is the bee which explores new search space having the food source. Initial direction of food source is found by the scout bees which are followed by employed bees.</p>
<p>The ABC algorithm is good in exploration because of the scout bee phase with random search space of the problem domain but poor at exploitation and have slow convergence rate. In literature, standard ABC algorithm is improved by introducing randomization strategies to enhance the exploitation and exploration level. The ABC algorithm is suitable to find the optimal multicast tree satisfying the QoS constraint since they have the good exploration level. Since the ABC algorithm finds the global optimum in lesser time, it is highly applicable in large dynamic environments.
</p>
<fig id="fig-5">
<graphic mimetype="image" mime-subtype="tif" xlink:href="IASC_37606-fig-5.tif"/>
</fig>
<p>Finding the optimal multicast tree using ABC algorithm necessitates to find the path established by the bees with the minimum value for the objective function. Normally, the standard ABC algorithm helps in promoting good exploration level by handling the problems over entire search space. Mostly, ABC fits to any kind of optimization problem for exploring the feasible solution in a constraint time limit.</p>
<p>Deep learning and the creation of models that mimic the neuronal activity of the human brain both require RNNs. They differ from other kinds of artificial neural networks in that they employ feedback loops to digest a series of input that influences the final output, making them particularly effective in use cases where context is essential for predicting an outcome. As a result of these feedback loops, information can endure. This phenomenon is frequently referred to as memory.</p>
<p>The majority of RNN use cases are associated with language models, where predicting the next letter in a word or the next word in a phrase depends on the information that comes before it. An RNN trained with Shakespearean works effectively produces Shakespeare-like text in an intriguing experiment. Writing is a sort of computational creativity performed by RNNs. The AI&#x2019;s knowledge of syntax and semantics acquired from its training set allows it to simulate human inventiveness.</p>
<p>From the first input to the final output, RNNs may process data. RNNs employ feedback loops, such as backpropagation via time, during the computational process to loop information back into the network, unlike feed-forward neural networks. RNNs can analyze sequential and temporal data because of the connections made by this between inputs.</p>
<p>As shown in <xref ref-type="fig" rid="fig-1">Fig. 1a</xref> conventional RNN includes three layers: input, recurrent hidden, and output. N input units make up the input layer. A series of vectors during time t, such as &#x007B;&#x2026;, x<sub>t&#x2212;1</sub>, x<sub>t</sub>, x<sub>t&#x2009;&#x002B;&#x2009;1</sub> &#x2026;&#x007D;, are the inputs to this layer, where x<sub>t</sub>&#x2009;&#x003D;&#x2009;(x<sub>1</sub>, x<sub>2</sub>, &#x2026;, x<sub>N</sub>). A weight matrix W<sub>IH</sub> is used to determine the links between the input units of a fully connected RNN and the hidden units in the hidden layer. The hidden layer has M hidden units h<sub>t</sub>&#x2009;&#x003D;&#x2009;(h<sub>1</sub>, h<sub>2</sub>, &#x2026;, h<sub>M</sub>), that are connected to each other through time with recurrent. Small non-zero components can be used to initialize hidden units, which can boost the network&#x2019;s overall performance and stability.</p>
<fig id="fig-1"><label>Figure 1</label><caption><title>Architecture of recurrent neural network</title></caption><graphic mimetype="image" mime-subtype="tif" xlink:href="IASC_37606-fig-1.tif"/></fig>
<p>The hidden layer defines the state space or &#x201C;memory&#x201D; of the system as
<disp-formula id="eqn-4"><label>(4)</label><mml:math id="mml-eqn-4" display="block"><mml:mrow><mml:msub><mml:mi mathvariant="normal">h</mml:mi><mml:mrow><mml:mi mathvariant="normal">t</mml:mi></mml:mrow></mml:msub></mml:mrow><mml:mo>=</mml:mo><mml:mrow><mml:msub><mml:mi mathvariant="normal">f</mml:mi><mml:mrow><mml:mi mathvariant="normal">H</mml:mi></mml:mrow></mml:msub></mml:mrow><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:msub><mml:mi mathvariant="normal">o</mml:mi><mml:mrow><mml:mi mathvariant="normal">t</mml:mi></mml:mrow></mml:msub></mml:mrow><mml:mo>)</mml:mo></mml:mrow></mml:math></disp-formula>where
<disp-formula id="eqn-5"><label>(5)</label><mml:math id="mml-eqn-5" display="block"><mml:mrow><mml:msub><mml:mi mathvariant="normal">o</mml:mi><mml:mrow><mml:mi mathvariant="normal">t</mml:mi></mml:mrow></mml:msub></mml:mrow><mml:mo>=</mml:mo><mml:mrow><mml:msub><mml:mi mathvariant="normal">W</mml:mi><mml:mrow><mml:mi mathvariant="normal">I</mml:mi><mml:mi mathvariant="normal">H</mml:mi></mml:mrow></mml:msub><mml:msub><mml:mi mathvariant="normal">x</mml:mi><mml:mrow><mml:mi mathvariant="normal">t</mml:mi></mml:mrow></mml:msub></mml:mrow><mml:mo>+</mml:mo><mml:mrow><mml:msub><mml:mi mathvariant="normal">W</mml:mi><mml:mrow><mml:mi mathvariant="normal">H</mml:mi><mml:mi mathvariant="normal">H</mml:mi></mml:mrow></mml:msub><mml:msub><mml:mi mathvariant="normal">h</mml:mi><mml:mrow><mml:mi mathvariant="normal">t</mml:mi></mml:mrow></mml:msub><mml:mo>&#x2212;</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mo>+</mml:mo><mml:mrow><mml:msub><mml:mi mathvariant="normal">b</mml:mi><mml:mrow><mml:mi mathvariant="normal">h</mml:mi></mml:mrow></mml:msub></mml:mrow></mml:math></disp-formula></p>
<p>f<sub>H</sub>(&#x22C5;) is the hidden layer activation function, and b<sub>h</sub> is the bias vector of the hidden units. The hidden units are connected to the output layer with weighted connections W<sub>HO</sub>. The output layer has P units y<sub>t</sub>&#x2009;&#x003D;&#x2009;(y<sub>1</sub>, y<sub>2</sub> &#x2026; y<sub>P</sub>) that are computed as
<disp-formula id="eqn-6"><label>(6)</label><mml:math id="mml-eqn-6" display="block"><mml:mrow><mml:msub><mml:mi mathvariant="normal">y</mml:mi><mml:mrow><mml:mi mathvariant="normal">t</mml:mi></mml:mrow></mml:msub></mml:mrow><mml:mo>=</mml:mo><mml:mrow><mml:msub><mml:mi mathvariant="normal">f</mml:mi><mml:mrow><mml:mi mathvariant="normal">O</mml:mi></mml:mrow></mml:msub></mml:mrow><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:msub><mml:mi mathvariant="normal">W</mml:mi><mml:mrow><mml:mi mathvariant="normal">H</mml:mi><mml:mi mathvariant="normal">O</mml:mi></mml:mrow></mml:msub><mml:msub><mml:mi mathvariant="normal">h</mml:mi><mml:mrow><mml:mi mathvariant="normal">t</mml:mi></mml:mrow></mml:msub></mml:mrow><mml:mo>+</mml:mo><mml:mrow><mml:msub><mml:mi mathvariant="normal">b</mml:mi><mml:mrow><mml:mi mathvariant="normal">o</mml:mi></mml:mrow></mml:msub></mml:mrow><mml:mo>)</mml:mo></mml:mrow></mml:math></disp-formula>where f<sub>O</sub>(&#x22C5;) is the activation functions and b<sub>o</sub> is the bias vector in the output layer. Since the input-target pairs are sequential through time, the above steps are repeated consequently over time t&#x2009;&#x003D;&#x2009;(1, &#x2026;, T).</p>
<p>Based on the input vector, the hidden states offer a prediction at the output layer for each time step. The hidden state of an RNN is a set of values that, independent of the influence of any external factors, compile all the specific knowledge required about the network&#x2019;s previous states over numerous time steps. At the output layer, this integrated information can define the network&#x2019;s future behaviour and produce precise predictions.</p>
<p>Multiple linear hidden layers function as a single linear hidden layer for linear networks. Since they can define nonlinear bounds, nonlinear functions are more potent than linear ones. The reason for learning input-target interactions in an RNN is the nonlinearity in one or more subsequent hidden layers. A popular option is the &#x201C;sigmoid,&#x201D; which reduces a real value to the range [0, 1]. This activation function is typically applied in the output layer, where a classification model is trained using a cross-entropy loss function.</p>
<p>The &#x201C;sigmoid&#x201D; activation functions are defined as
<disp-formula id="eqn-7"><label>(7)</label><mml:math id="mml-eqn-7" display="block"><mml:mtext>&#x0431;</mml:mtext><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mi mathvariant="normal">x</mml:mi></mml:mrow><mml:mo>)</mml:mo></mml:mrow><mml:mo>=</mml:mo><mml:mfrac><mml:mn>1</mml:mn><mml:mrow><mml:mn>1</mml:mn><mml:mo>+</mml:mo><mml:msup><mml:mi>e</mml:mi><mml:mrow><mml:mo>&#x2212;</mml:mo><mml:mi>x</mml:mi></mml:mrow></mml:msup></mml:mrow></mml:mfrac></mml:math></disp-formula></p>
<p>The issue and the type of data have a major impact on the activation function choice. &#x201C;Sigmoid&#x201D; activation functions rapidly saturate the neuron and can cause the gradient to disappear.</p>
</sec>
<sec id="s5"><label>5</label><title>Dataset Description</title>
<p>All experiments are conducted in the Python environment, which takes center stage. The effectiveness of the suggested technique is examined in this part using three distinct datasets. <xref ref-type="table" rid="table-1">Tables 1</xref> to <xref ref-type="table" rid="table-3">3</xref> provide a description of the dataset.</p>
<table-wrap id="table-1"><label>Table 1</label><caption><title>Dataset description credit card fraud dataset</title></caption>
<table frame="hsides">
<colgroup>
<col align="left"/>
<col align="left"/>
</colgroup>
<thead>
<tr>
<th align="left">Description</th>
<th align="left">Credit card fraud</th>
</tr>
</thead>
<tbody>
<tr>
<td align="left">Number of instances</td>
<td align="left">58016</td>
</tr>
<tr>
<td align="left">Number of attributes</td>
<td align="left">40</td>
</tr>
<tr>
<td align="left">Number class</td>
<td align="left">2</td>
</tr>
<tr>
<td align="left">Number of positive samples</td>
<td align="left">57879</td>
</tr>
<tr>
<td align="left">Number of negative samples</td>
<td align="left">137</td>
</tr>
</tbody>
</table>
</table-wrap><table-wrap id="table-2"><label>Table 2</label><caption><title>Dataset description mortgage fraud dataset</title></caption>
<table frame="hsides">
<colgroup>
<col align="left"/>
<col align="left"/>
</colgroup>
<thead>
<tr>
<th align="left">Description</th>
<th align="left">Mortgage fraud</th>
</tr>
</thead>
<tbody>
<tr>
<td align="left">Number of instances</td>
<td align="left">48674</td>
</tr>
<tr>
<td align="left">Number of attributes</td>
<td align="left">11</td>
</tr>
<tr>
<td align="left">Number class</td>
<td align="left">2</td>
</tr>
<tr>
<td align="left">Number of positive samples</td>
<td align="left">48066</td>
</tr>
<tr>
<td align="left">Number of negative samples</td>
<td align="left">608</td>
</tr>
</tbody>
</table>
</table-wrap><table-wrap id="table-3"><label>Table 3</label><caption><title>Dataset description insurance fraud dataset</title></caption>
<table frame="hsides">
<colgroup>
<col align="left"/>
<col align="left"/>
</colgroup>
<thead>
<tr>
<th align="left">Description</th>
<th align="left">Insurance fraud</th>
</tr>
</thead>
<tbody>
<tr>
<td align="left">Number of instances</td>
<td align="left">44326</td>
</tr>
<tr>
<td align="left">Number of attributes</td>
<td align="left">39</td>
</tr>
<tr>
<td align="left">Number class</td>
<td align="left">2</td>
</tr>
<tr>
<td align="left">Number of positive samples</td>
<td align="left">43814</td>
</tr>
<tr>
<td align="left">Number of negative samples</td>
<td align="left">512</td>
</tr>
</tbody>
</table>
</table-wrap>
</sec>
<sec id="s6"><label>6</label><title>Metric Unit</title>
<p>Generally, the metrics in deep learning are meant for binary classification problems which shall be generalized for multiclass problems. For a multiclass classification problem, the metrics are performed as binary classifiers internally by assuming one class as positive and all other classes as negative, commonly known as one-<italic>vs.</italic>-all classifier.</p>
<p>Accuracy</p>
<p>Accuracy is the simplest and first metric which evaluates the performance of the network. It is calculated by number of correct predictions to the total predictions. It is represented by
<disp-formula id="eqn-8"><label>(8)</label><mml:math id="mml-eqn-8" display="block"><mml:mrow><mml:mtext>Accuracy</mml:mtext></mml:mrow><mml:mo>=</mml:mo><mml:mfrac><mml:mrow><mml:mrow><mml:mtext>TP</mml:mtext></mml:mrow><mml:mo>+</mml:mo><mml:mrow><mml:mtext>True Negative&#xA0;</mml:mtext></mml:mrow><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mtext>TN</mml:mtext></mml:mrow><mml:mo>)</mml:mo></mml:mrow></mml:mrow><mml:mrow><mml:mrow><mml:mtext>TP</mml:mtext></mml:mrow><mml:mo>+</mml:mo><mml:mrow><mml:mtext>TN</mml:mtext></mml:mrow><mml:mo>+</mml:mo><mml:mrow><mml:mtext>FP</mml:mtext></mml:mrow><mml:mo>+</mml:mo><mml:mrow><mml:mtext>FN</mml:mtext></mml:mrow></mml:mrow></mml:mfrac></mml:math></disp-formula></p>
<p><bold>Mean Absolute Error (MAE)</bold></p>
<p>A measure of mistakes among paired observations describing the same phenomena is called mean absolute error. The MAE is expressed as,
<disp-formula id="eqn-9"><label>(9)</label><mml:math id="mml-eqn-9" display="block"><mml:mrow><mml:mtext>MAE</mml:mtext></mml:mrow><mml:mo>=</mml:mo><mml:mfrac><mml:mrow><mml:msubsup><mml:mrow><mml:mo>&#x2211;</mml:mo></mml:mrow><mml:mrow><mml:mrow><mml:mtext>i</mml:mtext></mml:mrow><mml:mo>=</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mrow><mml:mrow><mml:mtext>n</mml:mtext></mml:mrow></mml:mrow></mml:msubsup><mml:mrow><mml:mo>|</mml:mo><mml:msub><mml:mrow><mml:mtext>l</mml:mtext></mml:mrow><mml:mrow><mml:mrow><mml:mtext>i</mml:mtext></mml:mrow></mml:mrow></mml:msub><mml:mo>&#x2212;</mml:mo><mml:msub><mml:mrow><mml:mtext>m</mml:mtext></mml:mrow><mml:mrow><mml:mrow><mml:mtext>i</mml:mtext></mml:mrow></mml:mrow></mml:msub><mml:mo>|</mml:mo></mml:mrow></mml:mrow><mml:mrow><mml:mtext>n</mml:mtext></mml:mrow></mml:mfrac></mml:math></disp-formula>where prediction is given as<inline-formula id="ieqn-8"><mml:math id="mml-ieqn-8"><mml:msub><mml:mrow><mml:mi mathvariant="normal">l</mml:mi></mml:mrow><mml:mrow><mml:mrow><mml:mtext>i</mml:mtext></mml:mrow></mml:mrow></mml:msub></mml:math></inline-formula>, true value is given as <inline-formula id="ieqn-9"><mml:math id="mml-ieqn-9"><mml:msub><mml:mrow><mml:mtext>m</mml:mtext></mml:mrow><mml:mrow><mml:mrow><mml:mtext>i</mml:mtext></mml:mrow></mml:mrow></mml:msub></mml:math></inline-formula> and the total count of data point is given as n.</p>
<p><bold>Mean Square Error (MSE)</bold></p>
<p>The average of the squares of the mistakes, or the average squared difference between the estimated values and the actual value, is measured by the mean squared error or mean squared deviation of an estimator. MSE, which corresponds to the expected value of the squared error loss, is a risk function. The MSE is expressed as,
<disp-formula id="eqn-10"><label>(10)</label><mml:math id="mml-eqn-10" display="block"><mml:mrow><mml:mtext>MSE</mml:mtext></mml:mrow><mml:mo>=</mml:mo><mml:mfrac><mml:mn>1</mml:mn><mml:mrow><mml:mtext>n</mml:mtext></mml:mrow></mml:mfrac><mml:msubsup><mml:mrow><mml:mo>&#x2211;</mml:mo></mml:mrow><mml:mrow><mml:mrow><mml:mtext>i</mml:mtext></mml:mrow><mml:mo>=</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mrow><mml:mrow><mml:mtext>n</mml:mtext></mml:mrow></mml:mrow></mml:msubsup><mml:msup><mml:mrow><mml:mo>(</mml:mo><mml:msub><mml:mrow><mml:mtext>l</mml:mtext></mml:mrow><mml:mrow><mml:mrow><mml:mtext>i</mml:mtext></mml:mrow></mml:mrow></mml:msub><mml:mo>&#x2212;</mml:mo><mml:mrow><mml:mover><mml:msub><mml:mrow><mml:mtext>l</mml:mtext></mml:mrow><mml:mrow><mml:mrow><mml:mtext>i</mml:mtext></mml:mrow></mml:mrow></mml:msub><mml:mo>&#x005E;</mml:mo></mml:mover></mml:mrow><mml:mo>)</mml:mo></mml:mrow><mml:mrow><mml:mn>2</mml:mn></mml:mrow></mml:msup></mml:math></disp-formula>where observed range is indicated as <inline-formula id="ieqn-10"><mml:math id="mml-ieqn-10"><mml:msub><mml:mrow><mml:mtext>l</mml:mtext></mml:mrow><mml:mrow><mml:mrow><mml:mtext>i</mml:mtext></mml:mrow></mml:mrow></mml:msub></mml:math></inline-formula>, predicted range is indicated as <inline-formula id="ieqn-11"><mml:math id="mml-ieqn-11"><mml:mrow><mml:mover><mml:msub><mml:mrow><mml:mtext>l</mml:mtext></mml:mrow><mml:mrow><mml:mrow><mml:mtext>i</mml:mtext></mml:mrow></mml:mrow></mml:msub><mml:mo>&#x005E;</mml:mo></mml:mover></mml:mrow></mml:math></inline-formula>, and count of data point is given as n.</p>
<p><bold>F1-Score</bold></p>
<p>F1-Score combines the precision and recall by calculating the weighted average of precision and recall. This score uses both false positives and false negatives for its calculation. F1-Score is more informative measure than accuracy, mainly in case of imbalanced datasets. The estimation of F1 score is expressed as,</p>
<p><disp-formula id="eqn-11"><label>(11)</label><mml:math id="mml-eqn-11" display="block"><mml:mrow><mml:mtext>F</mml:mtext></mml:mrow><mml:mn>1</mml:mn><mml:mrow><mml:mtext>score</mml:mtext></mml:mrow><mml:mo>=</mml:mo><mml:mfrac><mml:mrow><mml:mn>2</mml:mn><mml:mo>&#x00D7;</mml:mo><mml:mrow><mml:mtext>Precison</mml:mtext></mml:mrow><mml:mo>&#x00D7;</mml:mo><mml:mrow><mml:mtext>Recall</mml:mtext></mml:mrow></mml:mrow><mml:mrow><mml:mrow><mml:mtext>Precision</mml:mtext></mml:mrow><mml:mo>+</mml:mo><mml:mrow><mml:mtext>Recall</mml:mtext></mml:mrow></mml:mrow></mml:mfrac></mml:math></disp-formula></p>
<p><bold>Precision</bold></p>
<p>Precision deals with the frequency of the correct predictions of true positive out of total predictions. Recall deals with how many correct predictions are actually correct.
<disp-formula id="eqn-12"><label>(12)</label><mml:math id="mml-eqn-12" display="block"><mml:mrow><mml:mtext>Precision</mml:mtext></mml:mrow><mml:mo>=</mml:mo><mml:mfrac><mml:mrow><mml:mtext>True Positive</mml:mtext></mml:mrow><mml:mrow><mml:mtext>Total Predicted Value</mml:mtext></mml:mrow></mml:mfrac></mml:math></disp-formula></p>
<p><bold>Recall</bold></p>
<p>Recall is the percentage of successfully retrieved relevant documents in information retrieval.
<disp-formula id="eqn-13"><label>(13)</label><mml:math id="mml-eqn-13" display="block"><mml:mrow><mml:mtext>Recall</mml:mtext></mml:mrow><mml:mo>=</mml:mo><mml:mfrac><mml:mrow><mml:mtext>True Positive</mml:mtext></mml:mrow><mml:mrow><mml:mrow><mml:mtext>True Positive</mml:mtext></mml:mrow><mml:mo>+</mml:mo><mml:mrow><mml:mtext>False Positive</mml:mtext></mml:mrow></mml:mrow></mml:mfrac></mml:math></disp-formula></p>
</sec>
<sec id="s7"><label>7</label><title>Results and Discussion</title>
<p>In this section performance of the proposed approach is investigated with three different datasets. The performance is investigated in terms of Accuracy, f1 score, Mean Square Error (MSE) and Mean Absolute Error (MAE). The proposed ABC-RNN is compared with the existing technique RNN. The Performance of the proposed and existing techniques is given in <xref ref-type="table" rid="table-4">Table 4</xref>.</p>
<table-wrap id="table-4"><label>Table 4</label><caption><title>Comparison of performance for credit card fraud dataset</title></caption>
<table frame="hsides">
<colgroup>
<col align="left"/>
<col align="left"/>
<col align="left"/>
<col align="left"/>
<col align="left"/>
<col align="left"/>
<col align="left"/>
</colgroup>
<thead>
<tr>
<th align="left">Technique</th>
<th align="left">Accuracy (&#x0025;)</th>
<th align="left">MAE</th>
<th align="left">MSE</th>
<th align="left">Precision (&#x0025;)</th>
<th align="left">Recall (&#x0025;)</th>
<th align="left">F1_score (&#x0025;)</th>
</tr>
</thead>
<tbody>
<tr>
<td align="left">RNN</td>
<td align="left">90.26</td>
<td align="left">0.357</td>
<td align="left">0.399</td>
<td align="left">88.07</td>
<td align="left">89.11</td>
<td align="left">85.58</td>
</tr>
<tr>
<td align="left">ABC-RNN</td>
<td align="left">96.03</td>
<td align="left">0.205</td>
<td align="left">0.360</td>
<td align="left">97.04</td>
<td align="left">93.40</td>
<td align="left">91.98</td>
</tr>
</tbody>
</table>
</table-wrap>
<p><xref ref-type="fig" rid="fig-2">Fig. 2</xref> and <xref ref-type="table" rid="table-4">Table 4</xref> illustrate the comparison of accuracy, MAE, and MSE, precision, Recall and F1_Score for the credit card fraud detection. <xref ref-type="fig" rid="fig-2">Fig. 2</xref> shows a thorough analysis of the ABC_RNN model&#x2019;s accuracy, mean absolute error, and mean squared error, Precision, Recall and F1_Score in comparison to the RNN model that is currently in use on the Credit card Dataset. The resulting figures showed that the ABC-RNN model had enhanced accuracy of 96.03 percent, a lowered MAE of 0.205, a lower MSE of 0.360, precision of 97.04 percent, Recall of 93.04 and F1_Score of 91.98 compared to the RNN model&#x2019;s slightly decreased accuracy of 90.06 percent, increased MAE of 0.357, a increased MSE of 0.339, precision of 88.07 percent, Recall of 89.11 and F1_Score of 85.58.</p>
<fig id="fig-2"><label>Figure 2</label><caption><title>Comparison of performance for credit card fraud dataset</title></caption><graphic mimetype="image" mime-subtype="tif" xlink:href="IASC_37606-fig-2.tif"/></fig>
<p>The comparison of accuracy, MAE, and MSE, precision, recall, and F1 Score for credit card fraud detection is shown in <xref ref-type="fig" rid="fig-2">Fig. 2</xref> and <xref ref-type="table" rid="table-5">Table 5</xref>. The accuracy, mean absolute error, mean squared error, precision, recall, and F1 Score of the ABC RNN model in comparison to the RNN model currently being used on the Credit card Dataset are all thoroughly analysed in <xref ref-type="fig" rid="fig-2">Fig. 2</xref>. In comparison to the RNN model, which had slightly lower accuracy of 91.14 percent, higher MAE of 0.468, higher MSE of 0.379, precision of 90.59 percent, Recall of 89.11, and F1 Score of 86.81, the ABC-RNN model had improved accuracy of 98.60 percent, a lower MAE of 0.169, a lower MSE of 0.118, and precision of 98.78 percent, Recall of 92.08 and F1_Score of 94.21.</p>
<table-wrap id="table-5"><label>Table 5</label><caption><title>Comparison of performance for insurance fraud dataset</title></caption>
<table frame="hsides">
<colgroup>
<col align="left"/>
<col align="left"/>
<col align="left"/>
<col align="left"/>
<col align="left"/>
<col align="left"/>
<col align="left"/>
</colgroup>
<thead>
<tr>
<th align="left">Technique</th>
<th align="left">Accuracy (&#x0025;)</th>
<th align="left">MAE</th>
<th align="left">MSE</th>
<th align="left">Precision (&#x0025;)</th>
<th align="left">Recall (&#x0025;)</th>
<th align="left">F1_score (&#x0025;)</th>
</tr>
</thead>
<tbody>
<tr>
<td align="left">RNN</td>
<td align="left">91.14</td>
<td align="left">0.468</td>
<td align="left">0.379</td>
<td align="left">90.59</td>
<td align="left">89.11</td>
<td align="left">86.81</td>
</tr>
<tr>
<td align="left">ABC-RNN</td>
<td align="left">98.60</td>
<td align="left">0.169</td>
<td align="left">0.188</td>
<td align="left">98.78</td>
<td align="left">92.08</td>
<td align="left">94.21</td>
</tr>
</tbody>
</table>
</table-wrap>
<p>The comparison of accuracy, MAE, and MSE, precision, recall, and F1 Score for credit card fraud detection is shown in <xref ref-type="fig" rid="fig-3">Fig. 3</xref> and <xref ref-type="table" rid="table-6">Table 6</xref>. The accuracy, mean absolute error, mean squared error, precision, recall, and F1 Score of the ABC RNN model in comparison to the RNN model currently being used on the Credit card Dataset are all thoroughly analysed in <xref ref-type="fig" rid="fig-3">Fig. 3</xref>. In comparison to the RNN model, which had slightly lower accuracy of 90.60 percent, higher MAE of 0.417, higher MSE of 0.330, precision of 90.81 percent, Recall of 86.12, and F1 Score of 84.31, the ABC-RNN model had improved accuracy of 97.92 percent <xref ref-type="fig" rid="fig-4">Fig. 4</xref>, a lower MAE of 0.119, a lower MSE of 0.301, and precision of 97.93 percent, Recall of 92.25 and F1_Score of 97.16.</p>
<fig id="fig-3"><label>Figure 3</label><caption><title>Comparison of performance for insurance fraud dataset</title></caption><graphic mimetype="image" mime-subtype="tif" xlink:href="IASC_37606-fig-3.tif"/></fig><table-wrap id="table-6"><label>Table 6</label><caption><title>Comparison of performance for mortgage fraud dataset</title></caption>
<table frame="hsides">
<colgroup>
<col align="left"/>
<col align="left"/>
<col align="left"/>
<col align="left"/>
<col align="left"/>
<col align="left"/>
<col align="left"/>
</colgroup>
<thead>
<tr>
<th align="left">Technique</th>
<th align="left">Accuracy (&#x0025;)</th>
<th align="left">MAE</th>
<th align="left">MSE</th>
<th align="left">Precision (&#x0025;)</th>
<th align="left">Recall (&#x0025;)</th>
<th align="left">F1_score (&#x0025;)</th>
</tr>
</thead>
<tbody>
<tr>
<td align="left">RNN</td>
<td align="left">90.60</td>
<td align="left">0.417</td>
<td align="left">0.330</td>
<td align="left">90.81</td>
<td align="left">86.12</td>
<td align="left">84.31</td>
</tr>
<tr>
<td align="left">ABC-RNN</td>
<td align="left">97.92</td>
<td align="left">0.199</td>
<td align="left">0.301</td>
<td align="left">97.93</td>
<td align="left">92.25</td>
<td align="left">97.16</td>
</tr>
</tbody>
</table>
</table-wrap><fig id="fig-4"><label>Figure 4</label><caption><title>Comparison of performance for mortgage fraud dataset</title></caption><graphic mimetype="image" mime-subtype="tif" xlink:href="IASC_37606-fig-4a.tif"/>
<graphic mimetype="image" mime-subtype="tif" xlink:href="IASC_37606-fig-4b.tif"/></fig>
<p>In <xref ref-type="table" rid="table-7 table-8 table-9">Tables 7&#x2013;9</xref> shows the accuracy for different dataset. From those table, accuracy in &#x0025; is increased in proposed method (ABC-RNN) when compared to the different existing methods.</p>
<table-wrap id="table-7"><label>Table 7</label><caption><title>Comparison of performance for different approaches for credit card fraud dataset</title></caption>
<table frame="hsides">
<colgroup>
<col align="left"/>
<col align="left"/>
<col align="left"/>
</colgroup>
<thead>
<tr>
<th align="center" colspan="3">Credit card fraud dataset</th>
</tr>
<tr>
<th align="left">References</th>
<th align="left">Methods</th>
<th align="left">Accuracy (&#x0025;)</th>
</tr>
</thead>
<tbody>
<tr>
<td align="left">Proposed</td>
<td align="left">ABC-RNN</td>
<td align="left">96.03</td>
</tr>
<tr>
<td align="left">Esraa Faisal Malik et al., (2022)</td>
<td align="left">Adaboost&#x2009;&#x002B;&#x2009;LGBM</td>
<td align="left">82</td>
</tr>
<tr>
<td align="left">Ajeet Singh &#x0026; Anurag Jain (2021)</td>
<td align="left">CFS&#x2009;&#x002B;&#x2009;RF&#x2009;&#x002B;&#x2009;firefly</td>
<td align="left">96</td>
</tr>
<tr>
<td align="left">Maria Nancy et al., (2020)</td>
<td align="left">CNN&#x2009;&#x002B;&#x2009;KNN</td>
<td align="left">94</td>
</tr>
</tbody>
</table>
</table-wrap><table-wrap id="table-8"><label>Table 8</label><caption><title>Comparison of performance for different approaches for insurance fraud dataset</title></caption>
<table frame="hsides">
<colgroup>
<col align="left"/>
<col align="left"/>
<col align="left"/>
</colgroup>
<thead>
<tr>
<th align="center" colspan="3">Insurance fraud dataset</th>
</tr>
<tr>
<th align="left">References</th>
<th align="left">Methods</th>
<th align="left">Accuracy (&#x0025;)</th>
</tr>
</thead>
<tbody>
<tr>
<td align="left">Proposed</td>
<td align="left">ABC-RNN</td>
<td align="left">98.60</td>
</tr>
<tr>
<td align="left">Theja et al., (2020)</td>
<td align="left">CF&#x2009;&#x002B;&#x2009;XGBoost</td>
<td align="left">98</td>
</tr>
<tr>
<td align="left">Yao Zhi Xu et al., (2019)</td>
<td align="left">DT&#x2009;&#x002B;&#x2009;LR</td>
<td align="left">72</td>
</tr>
<tr>
<td align="left">Bing Chu et al., (2018)</td>
<td align="left">RF&#x2009;&#x002B;&#x2009;CNN</td>
<td align="left">92</td>
</tr>
</tbody>
</table>
</table-wrap><table-wrap id="table-9"><label>Table 9</label><caption><title>Comparison of performance for different approaches for mortgage fraud dataset</title></caption>
<table frame="hsides">
<colgroup>
<col align="left"/>
<col align="left"/>
<col align="left"/>
</colgroup>
<thead>
<tr>
<th align="center" colspan="3">Mortgage fraud dataset</th>
</tr>
<tr>
<th align="left">References</th>
<th align="left">Methods</th>
<th align="left">Accuracy</th>
</tr>
</thead>
<tbody>
<tr>
<td align="left">Proposed</td>
<td align="left">ABC-RNN</td>
<td align="left">97.92</td>
</tr>
<tr>
<td align="left">Bahari Belaton et al., (2022)</td>
<td align="left">Adaboost&#x2009;&#x002B;&#x2009;SVM</td>
<td align="left">91</td>
</tr>
<tr>
<td align="left">Nandwan. (2021)</td>
<td align="left">PCA&#x2009;&#x002B;&#x2009;XGBoost</td>
<td align="left">93</td>
</tr>
<tr>
<td align="left">Maoguang Wang et al., (2018)</td>
<td align="left">XG-Boost&#x2009;&#x002B;&#x2009;LR</td>
<td align="left">83</td>
</tr>
</tbody>
</table>
</table-wrap>
<p>In <xref ref-type="table" rid="table-10 table-11 table-12">Tables 10&#x2013;12</xref> shows the MAE and MSE value for different dataset. From those table, errors are decreased in proposed method (ABC-RNN) when compared to the different existing methods</p>
<table-wrap id="table-10"><label>Table 10</label><caption><title>Comparison of performance for different approaches for credit card fraud dataset</title></caption>
<table frame="hsides">
<colgroup>
<col align="left"/>
<col align="left"/>
<col align="left"/>
<col align="left"/>
</colgroup>
<thead>
<tr>
<th align="center" colspan="4">Credit card fraud dataset</th>
</tr>
<tr>
<th align="left">References</th>
<th align="left">Methods</th>
<th align="left">MAE</th>
<th align="left">MSE</th>
</tr>
</thead>
<tbody>
<tr>
<td align="left">Proposed</td>
<td align="left">ABC&#x2009;&#x002B;&#x2009;RNN</td>
<td align="left">0.205</td>
<td align="left">0.360</td>
</tr>
<tr>
<td align="left">Hasoon et al., (2022)</td>
<td align="left">DNN&#x2009;&#x002B;&#x2009;LSTM</td>
<td align="left">0.237</td>
<td align="left">0.413</td>
</tr>
<tr>
<td align="left">Meran et al., (2020)</td>
<td align="left">LSTM&#x2009;&#x002B;&#x2009;NN</td>
<td align="left">0.281</td>
<td align="left">0.371</td>
</tr>
<tr>
<td align="left">HAsaniuo et al., (2016)</td>
<td align="left">PSO&#x2009;&#x002B;&#x2009;KNN</td>
<td align="left">0.224</td>
<td align="left">0.780</td>
</tr>
</tbody>
</table>
</table-wrap><table-wrap id="table-11"><label>Table 11</label><caption><title>Comparison of performance for different approaches for insurance fraud dataset</title></caption>
<table frame="hsides">
<colgroup>
<col align="left"/>
<col align="left"/>
<col align="left"/>
<col align="left"/>
</colgroup>
<thead>
<tr>
<th align="center" colspan="4">Insurance fraud dataset</th>
</tr>
<tr>
<th align="left">References</th>
<th align="left">Methods</th>
<th align="left">MAE</th>
<th align="left">MSE</th>
</tr>
</thead>
<tbody>
<tr>
<td align="left">Proposed</td>
<td align="left">ABC&#x2009;&#x002B;&#x2009;RNN</td>
<td align="left">0.169</td>
<td align="left">0.188</td>
</tr>
<tr>
<td align="left">Oikonomidis et al., (2022)</td>
<td align="left">CNN&#x2009;&#x002B;&#x2009;XGBoost</td>
<td align="left">0.263</td>
<td align="left">0.374</td>
</tr>
<tr>
<td align="left">Yan Li et al., (2019)</td>
<td align="left">LSTM&#x2009;&#x002B;&#x2009;CNN</td>
<td align="left">0.181</td>
<td align="left">0.412</td>
</tr>
<tr>
<td align="left">Lin et al., (2017)</td>
<td align="left">NN&#x2009;&#x002B;&#x2009;LSTM</td>
<td align="left">0.192</td>
<td align="left">0.382</td>
</tr>
</tbody>
</table>
</table-wrap><table-wrap id="table-12"><label>Table 12</label><caption><title>Comparison of performance for different approaches for mortgage fraud dataset</title></caption>
<table frame="hsides">
<colgroup>
<col align="left"/>
<col align="left"/>
<col align="left"/>
<col align="left"/>
</colgroup>
<thead>
<tr>
<th align="center" colspan="4">Mortgage fraud dataset</th>
</tr>
<tr>
<th align="left">References</th>
<th align="left">Methods</th>
<th align="left">MAE</th>
<th align="left">MSE</th>
</tr>
</thead>
<tbody>
<tr>
<td align="left">Proposed</td>
<td align="left">ABC&#x2009;&#x002B;&#x2009;RNN</td>
<td align="left">0.199</td>
<td align="left">0.301</td>
</tr>
<tr>
<td align="left">Agarwal et al., (2022)</td>
<td align="left">PSO&#x2009;&#x002B;&#x2009;NN</td>
<td align="left">0.335</td>
<td align="left">0.365</td>
</tr>
<tr>
<td align="left">Ajeet Singh et al., (2019)</td>
<td align="left">SVM&#x2009;&#x002B;&#x2009;RF</td>
<td align="left">0.412</td>
<td align="left">0.363</td>
</tr>
<tr>
<td align="left">Anurag et al., (2019)</td>
<td align="left">KNN&#x2009;&#x002B;&#x2009;PCA</td>
<td align="left">0.498</td>
<td align="left">0.323</td>
</tr>
</tbody>
</table>
</table-wrap>
<p>In <xref ref-type="table" rid="table-13 table-14 table-15">Tables 13&#x2013;15</xref> shows the performance of Precision, Recall and F1_Score for different dataset. From those table, the proposed method (ABC-RNN) obtains best results when compares to the existing hybrid approaches.</p>
<table-wrap id="table-13"><label>Table 13</label><caption><title>Comparison of performance for different approaches for credit card fraud dataset</title></caption>
<table frame="hsides">
<colgroup>
<col align="left"/>
<col align="left"/>
<col align="left"/>
<col align="left"/>
<col align="left"/>
</colgroup>
<thead>
<tr>
<th align="center" colspan="5">Credit card fraud dataset</th>
</tr>
<tr>
<th align="left">References</th>
<th align="left">Methods</th>
<th align="left">Precision (&#x0025;)</th>
<th align="left">Recall (&#x0025;)</th>
<th align="left">F1_score (&#x0025;)</th>
</tr>
</thead>
<tbody>
<tr>
<td align="left">Proposed</td>
<td align="left">ABC&#x2009;&#x002B;&#x2009;RNN</td>
<td align="left">97</td>
<td align="left">93</td>
<td align="left">92</td>
</tr>
<tr>
<td align="left">Esra Faisal Malik et al., (2022)</td>
<td align="left">Adaboost&#x2009;&#x002B;&#x2009;LGBM</td>
<td align="left">96</td>
<td align="left">64</td>
<td align="left">77</td>
</tr>
<tr>
<td align="left">Maria Nancy et al., (2020)</td>
<td align="left">CNN&#x2009;&#x002B;&#x2009;KNN</td>
<td align="left">95</td>
<td align="left">91</td>
<td align="left">97</td>
</tr>
<tr>
<td align="left">Shamitha and Ilango et al., (2019)</td>
<td align="left">SMOTE&#x2009;&#x002B;&#x2009;RF</td>
<td align="left">86</td>
<td align="left">82</td>
<td align="left">90</td>
</tr>
</tbody>
</table>
</table-wrap><table-wrap id="table-14"><label>Table 14</label><caption><title>Comparison of performance for different approaches for insurance fraud dataset</title></caption>
<table frame="hsides">
<colgroup>
<col align="left"/>
<col align="left"/>
<col align="left"/>
<col align="left"/>
<col align="left"/>
</colgroup>
<thead>
<tr>
<th align="center" colspan="5">Insurance fraud dataset</th>
</tr>
<tr>
<th align="left">References</th>
<th align="left">Methods</th>
<th align="left">Precision (&#x0025;)</th>
<th align="left">Recall (&#x0025;)</th>
<th align="left">F1_ score (&#x0025;)</th>
</tr>
</thead>
<tbody>
<tr>
<td align="left">Proposed</td>
<td align="left">ABC&#x2009;&#x002B;&#x2009;RNN</td>
<td align="left">97</td>
<td align="left">93</td>
<td align="left">92</td>
</tr>
<tr>
<td align="left">Patil et al., (2021)</td>
<td align="left">XGBoost&#x2009;&#x002B;&#x2009;CTGAN</td>
<td align="left">84</td>
<td align="left">84</td>
<td align="left">92</td>
</tr>
<tr>
<td align="left">Patil et al., (2021)</td>
<td align="left">Regression&#x2009;&#x002B;&#x2009;CTGAN</td>
<td align="left">81</td>
<td align="left">81</td>
<td align="left">91</td>
</tr>
<tr>
<td align="left">Shakya et al., (2018)</td>
<td align="left">SMOTE&#x2009;&#x002B;&#x2009;LR</td>
<td align="left">90</td>
<td align="left">88</td>
<td align="left">71</td>
</tr>
</tbody>
</table>
</table-wrap><table-wrap id="table-15"><label>Table 15</label><caption><title>Comparison of performance for different approaches for mortgage fraud dataset</title></caption>
<table frame="hsides">
<colgroup>
<col align="left"/>
<col align="left"/>
<col align="left"/>
<col align="left"/>
<col align="left"/>
</colgroup>
<thead>
<tr>
<th align="center" colspan="5">Mortgage fraud dataset</th>
</tr>
<tr>
<th align="left">References</th>
<th align="left">Methods</th>
<th align="left">Precision (&#x0025;)</th>
<th align="left">Recall (&#x0025;)</th>
<th align="left">F1_ score (&#x0025;)</th>
</tr>
</thead>
<tbody>
<tr>
<td align="left">Proposed</td>
<td align="left">ABC&#x2009;&#x002B;&#x2009;RNN</td>
<td align="left">97</td>
<td align="left">93</td>
<td align="left">92</td>
</tr>
<tr>
<td align="left">Shirodkar et al., (2022)</td>
<td align="left">LR&#x2009;&#x002B;&#x2009;GA</td>
<td align="left">59</td>
<td align="left">89</td>
<td align="left">51</td>
</tr>
<tr>
<td align="left">Abdallah et al., (2021)</td>
<td align="left">CNN&#x2009;&#x002B;&#x2009;LSTM</td>
<td align="left">93</td>
<td align="left">94</td>
<td align="left">93</td>
</tr>
<tr>
<td align="left">Shakya et al., (2018)</td>
<td align="left">XGBOOST&#x2009;&#x002B;&#x2009;SMOTE</td>
<td align="left">53</td>
<td align="left">88</td>
<td align="left">66</td>
</tr>
</tbody>
</table>
</table-wrap>
</sec>
<sec id="s8"><label>8</label><title>Conclusion</title>
<p>Online transactions are essential in today&#x2019;s modern age of global technology because all that is required to finish an application and charge money is the user&#x2019;s credit card details. Therefore, it&#x2019;s essential to create the best strategy for identifying the most of frauds in online systems. Utilizing accuracy, MAE, MSE, Precision, Recall, and F1 Score, the effectiveness of the proposed and existing techniques is examined. The performance result shows that the suggested technique is effective and outperforms the current methods. For three data sets, the suggested method outperforms existing strategies, including RNN, in terms of accuracy. The achievement of the highest accuracy demonstrates that the suggested strategy is effective in identifying cyber-attacks. The proposed method has a lower error rate than the currently used methods. In this method we took financial fraud detection as major issues while doing online transactions. Our proposed ABC-RNN approach achieved accuracy index as 97&#x0025; and we compare the result with existing methods. May be our proposed method detects the already taken or available dataset which can be simulated by predefined set of conditions. In future we can try full automated or connected neural network for dependencies prediction.</p>
</sec>
</body>
<back>
<sec><title>Funding Statement</title>
<p>The authors received no specific funding for this study.</p></sec>
<sec sec-type="COI-statement"><title>Conflicts of Interest</title>
<p>The authors declare that they have no conflicts of interest to report regarding the present study.</p></sec>
<ref-list content-type="authoryear">
<title>References</title>
<ref id="ref-1"><label>[1]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>A.</given-names> <surname>Abdallah</surname></string-name>, <string-name><given-names>M.</given-names> <surname>Maarof</surname></string-name> and <string-name><given-names>A.</given-names> <surname>Zainal</surname></string-name></person-group>, &#x201C;<article-title>Fraud detection system: A survey</article-title>,&#x201D; <source>Journal of Network and Computer Applications</source>, vol. <volume>68</volume>, pp. <fpage>90</fpage>&#x2013;<lpage>113</lpage>, <year>2020</year>.</mixed-citation></ref>
<ref id="ref-2"><label>[2]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>J.</given-names> <surname>West</surname></string-name> and <string-name><given-names>M.</given-names> <surname>Bhattacharya</surname></string-name></person-group>, &#x201C;<article-title>Intelligent financial fraud detection: A comprehensive review</article-title>,&#x201D; <source>Computers and Security</source>, vol. <volume>57</volume>, pp. <fpage>47</fpage>&#x2013;<lpage>66</lpage>, <year>2019</year>.</mixed-citation></ref>
<ref id="ref-3"><label>[3]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>V.</given-names> <surname>Vlasselaer</surname></string-name>, <string-name><given-names>V.</given-names> <surname>Eliassirad</surname></string-name>, <string-name><given-names>T.</given-names> <surname>Akoglu</surname></string-name> and <string-name><given-names>L.</given-names> <surname>Snoeck</surname></string-name></person-group>, &#x201C;<article-title>Gotcha! network-based fraud detection for social security fraud</article-title>,&#x201D; <source>Management Science</source>, vol. <volume>63</volume>, no. <issue>9</issue>, pp. <fpage>3090</fpage>&#x2013;<lpage>3110</lpage>, <year>2017</year>.</mixed-citation></ref>
<ref id="ref-4"><label>[4]</label><mixed-citation publication-type="conf-proc"><person-group person-group-type="author"><string-name><given-names>J.</given-names> <surname>Awoyemi</surname></string-name>, <string-name><given-names>O.</given-names> <surname>Adetunmbi</surname></string-name> and <string-name><given-names>S.</given-names> <surname>Oluwadare</surname></string-name></person-group>, &#x201C;<article-title>Credit card fraud detection using machine learning techniques: A comparative analysis</article-title>,&#x201D; in <conf-name>IEEE Int. Conf. on Computing Networking and Informatics</conf-name>, <conf-loc>Singapore</conf-loc>, pp. <fpage>1</fpage>&#x2013;<lpage>9</lpage>, <year>2020</year>.</mixed-citation></ref>
<ref id="ref-5"><label>[5]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>S.</given-names> <surname>Huang</surname></string-name>, <string-name><given-names>Y.</given-names> <surname>Lin</surname></string-name>, <string-name><given-names>C.</given-names> <surname>Chiu</surname></string-name> and <string-name><given-names>D.</given-names> <surname>Yen</surname></string-name></person-group>, &#x201C;<article-title>Fraud detection using fraud triangle risk factors</article-title>,&#x201D; <source>Information Systems Frontiers</source>, vol. <volume>19</volume>, no. <issue>6</issue>, pp. <fpage>1343</fpage>&#x2013;<lpage>1356</lpage>, <year>2019</year>.</mixed-citation></ref>
<ref id="ref-6"><label>[6]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>A.</given-names> <surname>Chouiekh</surname></string-name> and <string-name><given-names>J.</given-names> <surname>Haj</surname></string-name></person-group>, &#x201C;<article-title>Convnets for fraud detection analysis</article-title>,&#x201D; <source>Procedia Computer Science</source>, vol. <volume>127</volume>, pp. <fpage>133</fpage>&#x2013;<lpage>138</lpage>, <year>2019</year>.</mixed-citation></ref>
<ref id="ref-7"><label>[7]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>D.</given-names> <surname>Dalpozzolo</surname></string-name>, <string-name><given-names>A.</given-names> <surname>Boracchi</surname></string-name>, <string-name><given-names>G.</given-names> <surname>Caelen</surname></string-name> and <string-name><given-names>O.</given-names> <surname>Alippi</surname></string-name></person-group>, &#x201C;<article-title>Credit card fraud detection: A realistic modeling and a novel learning strategy</article-title>,&#x201D; <source>IEEE Transactions on Neural Networks and Learning Systems</source>, vol. <volume>29</volume>,no. <issue>8</issue>, pp. <fpage>3784</fpage>&#x2013;<lpage>3797</lpage>, <year>2017</year>.</mixed-citation></ref>
<ref id="ref-8"><label>[8]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>B.</given-names> <surname>Baesens</surname></string-name>, <string-name><given-names>V.</given-names> <surname>Vlasselaer</surname></string-name> and <string-name><given-names>W.</given-names> <surname>Verbeke</surname></string-name></person-group>, &#x201C;<article-title>Fraud analytics using descriptive, predictive, and social network techniques: A guide to data science for fraud detection</article-title>,&#x201D; <source>John Wiley &#x0026; Sons</source>, vol. <volume>27</volume>, pp. <fpage>145</fpage>&#x2013;<lpage>185</lpage>, <year>2019</year>.</mixed-citation></ref>
<ref id="ref-9"><label>[9]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>C.</given-names> <surname>Bahnsen</surname></string-name>, <string-name><given-names>C.</given-names> <surname>Aouada</surname></string-name>, <string-name><given-names>D.</given-names> <surname>Stojanovic</surname></string-name> and <string-name><given-names>B.</given-names> <surname>Ottersten</surname></string-name></person-group>, &#x201C;<article-title>Feature engineering strategies for credit card fraud detection</article-title>,&#x201D; <source>Expert Systems with Applications</source>, vol. <volume>51</volume>, pp. <fpage>134</fpage>&#x2013;<lpage>142</lpage>, <year>2019</year>.</mixed-citation></ref>
<ref id="ref-10"><label>[10]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>T.</given-names> <surname>Kummer</surname></string-name> and <string-name><given-names>P.</given-names> <surname>Best</surname></string-name></person-group>, &#x201C;<article-title>The effectiveness of fraud detection instruments in not-for-profit organization</article-title>,&#x201D; <source>Managerial Auditing Journal</source>, vol. <volume>10</volume>, no. <issue>2</issue>, pp. <fpage>901</fpage>&#x2013;<lpage>923</lpage>, <year>2017</year>.</mixed-citation></ref>
<ref id="ref-11"><label>[11]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>S.</given-names> <surname>Majhi</surname></string-name></person-group>, &#x201C;<article-title>Fuzzy clustering algorithm based on modified whale optimization algorithm for automobile insurance fraud detection</article-title>,&#x201D; <source>Evolutionary Intelligence</source>, vol. <volume>14</volume>, no. <issue>1</issue>, pp. <fpage>35</fpage>&#x2013;<lpage>46</lpage>, <year>2019</year>.</mixed-citation></ref>
<ref id="ref-12"><label>[12]</label><mixed-citation publication-type="conf-proc"> <person-group person-group-type="author"><string-name><given-names>D.</given-names> <surname>Cheng</surname></string-name>, <string-name><given-names>S.</given-names> <surname>Xiang</surname></string-name>, <string-name><given-names>C.</given-names> <surname>Shang</surname></string-name> and <string-name><given-names>L.</given-names> <surname>Zhang</surname></string-name></person-group>, &#x201C;<article-title>Spatio-temporal attention-based neural network for credit card fraud detection</article-title>,&#x201D; in <conf-name>AAAI Conf. on Artificial Intelligence</conf-name>, <conf-loc>Malaysia</conf-loc>, vol. <volume>34</volume>, no. <issue>1</issue>, pp. <fpage>362</fpage>&#x2013;<lpage>369</lpage>, <year>2020</year>.</mixed-citation></ref>
<ref id="ref-13"><label>[13]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>A.</given-names> <surname>Zakaryazad</surname></string-name> and <string-name><given-names>E.</given-names> <surname>Duman</surname></string-name></person-group>, &#x201C;<article-title>A profit-driven artificial neural network (ANN) with applications to fraud detection and direct marketing</article-title>,&#x201D; <source>Neurocomputing</source>, vol. <volume>175</volume>, pp. <fpage>121</fpage>&#x2013;<lpage>131</lpage>, <year>2019</year>.</mixed-citation></ref>
<ref id="ref-14"><label>[14]</label><mixed-citation publication-type="journal"> <person-group person-group-type="author"><string-name><given-names>S.</given-names> <surname>Georgieva</surname></string-name> and <string-name><given-names>V.</given-names> <surname>Pavlov</surname></string-name></person-group>, &#x201C;<article-title>Using neural network for credit card fraud detection</article-title>,&#x201D; <source>AIP Conference Proceedings</source>, vol. <volume>2159</volume>, no. <issue>1</issue>, pp. <fpage>3</fpage>&#x2013;<lpage>13</lpage>, <year>2019</year>.</mixed-citation></ref>
<ref id="ref-15"><label>[15]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>J.</given-names> <surname>Jurgovsky</surname></string-name> and <string-name><given-names>O.</given-names> <surname>Caelen</surname></string-name></person-group>, &#x201C;<article-title>Sequence classification for credit-card fraud detection</article-title>,&#x201D; <source>Expert Systems with Applications</source>, vol. <volume>100</volume>, pp. <fpage>234</fpage>&#x2013;<lpage>245</lpage>, <year>2020</year>.</mixed-citation></ref>
<ref id="ref-16"><label>[16]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>U.</given-names> <surname>Fiore</surname></string-name>, <string-name><given-names>D.</given-names> <surname>Santis</surname></string-name>, <string-name><given-names>A.</given-names> <surname>Perla</surname></string-name>, <string-name><given-names>F.</given-names> <surname>Zanetti</surname></string-name> and <string-name><given-names>F.</given-names> <surname>Palmieri</surname></string-name></person-group>, &#x201C;<article-title>Using generative adversarial networks for improving classification effectiveness in credit card fraud detection</article-title>,&#x201D; <source>Information Sciences</source>, vol. <volume>479</volume>, pp. <fpage>448</fpage>&#x2013;<lpage>455</lpage>, <year>2019</year>.</mixed-citation></ref>
<ref id="ref-17"><label>[17]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>A.</given-names> <surname>Pumsirirat</surname></string-name> and <string-name><given-names>L.</given-names> <surname>Yan</surname></string-name></person-group>, &#x201C;<article-title>Credit card fraud detection using deep learning based on auto-encoder and restricted Boltzmann machine</article-title>,&#x201D; <source>International Journal of Advanced Computer Science and Applications</source>,vol. <volume>9</volume>, no. <issue>1</issue>, pp. <fpage>18</fpage>&#x2013;<lpage>25</lpage>, <year>2018</year>.</mixed-citation></ref>
<ref id="ref-18"><label>[18]</label><mixed-citation publication-type="conf-proc"><person-group person-group-type="author"><string-name><given-names>S.</given-names> <surname>Wang</surname></string-name> and <string-name><given-names>W.</given-names> <surname>Xu</surname></string-name></person-group>, &#x201C;<article-title>Session-based fraud detection in online e-commerce transactions using recurrent neural networks</article-title>,&#x201D; in <conf-name>European Conf. on Machine Learning and Knowledge Discovery in Databases</conf-name>, <conf-loc>China</conf-loc>, pp. <fpage>241</fpage>&#x2013;<lpage>252</lpage>, <year>2019</year>.</mixed-citation></ref>
<ref id="ref-19"><label>[19]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>V.</given-names> <surname>Nipane</surname></string-name>, <string-name><given-names>P.</given-names> <surname>Kalinge</surname></string-name>, <string-name><given-names>S.</given-names> <surname>Vidhate</surname></string-name> and <string-name><given-names>B.</given-names> <surname>Deshpande</surname></string-name></person-group>, &#x201C;<article-title>Fraudulent detection in credit card system using SVM &#x0026; decision tree</article-title>,&#x201D; <source>International Journal of Scientific Development and Research</source>, vol. <volume>1</volume>, no. <issue>5</issue>, pp. <fpage>590</fpage>&#x2013;<lpage>594</lpage>, <year>2019</year>.</mixed-citation></ref>
<ref id="ref-20"><label>[20]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>R.</given-names> <surname>Cheng</surname></string-name> and <string-name><given-names>Y.</given-names> <surname>Jin</surname></string-name></person-group>, &#x201C;<article-title>A competitive swarm optimizer for large scale optimization</article-title>,&#x201D; <source>IEEE Transactions on Cybernetics</source>, vol. <volume>45</volume>, no. <issue>2</issue>, pp. <fpage>191</fpage>&#x2013;<lpage>204</lpage>, <year>2020</year>.</mixed-citation></ref>
</ref-list>
</back>
</article>