An improved differential evolution algorithm for quantifying fraudulent transactions

被引:2
作者
Rakesh, Deepak Kumar [1 ]
Jana, Prasanta K. [1 ]
机构
[1] Indian Inst Technol Indian Sch Mines, Dhanbad, India
关键词
Quantifying fraudulent transactions (QFT); Cost -based feature selection; Multiobjective optimization; Differential evolution; FEATURE-SELECTION; MUTUAL INFORMATION; GENETIC ALGORITHM; CLASSIFICATION; ENSEMBLE;
D O I
10.1016/j.patcog.2023.109623
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Identification of fraudulent credit card transactions is a complex problem mainly due to the following factors: 1) The relative behavior of customers and fraudsters may alter over time. 2) The ratio of legitimate to fraudulent transactions is highly imbalanced, and 3) Investigators examine a small segment of transactions in a reasonable time frame. Researchers have proposed various algorithms to identify potential fraud in a new incoming transaction. However, these approaches require significant human investigator effort and are sometimes misleading. To address this issue, this paper proposes an improved multiobjective differential evolution (DE) algorithm to estimate the distribution of fraudulent transactions in a set of new incoming transactions, referred to as quantifying fraudulent transactions. Our paper has three major novelties. First, we present the problem formulation of cost-based feature selection with maximum quantification ability. Second, we improve the DE by applying effective trial vector generation algorithms to the random control parameter settings to exploit the advantage of individual DE variants. Third, we develop the maximum-relevancy-minimum-redundancy-based Pareto refining operator to enhance the self-learning ability of individuals in Pareto solutions. We compare our approach against four other modifications of DE and five state-of-the-art evolutionary algorithms on real-time credit datasets in streaming and non-streaming frameworks using hyper-volume, two-set coverage, and spread performance metrics. (c) 2023 Elsevier Ltd. All rights reserved.
引用
收藏
页数:14
相关论文
共 50 条
  • [21] Multi-search differential evolution algorithm
    Li, Xiangtao
    Ma, Shijing
    Hu, Jiehua
    APPLIED INTELLIGENCE, 2017, 47 (01) : 231 - 256
  • [22] An Improved Adaptive Differential Evolution Algorithm with Population Adaptation
    Yang, Ming
    Cai, Zhihua
    Li, Changhe
    Guan, Jing
    GECCO'13: PROCEEDINGS OF THE 2013 GENETIC AND EVOLUTIONARY COMPUTATION CONFERENCE, 2013, : 145 - 152
  • [23] An improved differential evolution algorithm for artificial neural networks
    Li, Wei
    Yu, Lei
    PROCEEDINGS OF THE 30TH CHINESE CONTROL AND DECISION CONFERENCE (2018 CCDC), 2018, : 3767 - 3770
  • [24] Improved Multi-operator Differential Evolution Algorithm for Solving Unconstrained Problems
    Sallam, Karam M.
    Elsayed, Saber M.
    Chakrabortty, Ripon K.
    Ryan, Michael J.
    2020 IEEE CONGRESS ON EVOLUTIONARY COMPUTATION (CEC), 2020,
  • [26] Fuzzy kernel feature selection with multi-objective differential evolution algorithm
    Hancer, Emrah
    CONNECTION SCIENCE, 2019, 31 (04) : 323 - 341
  • [27] Detecting Fraudulent Transactions Using Stacked Autoencoder Kernel ELM Optimized by the Dandelion Algorithm
    El Hlouli, Fatima Zohra
    Riffi, Jamal
    Sayyouri, Mhamed
    Mahraz, Mohamed Adnane
    Yahyaouy, Ali
    El Fazazy, Khalid
    Tairi, Hamid
    JOURNAL OF THEORETICAL AND APPLIED ELECTRONIC COMMERCE RESEARCH, 2023, 18 (04): : 2057 - 2076
  • [28] Rethinking the differential evolution algorithm
    Hongwei Liu
    Xiang Li
    Wenyin Gong
    Service Oriented Computing and Applications, 2020, 14 : 79 - 87
  • [29] Rethinking the differential evolution algorithm
    Liu, Hongwei
    Li, Xiang
    Gong, Wenyin
    SERVICE ORIENTED COMPUTING AND APPLICATIONS, 2020, 14 (02) : 79 - 87
  • [30] An Improved Differential Evolution Algorithm for Mixed Integer Programming Problems
    Wu Jun
    Gao Yuelin
    Yan Lina
    2013 9TH INTERNATIONAL CONFERENCE ON COMPUTATIONAL INTELLIGENCE AND SECURITY (CIS), 2013, : 31 - 35