ARMS: Automated rules management system for fraud detection

• URL: http://arxiv.org/abs/2002.06075v1
• Date: Fri, 14 Feb 2020 15:29:59 GMT
• Title: ARMS: Automated rules management system for fraud detection
• Authors: David Apar\'icio, Ricardo Barata, Jo\~ao Bravo, Jo\~ao Tiago Ascens\~ao, Pedro Bizarro
• Abstract summary: We address online fraud detection, which consists of classifying incoming transactions as either legitimate or fraudulent in real-time. Modern fraud detection systems consist of a machine learning model and rules defined by human experts. We propose ARMS, an automated rules management system that evaluates the contribution of individual rules and optimize the set of active rules using search and a user-defined loss-function.
• Score: 1.7499351967216341
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Fraud detection is essential in financial services, with the potential of greatly reducing criminal activities and saving considerable resources for businesses and customers. We address online fraud detection, which consists of classifying incoming transactions as either legitimate or fraudulent in real-time. Modern fraud detection systems consist of a machine learning model and rules defined by human experts. Often, the rules performance degrades over time due to concept drift, especially of adversarial nature. Furthermore, they can be costly to maintain, either because they are computationally expensive or because they send transactions for manual review. We propose ARMS, an automated rules management system that evaluates the contribution of individual rules and optimizes the set of active rules using heuristic search and a user-defined loss-function. It complies with critical domain-specific requirements, such as handling different actions (e.g., accept, alert, and decline), priorities, blacklists, and large datasets (i.e., hundreds of rules and millions of transactions). We use ARMS to optimize the rule-based systems of two real-world clients. Results show that it can maintain the original systems' performance (e.g., recall, or false-positive rate) using only a fraction of the original rules (~ 50% in one case, and ~ 20% in the other).

Related papers

• RIFF: Inducing Rules for Fraud Detection from Decision Trees [5.640162873635426]
  We propose RIFF, a rule induction algorithm that distills a low false positive rate rule set directly from decision trees. Our experiments show that the induced rules are often able to maintain or improve performance of the original models for low FPR tasks.
  arXiv  Detail & Related papers  (2024-08-23T11:14:20Z)
• Online Corrupted User Detection and Regret Minimization [49.536254494829436]
  In real-world online web systems, multiple users usually arrive sequentially into the system. We present an important online learning problem named LOCUD to learn and utilize unknown user relations from disrupted behaviors. We devise a novel online detection algorithm OCCUD based on RCLUB-WCU's inferred user relations.
  arXiv  Detail & Related papers  (2023-10-07T10:20:26Z)
• Transaction Fraud Detection via an Adaptive Graph Neural Network [64.9428588496749]
  We propose an Adaptive Sampling and Aggregation-based Graph Neural Network (ASA-GNN) that learns discriminative representations to improve the performance of transaction fraud detection. A neighbor sampling strategy is performed to filter noisy nodes and supplement information for fraudulent nodes. Experiments on three real financial datasets demonstrate that the proposed method ASA-GNN outperforms state-of-the-art ones.
  arXiv  Detail & Related papers  (2023-07-11T07:48:39Z)
• Tight Auditing of Differentially Private Machine Learning [77.38590306275877]
  For private machine learning, existing auditing mechanisms are tight. They only give tight estimates under implausible worst-case assumptions. We design an improved auditing scheme that yields tight privacy estimates for natural (not adversarially crafted) datasets.
  arXiv  Detail & Related papers  (2023-02-15T21:40:33Z)
• Towards Target Sequential Rules [52.4562332499155]
  We propose an efficient algorithm, called targeted sequential rule mining (TaSRM) It is shown that the novel algorithm TaSRM and its variants can achieve better experimental performance compared to the existing baseline algorithm.
  arXiv  Detail & Related papers  (2022-06-09T18:59:54Z)
• Anti-Money Laundering Alert Optimization Using Machine Learning with Graphs [0.769672852567215]
  Money laundering is a global problem that concerns legitimizing proceeds from serious felonies (1.7-4 trillion euros annually) We propose a machine learning triage model, which complements the rule-based system and learns to predict the risk of an alert accurately. We validate our model on a real-world banking dataset and show how the triage model can reduce the number of false positives by 80% while detecting over 90% of true positives.
  arXiv  Detail & Related papers  (2021-12-14T16:12:30Z)
• Application of Deep Reinforcement Learning to Payment Fraud [0.0]
  A typical fraud detection system employs standard supervised learning methods where the focus is on maximizing the fraud recall rate. We argue that such a formulation can lead to suboptimal solutions. We formulate fraud detection as a sequential decision-making problem by including the utility within the model in the form of the reward function.
  arXiv  Detail & Related papers  (2021-12-08T11:30:53Z)
• A Time-Frequency based Suspicious Activity Detection for Anti-Money Laundering [0.0]
  Money laundering is the crucial mechanism utilized by criminals to inject proceeds of crime to the financial system. Most of the current systems in these institutions are rule-based and ineffective. This article introduces a novel feature set based on time-frequency analysis, that makes use of 2-D representations of financial transactions.
  arXiv  Detail & Related papers  (2020-11-17T08:01:50Z)
• Deep Q-Network-based Adaptive Alert Threshold Selection Policy for Payment Fraud Systems in Retail Banking [9.13755431537592]
  We propose an enhanced threshold selection policy for fraud alert systems. The proposed approach formulates the threshold selection as a sequential decision making problem and uses Deep Q-Network based reinforcement learning. Experimental results show that this adaptive approach outperforms the current static solutions by reducing the fraud losses as well as improving the operational efficiency of the alert system.
  arXiv  Detail & Related papers  (2020-10-21T15:10:57Z)
• DFraud3- Multi-Component Fraud Detection freeof Cold-start [50.779498955162644]
  The Cold-start is a significant problem referring to the failure of a detection system to recognize the authenticity of a new user. In this paper, we model a review system as a Heterogeneous InformationNetwork (HIN) which enables a unique representation to every component. HIN with graph induction helps to address the camouflage issue (fraudsterswith genuine reviews) which has shown to be more severe when it is coupled with cold-start, i.e., new fraudsters with genuine first reviews.
  arXiv  Detail & Related papers  (2020-06-10T08:20:13Z)
• Toward Optimal Adversarial Policies in the Multiplicative Learning System with a Malicious Expert [87.12201611818698]
  We consider a learning system that combines experts' advice to predict a sequence of true outcomes. It is assumed that one of the experts is malicious and aims to impose the maximum loss on the system. We show that a simple greedy policy of always reporting false prediction is optimal with an approximation ratio of $1+O(sqrtfracln NN)$. For the online setting where the malicious expert can adaptively make its decisions, we show that the optimal online policy can be efficiently computed by solving a dynamic program in $O(N3)$.
  arXiv  Detail & Related papers  (2020-01-02T18:04:46Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.