Adaptive Financial Fraud Detection in Imbalanced Data with Time-Varying Poisson Processes ()

Régis Houssou^{1}, Jérôme Bovay^{2}, Stephan Robert^{1}

^{1}School of Management and Engineering Vaud (HEIG-VD), Yverdon-les-Bains, Switzerland.

^{2}NetGuardians SA, Yverdon-les-Bains, Switzerland.

**DOI: **10.4236/jfrm.2019.84020
PDF
HTML XML
771
Downloads
2,215
Views
Citations

This paper discusses financial fraud detection in imbalanced dataset using homogeneous and non-homogeneous Poisson processes. The probability of predicting fraud on the financial transaction is derived. Applying our methodology to financial datasets with different fraud profiles shows a better predicting power than a baseline approach, especially in the case of higher imbalanced data.

Keywords

Homogeneous Poisson Process, Inhomogeneous Poisson Process, Intensity Model, Fraud Detection, Imbalanced Data

Share and Cite:

Houssou, R. , Bovay, J. and Robert, S. (2019) Adaptive Financial Fraud Detection in Imbalanced Data with Time-Varying Poisson Processes. *Journal of Financial Risk Management*, **8**, 286-304. doi: 10.4236/jfrm.2019.84020.

1. Introduction

Financial fraud is growing exponentially, especially because of the large sums involved. McAfee estimates in 2018 that cybercrime, of which financial fraud is a factor, costs the world about US$600 billion, or 0.8% of global GDP. According to McKinsey, global losses due to card fraud could reach nearly US$44 billion by 2025. In addition to the direct cost of fraud, companies also suffer from lost sales when real transactions are denied by the companies. McKinsey estimates that false positives account for up to 25% of transactions denied by online retailers, see Dyzma (2018). However, as a first step, banks and financial institutions have approached the detection of fraud using manual procedures or rule-based solutions, which have yielded good results, but these methods currently have limitations. The rule-based approach means that a complex set of requirements for suspicious transaction reporting must be defined and reviewed manually. While this may be effective in detecting anomalies consistent with known patterns, it does not detect frauds that follow new or unknown patterns. The increasing complexity of digital attacks and the creativity of cyber-attackers make these conventional detection methods less effective and quickly obsolete. More sophisticated techniques must be developed, including automatic learning algorithms, and evolve the detection of fraud towards methods using adaptive rules to tighten the mesh of the network.

The machine learning models work with many parameters and are much more efficient at finding subtle correlations in the data, which can be masked by an expert system or by human criticism, Dyzma (2018). The large volume of transactional data and client data readily available in the financial services industry makes it an ideal tool for the application of complex machine learning algorithms. In addition to learning from known models, machine learning can go further and learn new models without human operation. This allows models to adapt over time to discover previously unknown patterns or to identify new tactics that can be used by fraudsters. In fact, the development of conventional machine learning algorithms has led them to solve some specific problems, one of the most important features of which is that the distribution of data is generally balanced, unlike financial fraud, which is not balanced. Most standard classifiers such as decision trees and neural networks assume that learning samples are evenly distributed among different classes. However, in many real-world applications, the ratio of the minority class is very small (1:100, 1:1000 or can be exceeded at 1:10000). Due to the lack of data, few samples of the minority learning class tend to be falsely detected by the classifiers and the decision limit is therefore far from correct. Numerous research works in machine learning have been proposed to solve the problem of data imbalance; He and Garcia (2009), Galar et al. (2012), Krawczyk (2016), Elrahman and Abraham (2013), etc. However, most of these algorithms suffer from certain limitations in real-world applications, such as the loss of usual information, classification cost, excessive time, and adjustments, see Elrahman and Abraham (2013).

In this paper, we address the problem of fraud detection in imbalanced data using the Poisson process; fraud is defined as a rare event occurring at a random time and involving significant financial losses. In this context, the fraud times are defined as the jump times of the Poisson process with intensity that describes the instantaneous rate of fraud. Unlike machine learning methods, we do not look inside the subtle correlations in the data; instead, we assume that an exogenous rate or intensity must be determined. Instead of asking why the fraud is committed, the fraud rate is calibrated using market data. A lot of research has been done on the application of the Poisson process to financial risks, see Artzner and Delbaen (1995), Jarrow and Turnbull (1995), Duffie and Singleton (1999), etc. For calibration purposes, we assume that intensity is a deterministic function of time that takes into account the homogeneous and inhomogeneous Poisson process. Three main inputs are needed to estimate the intensity: the deterministic form of the intensity function, the arrival times of the frauds and the labels.

The rest of the paper is organized as follows. Section II defines the mathematical concepts of Poisson process; the homogeneous and the Inhomogeneous Poisson process are reviewed. The estimation of the intensity and the prediction of fraud events are discussed. In section III, the model is applied to financial datasets and the results are presented. The dataset was provided by NetGuardians^{1}, a swiss company which develops solutions for banks to proactively prevent fraud.

2. Mathematical Concepts of Poisson Process

2.1. Fraud Event

Consider a financial institution such as a bank, an insurance company, a trading company, etc. and information about its clients. We are interested in the occurrence of fraud in client transactions for such an institution. The fraud event is then defined as a rare event occurring at a random time and resulting in significant financial losses for the client and the financial institution. Whatever the definition used for a fraudulent event, let us note the fraud time by $\tau $ which corresponds to $\left[\mathrm{0,}\infty \right]$ value of random variable on the filtered probability space $\left(\Omega \mathrm{,}\mathcal{F}\mathrm{,}\mathbb{F}\mathrm{,}\mathbb{P}\right)$. $\Omega $ denotes the possible states of the world, $\mathcal{F}$ is the $\sigma $ -algebra, $\mathbb{F}={\left({\mathcal{F}}_{t}\right)}_{t\ge 0}$ is the filtration with ${\mathcal{F}}_{t}$ contains all information up to time t and ${\mathcal{F}}_{T}=\mathcal{F}$. $\mathbb{P}$ is the probability measure describing the likelihood of certain events. The only mathematical structure assumed for $\tau $ is that it should be a stopping time, that is a random variable $\tau \mathrm{:}\Omega \to {\mathbb{R}}_{+}\cup \left\{\infty \right\}$, such that $\left\{\tau \le t\right\}\in {\mathcal{F}}_{t}$ for $t\ge 0$. Intuitively, one can determine whether or not the fraud time occurs before a certain deterministic time by observing the past up to time t, which is encoded in the filtration ( ${\mathcal{F}}_{t}$ ).

Now consider a sequence ${\left({\tau}_{n}\right)}_{n\ge 0}$ of fraud times and let $N=\left\{N\left(t\right)\mathrm{;}t\ge 0\right\}$ be a counting process given by

$N\left(t\right)={\displaystyle \underset{n\ge 0}{\sum}{1}_{\left\{{\tau}_{n}\le t\right\}}}$. (1)

In other words, $N\left(t\right)$ counts the number of fraud events between 0 and t. N has the following properties: 1) $N\left(t\right)\ge 0$ ; 2) $N\left(t\right)$ is an integer; 3) For $s\le t$, $N\left(s\right)\le N\left(t\right)$. The last property implies that N is a submartingale since $E\left(N\left(t\right)\mathrm{|}{\mathcal{F}}_{s}\right)\ge N\left(s\right)$. Because of the last property, the Doob-Meyer theorem guarantees the existence of an increasing predictable process A called compensator starting at 0 such that $M=N-A$ is a martingale. The compensator A is uniquely defined up and governs the distribution of N. We assume that the compensator A is absolutely continuous w.r.t. Lebesgue measure such that there is a non-negative, integrable and predictable intensity process $\lambda $ that satisfies

$A\left(t\right)={\displaystyle {\int}_{0}^{t}}\text{\hspace{0.05em}}\lambda \left(s\right)\text{d}s$. (2)

The process $\lambda $ represents the conditionally expected number of events per unit of time in the sense that, at any time t, the ${\mathcal{F}}_{t-}$ conditional probability of an event between t and $t+h$ is approximatively $\lambda \left(t\right)h$ for small h, where ${\mathcal{F}}_{t-}$ contains all information just before time t. In fact, because N has the predictable intensity process $\lambda $, $dN\left(t\right)-\lambda \left(t\right)h$ is a martingale increment, and heuristically we thus have

$E\left(dN\left(t\right)-\lambda \left(t\right)h\mathrm{|}{\mathcal{F}}_{t-}\right)=0$. (3)

Since $\lambda $ is predictable, $\lambda \left(t\right)\in {\mathcal{F}}_{t-}$ so we can move $\lambda \left(t\right)h$ outside the expectation and obtain

$E\left(dN\left(t\right)\mathrm{|}{\mathcal{F}}_{t-}\right)=\lambda \left(t\right)h$, (4)

and

$E\left(N\left(t+h\right)-N\left(t\right)\mathrm{|}{\mathcal{F}}_{t-}\right)=\lambda \left(t\right)h$, (5)

For more details see Reiss (1993) and Fleming and Harrington (2005).

In the rest of this paper, we will focus on the counting process with a deterministic intensity that gives rise to homogeneous and inhomogeneous Poisson process. In this context, the likelihood of fraud events will be derived and implemented.

2.2. Homogeneous Poisson Process

The Homogeneous Poisson Process (HPP) is a fundamental stochastic process which is simple, easy to understand and possesses desirable mathematical and theoretical properties making it easy to handle. It can be easily extended to more complicated and realistic situations Kingman (1993). Let $N={\left(N\left(t\right)\right)}_{t\ge 0}$ be the counting process defined above i.e. for each $t>0$ which counts the number of fraud events that happen between time 0 and time t. In order to have an overview of the Poisson process, let’s consider three definitions of the Poisson process that are equivalent to each other. For the proof see Ross (2010) and Drazek (2013).

Definition 2.1. N is an HPP with constant intensity $\lambda \ge 0$ if:

1) $N\left(0\right)=0$ ;

2) The process has stationary and independent increments;

3) For small h, $P\left(N\left(t+h\right)-N\left(t\right)=1\right)=\lambda h+o\left(h\right)$ ;

4) $P\left(N\left(t+h\right)-N\left(t\right)\ge 2\right)=o\left(h\right)$.

Definition 2.2. N is an HPP with constant intensity $\lambda \ge 0$ if:

1) $N\left(0\right)=0$ ;

2) The process has stationary and independent increments;

3) For $0\le s<t$, $N\left(t\right)-N\left(s\right)$ is Poisson distributed with parameter $\lambda \left(t-s\right)$.

That is,

$P\left(N\left(t\right)-N\left(s\right)=k\right)=\frac{{\text{e}}^{-\lambda \left(t-s\right)}{\left(\lambda \left(t-s\right)\right)}^{k}}{k!}$ (6)

For any interval for size t, $\lambda t$ is the expected number of frauds in that interval.

Definition 2.3. N is HPP with constant intensity $\lambda \ge 0$ if the waiting times between successive events, or arrivals follow an exponential distribution of parameter $\lambda $.

This definition made the Poisson process unique among renewal process by the memoryless of the Exponential distribution.

Estimation of the Constant Intensity λ for Homogeneous Poisson Process

The simple and trivial way for estimating the constant intensity $\lambda $ is to use the above third definition of the HPP related to the Exponential distribution of the waiting times.

Let $N={\left(N\left(t\right)\right)}_{t\ge 0}$ an homogeneous Poisson process of parameter $\lambda $ and ${\left({\tau}_{n}\right)}_{n\ge 0}$ a sequence of fraud times. We define ${S}_{n}={\tau}_{n}-{\tau}_{n-1}$, the waiting times between the event $n-1$ and the event n with ${S}_{1}={\tau}_{1}$. Because ${\left({S}_{n}\right)}_{n\ge 0}$ follows the exponential distribution of parameter $\lambda $,

$E\left({S}_{n}\right)=\frac{1}{\lambda}$. (7)

Let $\stackrel{\xaf}{S}$ an estimator of $E\left({S}_{n}\right)$ ; using the moment method, the estimator $\stackrel{\xaf}{\lambda}$ of $\lambda $ is given by

$\stackrel{\xaf}{\lambda}=\frac{1}{\stackrel{\xaf}{S}}$, (8)

which is also the Maximum Likelihood Estimator (MLE) of $\lambda $.

In the next section, we consider a time-varying intensity which conducts to Non-Homogeneous Poisson Process.

2.3. Non-Homogeneous Poisson Process

Non-Homogeneous Poisson Process (NHPP) means that the intensity $\lambda \left(t\right)$ is deterministic function. Thus, the distribution of the number of events between two particular points on the timeline is no longer a function depending on the difference between these points, as in the case of a Homogeneous Poisson Process (HPP). Here it is a function of the starting-point and the end-point of the time interval and is not necessarily stationary. Let’s start with the definition of the NHPP given in Ross (2010).

Definition 2.4. The counting process $N={\left(N\left(t\right)\right)}_{t\ge 0}$ is said to be a NHPP with intensity function $\lambda \left(t\right)$, $t\ge 0$, if it satisfies,

1) $N\left(0\right)=0$ ;

2) N has independent increments;

3) for small h, $P\left(N\left(t+h\right)-N\left(t\right)=1\right)=\lambda \left(t\right)h+o\left(h\right)$ ;

4) $P\left(N\left(t+h\right)-N\left(t\right)\ge 2\right)=o\left(h\right)$.

The function $\lambda \left(t\right)$ is sometimes called the instantaneous arrival rate of the NHPP.

A consequence of the above definition is that $N\left(t\right)-N\left(s\right)$ follows Poisson distribution of parameter ${\int}_{s}^{t}}\text{\hspace{0.05em}}\lambda \left(u\right)\text{d}u$. That is,

$P\left(N\left(t\right)-N\left(s\right)=k\right)=\frac{{\text{e}}^{-{\displaystyle {\int}_{s}^{t}}\text{\hspace{0.05em}}\lambda \left(u\right)\text{d}u}{\left({\displaystyle {\int}_{s}^{t}}\text{\hspace{0.05em}}\lambda \left(u\right)\text{d}u\right)}^{k}}{k!}$. (9)

We can explore the relationship between the average number of events occurring up to the time t and the intensity function $\lambda \left(t\right)$ of the corresponding NHPP:

$E\left(N\left(t\right)\right)={\displaystyle {\int}_{0}^{t}}\text{\hspace{0.05em}}\lambda \left(s\right)\text{d}s=A\left(t\right)$. (10)

As described above, the compensator $A\left(t\right)$ is a non-decreasing right-continuous function and is referred here as the expectation function of the NHPP.

In addition, the expected number of events between times t and $t+s$ is expressed as

$E\left(N\left(t+s\right)-N\left(t\right)\right)={\displaystyle {\int}_{t}^{t+s}}\lambda \left(u\right)\text{d}u=A\left(t+s\right)-A\left(t\right)$. (11)

According to Cox & Lewis (1966), we can examine the distribution function of the time to the next event in NHPP by

$P\left(1\text{\hspace{0.17em}}\text{or}\text{\hspace{0.17em}}\text{more}\text{\hspace{0.17em}}\text{events}\text{\hspace{0.17em}}\text{occurred}\text{\hspace{0.17em}}\text{in}\text{\hspace{0.17em}}\left(t\mathrm{,}t+s\right]\right)=1-{\text{e}}^{-{\displaystyle {\int}_{t}^{t+s}}\lambda \left(u\right)\text{d}u}\mathrm{=1}-{\text{e}}^{-\left(A\left(t+s\right)-A\left(t\right)\right)}$. (12)

Let ${t}_{s}=t+s$, the probability density function of the time to the next event, which can be obtained by deriving the expression in (12) with respect to ${t}_{s}$

$\frac{d}{{t}_{s}}P\left(1\text{\hspace{0.17em}}\text{or}\text{\hspace{0.17em}}\text{more}\text{\hspace{0.17em}}\text{events}\text{\hspace{0.17em}}\text{occurred}\text{\hspace{0.17em}}\text{in}\text{\hspace{0.17em}}\left(t,{t}_{s}\right]\right)=\lambda \left({t}_{s}\right){\text{e}}^{-\left(A\left({t}_{s}\right)-A\left(t\right)\right)}$. (13)

As we will see later, this expression (13) is very useful in estimating of the intensity.

Estimation of the Intensity $\lambda \left(t\right)$ for Non-Homogeneous Poisson Process

There is a substantial history of statistical inference for Non-Homogeneous Poisson process; see Basawa and Rao (1980), Brown (1972), Ross (1996), etc. Suppose we have data from a non-homogeneous Poisson process $N={\left(N\left(t\right)\right)}_{t\ge 0}$ and we are looking for the intensity function that caused it. The first step is to define the form of the intensity $\lambda \left(t\right)$ ; we limit ourselves to the case of parametric intensity. In the second step, given the probability density function defined in (13) we can use the principle of Maximum Likelihood Estimate (MLE) to find the intensity parameter $\lambda $ maximizing the likelihood that a fraud will occur. The procedure is the following:

Suppose the n events occur at ${\tau}_{1}<{\tau}_{2}<\cdots <{\tau}_{n}$ in the interval $\left(\mathrm{0,}T\right]$. Since the n events are independent and using (13), the desired joint probability density takes the form

$\begin{array}{l}\lambda \left({\tau}_{1}\right){\text{e}}^{-\left(A\left({\tau}_{1}\right)-A\left(0\right)\right)}\cdot \lambda \left({\tau}_{2}\right){\text{e}}^{-\left(A\left({\tau}_{2}\right)-A\left({\tau}_{1}\right)\right)}\cdots \lambda \left({\tau}_{n}\right){\text{e}}^{-\left(A\left({\tau}_{n}\right)-A\left({\tau}_{n-1}\right)\right)}\\ \text{\hspace{0.05em}}\cdot P\left(N\left(T\right)-N\left({\tau}_{n}\right)=0\right)\end{array}$,

where

$P\left(N\left(T\right)-N\left({\tau}_{n}\right)=0\right)$ is the probability of no event occurs in the interval $\left({\tau}_{n}\mathrm{,}T\right]$. It is calculated as follows:

$P\left(N\left(T\right)-N\left({\tau}_{n}\right)=0\right)={\text{e}}^{-\left(A\left(T\right)-A\left({\tau}_{n}\right)\right)}$.

The likelihood of getting $\tau ={\tau}_{1},{\tau}_{2},\cdots ,{\tau}_{n}$ is then

$L\left(\lambda ;\tau ={\tau}_{1},{\tau}_{2},\cdots ,{\tau}_{n}\right)={\text{e}}^{-A\left(T\right)}{\displaystyle \underset{i=1}{\overset{n}{\prod}}}\lambda \left({\tau}_{i}\right)$.

The Log-Likelihood is:

$l\left(\lambda ;\tau ={\tau}_{1},{\tau}_{2},\cdots ,{\tau}_{n}\right)=-A\left(T\right)+{\displaystyle \underset{i=1}{\overset{n}{\sum}}}\mathrm{log}\left(\lambda \left({\tau}_{i}\right)\right)$ (14)

$=-{\displaystyle {\int}_{0}^{T}}\lambda \left(s\right)\text{d}s+{\displaystyle \underset{i=1}{\overset{n}{\sum}}}\mathrm{log}\left(\lambda \left({\tau}_{i}\right)\right)$. (15)

For more details about the derivation of (15), see Ross (1996).

The intensity estimate consists of finding the parameters of the intensity $\lambda \left(t\right)$ maximizing the Log-likelihood function defined in (15). This estimated intensity is then used to predict the fraud event on the next transaction ( $T+1$ ) based on the information available up to the time of the transaction T.

2.4. Prediction of Fraud Event

Consider the filtration ${\mathcal{F}}_{T}$ that contains the information about the fraud events up to time T. Suppose a new transaction is in progress at time ${T}_{\delta}$ ( ${T}_{\delta}>T$ ) and we would like to know if this transaction is fraudulent or not.

Proposition 1. The probability that a fraud occurs at time ${T}_{\delta}$ is given by

$P\left(\text{a}\text{\hspace{0.17em}}\text{fraud}\text{\hspace{0.17em}}\text{occurs}\text{\hspace{0.17em}}\text{at}\text{\hspace{0.17em}}{T}_{\delta}\right)=1-{\text{e}}^{-\left(A\left({T}_{\delta}\right)-A\left(T\right)\right)}$, (16)

where

$A\left(T\right)={\displaystyle {\int}_{0}^{T}}\lambda \left(s\right)\text{d}s$.

Proof. Following (12)

$\begin{array}{c}P\left(\text{a}\text{\hspace{0.17em}}\text{fraud}\text{\hspace{0.17em}}\text{occurs}\text{\hspace{0.17em}}\text{at}\text{\hspace{0.05em}}\text{\hspace{0.05em}}{T}_{\delta}\right)=1-P\left(\text{a}\text{\hspace{0.17em}}\text{fraud}\text{\hspace{0.17em}}\text{does}\text{\hspace{0.17em}}\text{not}\text{\hspace{0.17em}}\text{occur}\text{\hspace{0.17em}}\text{at}\text{\hspace{0.17em}}{T}_{\delta}\right)\\ =1-P\left(N\left({T}_{\delta}\right)-N\left(T\right)=0|{\mathcal{F}}_{T}\right)\\ =1-{\text{e}}^{-{\displaystyle {\int}_{T}^{{T}_{\delta}}}\lambda \left(u\right)\text{d}u}\\ =1-{\text{e}}^{-\left(A\left({T}_{\delta}\right)-A\left(T\right)\right)}\end{array}$ $\square $

In the special case of homogeneous Poisson process, that is for constant $\lambda $.

$P\left(\text{a}\text{\hspace{0.17em}}\text{fraud}\text{\hspace{0.17em}}\text{occurs}\text{\hspace{0.17em}}\text{at}\text{\hspace{0.17em}}{T}_{\delta}\right)=1-{\text{e}}^{-\lambda \left({T}_{\delta}-T\right)}$. (17)

We observe that in the case of homogeneous Poisson process, the probability of fraud is a function of parameter $\lambda $ and the elapsed time ( ${T}_{\delta}-T$ ) between the two transactions. For the Inhomogeneous Poisson, it is actually a function of the difference between the compensator $A\left({T}_{\delta}\right)$ and $A\left(T\right)$.

Following (16): as $\left({T}_{\delta}-T\right)\to \infty $, $\left(A\left({T}_{\delta}\right)-A\left(T\right)\right)\to \infty $ and then the $P\left(\text{the}\text{\hspace{0.17em}}\text{fraud}\text{\hspace{0.17em}}\text{occurs}\text{\hspace{0.17em}}\text{at}\text{\hspace{0.05em}}\text{\hspace{0.05em}}{T}_{\delta}\right)\to 1$. On another side, as $\left({T}_{\delta}-T\right)\to 0$, $\left(A\left({T}_{\delta}\right)-A\left(T\right)\right)\to 0$ and then the $P\left(\text{the}\text{\hspace{0.17em}}\text{fraud}\text{\hspace{0.17em}}\text{occurs}\text{\hspace{0.17em}}\text{at}\text{\hspace{0.05em}}\text{\hspace{0.05em}}{T}_{\delta}\right)\to 0$.

Therefore, when the time between two transactions is large, it is very likely that the model generates a fraud alert. On the other hand, when two transactions are close, the model will not generate a fraud alert. This consequence could reduce the predictive power of the model when there is a succession of fraud events in record time.

3. Application to Financial Dataset

3.1. Choice of Deterministic Intensity Functions

To apply the Poisson process to the dataset, the shape of the intensity function must be defined. Three classes of intensity functions are proposed. For each class of function $\lambda \left(t\right)$, we set the conditions for $\lambda \left(t\right)\ge 0$.

1) $\lambda \left(t\right)=\lambda $ : this is the case of Homogeneous Poisson process and $\lambda $ must be greater than 0. $\lambda $ is estimated following § 2.2.1.

2) $\lambda \left(t\right)=a+bt$ : the intensity is assumed to be a linear function of time. To ensure $\lambda \left(t\right)\ge 0$ for $0\le t\le T$, we impose as in Massey et al. (1996) the conditions

$\{\begin{array}{l}a\ge 0\hfill \\ b+\frac{a}{T}\ge 0\hfill \end{array}$. (18)

Proof. We want $\lambda \left(t\right)=a+bt\ge 0$ for $0\le t\le T$.

If $t=0$ :

$\lambda \left(t\right)=a,\lambda \left(t\right)\ge 0\Rightarrow a\ge 0$.

If $\mathrm{0<}t\le T$ :

$a+bt\ge 0\iff b\ge -\frac{a}{t}$.

We also know that $-\frac{a}{t}\le -\frac{a}{T}$ since $a\ge 0$. In order to have $b\ge -\frac{a}{t}$, it is sufficient that $b\ge -\frac{a}{T}\iff b+\frac{a}{T}\ge 0$. So, the conditions are $a\ge 0$ and $b+\frac{a}{T}\ge 0$.

$\square $

If $T\to \infty $, we obtain the trivial condition

$\{\begin{array}{l}a\ge 0\hfill \\ b\ge 0\hfill \end{array}$.

Therefore, when we consider a short period to estimate the intensity parameters, the feasible region of (18) expands to find the optimal solution. Figure 1 shows an example of feasible regions for different values of T. For the sake of readability, $0\le a\le 10$ and $-100\le b\le 100$. We observe that when T becomes larger, the feasible region is reduced to the trivial region.

3) $\lambda \left(t\right)=a+bt+c{t}^{2}$ : the intensity is a quadratic function as a function of time. To ensure $\lambda \left(t\right)\ge 0$ for $0\le t\le T$, we impose the conditions

$\{\begin{array}{l}a\ge 0\hfill \\ c\ge 0\hfill \\ b+\frac{a}{T}\ge 0\hfill \end{array}$. (19)

(a)(b)(c)

Figure 1. (a) Example of feasible region for $\lambda \left(t\right)=a+bt\ge 0$ when $T=0.02$ : solution is in (18). The region is shown for $0\le a\le 10$ and $-100\le b\le 100$. (b) as for (a) but $T=0.2$. (c) as for (a) but $T=20$.

The proof is similar to the above. Also, when when $T\to \infty $, (19) is reduced to:

$\{\begin{array}{l}a\ge 0\hfill \\ b\ge 0\hfill \\ c\ge 0\hfill \end{array}$.

The conditions (18) and (19) are the constraints of the optimization problem in (15) for the Inhomogeneous Poisson process.

3.2. Data

The datasets provided by NetGuardians^{2} consist of two years of transactions for clients of a financial institution. It covers the period from 09-2015 to 09-2017 and includes a total of 18,139,078 transactions made by 124,177 clients. For confidentiality reasons, the name of the financial institution will not be mentioned. The dataset includes a total of 49 features such as transaction dates, transactions amounts, transaction senders IDs, transaction recipients account numbers, banking countries, etc. To be able to train a Poisson process algorithm, labelled data with examples of fraud are needed. All transactions in the dataset are labeled as fraudulent or not. Since the ground truth is not available, the labeling is based on the following simple pattern: transactions for which banks receiving money are outside Switzerland are considered fraudulent. With the labelling method only 55,226 clients have fraudulent transactions. To train the Poisson process, three features are required: client ID, timestamp and the label. Timestamps and labels are trained for each client to estimate the intensity of the fraud that will be used to predict fraudulent event.

The proportion of fraud corresponding to the number of fraudulent transactions in relation to the total number of transactions is calculated for each client. According to the labeling method, some clients may have a 100% fraud proportion. This concerns clients for whom the recipient institutions are all located outside Switzerland. To be realistic, we remove these clients from our analysis. In addition, clients that do not contain any fraud events in the complete dataset are deleted because the hours of fraud events are unknown and their intensity can not be estimated. In addition, these datasets contain only one class and, in this context, no measure of classification performance such as ROC-AUC is defined.

Figure 2 shows the distribution and the Boxplot of fraud proportions. We notice that the cleaned dataset is generally unbalanced because most clients have a low proportion of frauds. The Boxplot shows a skewed right data with the presence of larger outliers. With the value of the median, 50% of the clients have a fraud proportion less than 9%.

However, it is important to mention that the labelling method is relatively simple and that the above histogram is not representative of the true distribution of fraud because, in practice, the majority of fraud proportions are less than 1%. To study our analysis in an imbalanced dataset framework, we propose to focus on the clients with less than 20% frauds. Next, we divide this dataset into four

(a)(b)

Figure 2. (a) Histogram of Fraud proportions in the full dataset. (b) Boxplot of Fraud proportions in the full dataset. The clients with no fraud events and the clients with 100% of fraud proportion are removed from this full dataset.

subsets containing different fraud profiles. The first subset includes clients fraud rate less than 1%, the second subset concerns clients with a proportion between 1% and 5%, the third subset is for clients whose fraud proportion is between 5% and 10% and the last one for clients whose fraud proportion is between 10% and 20%. Figure 3 shows the Boxplot for each group. The four datasets are roughly symmetric with no outliers. Obviously, the greater variability in the group 4 and the smaller variability in the group 1 are well observed.

In each subset, we randomly select 500 clients and we train and test the Poisson

Figure 3. Boxplots for the four subsets. Clients with the fraud proportion $P\le \mathrm{20\%}$ are grouped in four subsets containing different fraud profiles.

models on the transactions for each client. The training set represents the first 80% of transactions for which intensity parameters are estimated. The test set represents the last 20% and the fraud events are predicted with the estimated parameters. In addition, to take into account the time-varying intensity parameters, the prediction in the test set is also performed by rolling windows.

From a practical point of view, when there is no fraud in the training set, it is difficult to estimate the fraud intensity because the fraud event times are not available; see Equation (8) and Equation (15). Two solutions are possible:

1) Remove the clients for whom there was no fraud occurrence in the training set; The consequence is that we could lose more information.

2) Make the assumption that the intensity i.e. the occurrence rate of fraud $\lambda =0$ as there are no fraud events in the training set. In this context the fraud prediction probability is zero; see Proposition 1.

We conduct our analysis with the last one that is the intensity $\lambda =0$ when we train a dataset with no fraud information. The main reason is that we expect to keep most of client profiles in our analysis. As we will see later, under this assumption the dynamic models perform worse than the static models. To compare the various Poisson models, we define a baseline model (benchmark) based on a naive approach. The naive approach is to calculate the proportion of fraud in the training set and use that probability to predict fraud in the test set. Finally, predictive performance is summarized in each subset using two performance measures: ROC-AUC and Average Precision (AP) Score.

4. Results

By adding the rolling windows approach to our study, we have a total of 6 models to compare. Let start by giving more explanations to the 6 models:

1) The first model is the homogeneous Poisson process ( $\lambda \left(t\right)=\lambda $ ). The constant intensity $\lambda $ is estimated in the training set. By (17), the estimated $\lambda $ is used for predicting the fraud event in the whole test set. We note this model by HomoStatic.

2) The second model is the Homogeneous Poisson process unless the prediction is done by rolling windows. The window starts by the training set and it is used for the estimation of the intensity; this estimated intensity is used to predict the fraud event on the next transaction in the test set. Then, the sliding window is shifted one step ahead on the next transaction. The intensity is estimated again in the second time window and it is used for the prediction of fraud on the next transaction. This procedure is repeated until the end of the test set. The goal of this methodology is to take account the time varying of the intensity. The model is denoted by HomoDynamic.

3) The third model is the non-homogeneous Poisson process with the intensity is a linear function of time ( $\lambda \left(t\right)=a+bt$ ). Intensity parameters are estimated in the training set and are used for the fraud prediction in the whole test set. It is denoted LinearStatic.

4) The fourth model is the inhomogeneous linear intensity function unless the prediction is performed by rolling windows. The rolling windows procedure is the same as above. It is denoted LinearDynamic.

5) The fifth model is the non-homogeneous Poisson process with the intensity being a quadratic function of time ( $\lambda \left(t\right)=a+bt+c{t}^{2}$ ). The procedure is the same as in LinearStatic. We denote this model QuadraticStatic.

6) The last model is as QuadraticStatic unless we make a prediction by rolling windows. It is denoted by QuadraticDynamic.

In addition, we note by NaiveStatic the baseline model to estimate the probability of fraud in the training set and using the same probability for the prediction in the test set. The probabilities of prediction are therefore the same for all the transactions of the test set. This is equivalent to a random classifier because the model has no discrimination capability to distinguish genuine transactions from fraudulent transaction.

We are interested in the power of prediction of the different models. Thus, all the results presented below are based on the predicting probabilities and the labels in the test set. Tables 1-4 show the AUC (Area Under The curve)-ROC (Receiver Operating Characteristics) curves for the different models in each group. AUC-ROC is the measure of performance for the classification problem at various thresholds settings. ROC is a probability curve and AUC represents the degree or measure of separability. It tells how much the model is able to distinguish between classes. Higher the AUC, better the model is. By analogy, higher the AUC, better the model is at distinguishing between genuine and fraudulent transactions. The tables show the mean, the standard deviation, the minimum and maximum for the AUCs calculated for 500 clients in each group.

We note that dynamic models (with rolling windows) are more volatile than static models (without rolling windows). All static models perform significantly

Table 1. AUC: Summary for statistics in the group 1 ( $P\le \mathrm{1\%}$ ).

Table 2. AUC: Summary for statistics in the group 2 ( $1\%<P\le 5\%$ ).

Table 3. AUC: Summary for statistics in the group 3 ( $5\%<P\le 10\%$ ).

Table 4. AUC: Summary for statistics in the group 4 ( $10\%<P\le 20\%$ ).

better than the dynamic models. The LinearStatic model is the best one and has a mean AUC of 69%, 73%, 72%, 71% in the group 1, group 2, group 3 and group 4 respectively. It is followed by the QuadraticStatic model. The baseline model (naive approach) is significantly worse than Poisson models with the exception of the QuadraticDynamic model in the group 1 where the mean AUC is 47%. However, the HomoDynamic model performs better than the other dynamic models. It is important to mention that in some cases the Poisson models do not predict frauds correctly, as AUCs are equal to 0. It is often the case when the fraud information used in the training set to estimate the intensity is not sufficient for the prediction in the test set. Let us illustrate one common situation in our dataset where there is no fraud in the training set that conducts to AUC = 0. Consider an example of dataset with 6 training instances and 3 test instances. The labels are:

Training set: [0 0 0 0 0 0] Test set: [1 0 0].

The labels 0 indicate genuine transactions and labels 1 indicate fraudulent transactions. There are no fraud events in the training set and from the above assumption $\lambda =0$. For all static models, the prediction probabilities in the test set are 0 and therefore the AUC-ROC is equal to 0.5. On the other hand, the dynamic models based on the sliding windows show an AUC-ROC equal to 0. In fact, it is easy to show that using the sliding windows in the test set, the first predicting probability is 0 and the next two ones are different to 0. This conducts to an AUC-ROC equal 0.

AUC-ROC can be a misleading measure for classification in imbalanced fraud dataset. One of the main reasons is that it underestimates the false positive rate. In fact, since the number of legitimate transactions (negative examples) far exceeds the number of fraudulent transactions (positive examples), a significant variation in the number of false positives can lead to a slight change in the false positive rate. This can lead to erroneous conclusions. In this case, the precision-recall analysis is more appropriate because these metrics do not take into account the number of legitimate transactions (negative examples) in their calculation. We focus on the Average Precision (AP) which is an estimate of the area under the precision-recall curve and their results are shown in the following Tables 5-8. All the Poisson models significantly outperform the naive approach and static approaches perform better than the dynamic approaches. LinearStatic model still remains the better one for all groups, following by the QuadraticStatic model. Also, the HomoDynamic model performs better than the other dynamic models. In conclusion, the AUC-ROC and AP analyses showed that in all four groups the linearStatic model is the best; it is followed by the QuadraticStatic model and then by the HomoDynamic model. All the Poisson models outperform significantly the baseline approach.

We are also interested in the relative performance in term of prediction between the Poisson models and the baseline approach. The idea is to determine in which group the Poisson models perform best. AP scores are used for this analysis. The relative variations between the Mean Average-Precision (MAP) for the

Table 5. AP: Summary for statistics in the group 1 ( $P\le \mathrm{1\%}$ ).

Table 6. AP: Summary for statistics in the group 2 ( $1\%<P\le 5\%$ ).

Table 7. AP: Summary for statistics in the group 3 ( $5\%<P\le 10\%$ ).

Table 8. AP: Summary for statistics in the group 4 ( $10\%<P\le 20\%$ ).

different Poisson models and the baseline model are calculated in Table 9. The table shows that the relative variation decreases when the fraud proportion of the group increases. So, the predicting power of the Poisson models increases with the degree of imbalanced dataset. Figure 4 shows the relative performance for the different models in each group. We observe that the relative performance is better in the group 1 and that the linearStatic model outperforms the other 5 models.

During the analysis, we observe that dynamic approaches (Rolling Windows) are less efficient than the static approaches regardless the performance measures. That is, taking account the temporal variation of the intensity parameters by the rolling windows does not produce better results. Two mains reasons could explain this weak performance of dynamic models. First, as illustrated above, the assumption of $\lambda =0$ when we train a dataset with no fraud may conduct to this weak performance. Second, the window size is essential for the forecast accuracy. In fact following Inoue et al. (2017), different window sizes may lead to different empirical results in practice and good results might be obtained simply by

Table 9. Relative Variations of MAP between the Poisson Models and the Baseline model in the four groups.

Figure 4. Relative performances between the different models and the baseline approach. These performances are plotted in each group showing in which group the Poisson models perform the best.

chance. To produce better results, one can vary the window size and select the optimal window size for better prediction. Another possibility is to consider a stochastic intensity model that incorporates the time varying of the parameters. This has to be conducted in a next research.

5. Conclusion

The Poisson process is applied to detect fraud in an imbalanced dataset. The case of homogeneous and non-homogeneous Poisson processes is investigated. For non-homogeneous Poisson process, the linear and quadratic functions are considered. We have shown how to estimate the intensity and to predict fraud events. Our methodology is applied to financial datasets.

For each Poisson model studied, we consider the static and the dynamic approach. Unlike the static approach, the dynamic one takes into account the temporal variation of intensity parameters and works with rolling windows. All models are compared to a baseline model of fraud prediction using the proportion of frauds obtained in the training set. We found that all Poisson models outperform the baseline and that static approaches perform better than the dynamic ones. The static linear model remains the better for all groups followed by the static quadratic model and then by the homogeneous Poisson model. The study also showed a better predicting power of the Poisson models in the case of the more imbalanced dataset.

One of the main problems of this study is the training of the Poisson process in a set with no fraud events. In this context, it is difficult to estimate the intensity parameters because we have no fraud event times. In this study, it is assumed that the intensity is zero. But as indicated above this assumption could conduct to a poorer performance of the model.

Another problem is the dynamic of the intensity function. It is assumed here that the fraud rate is constant or deterministic i.e. function of time. In fact, fraud is a rare event that can happen at any time; so it must be stochastic, a random variable at any time. These issues will be addressed in future research by detecting fraud using a stochastic intensity model combined with deep learning algorithms.

The main contributions of the paper are:

1) Even though the intensity-based approach is used in many fields, such as credit risk models, we are among the first to apply this approach to fraud detection.

2) The Poisson process is addressed to rare events and it requires few inputs for the estimation of the intensity; so, the risk of over-fitting and computational cost would be reduced.

3) The approach combined with the machine learning algorithms can conduct a sophisticated technique for detecting frauds.

NOTES

^{1}https://netguardians.ch.

^{2}https://netguardians.ch.

Conflicts of Interest

The authors declare no conflicts of interest regarding the publication of this paper.

[1] |
Artzner, P., & Delbaen, F. (1995). Default Risk Insurance and Incomplete Markets. Mathematical Finance, 5, 187-195. https://doi.org/10.1111/j.1467-9965.1995.tb00064.x |

[2] |
Basawa, I. V., & Rao, B. L. (1980). Statistical Inference for Stochastic Processes. New York: Academic Press. https://doi.org/10.1016/B978-0-12-080250-0.50017-8 |

[3] | Brown, M. (1972). Statistical Analysis of Non-Homogeneous Poisson Process. In Stochastic Point Processes: Statistical Analysis, Theory and Applications (pp. 67-89). New York: Wiley. |

[4] |
Cox, D. R., & Lewis, P. A. (1966). Statistical Analysis of Series of Events. London: Methuen. https://doi.org/10.1007/978-94-011-7801-3 |

[5] | Drazek, L. C. (2013). Intensity Estimation for Poisson Processes. Master Thesis, Leeds: The University of Leeds. |

[6] |
Duffie, D., & Singleton, K. (1999). Modelling Term Structures of Defaultable Bonds. Review of Financial Studies, 12, 687-720. https://doi.org/10.1093/rfs/12.4.687 |

[7] |
Dyzma, M. (2018). Fraud Detection with Machine Learning: How Banks and Financial Institutions Leverage AI.
https://www.netguru.com/blog/fraud-detection-with-machine-learning-how-banks-and-financial-institutions-leverage-ai |

[8] | Elrahman, S. M. A., & Abraham, A. (2013). A Review of Class Imbalance Problem. Journal of Networking and Innovative Computing, 1, 332-340. |

[9] |
Fleming, T. R., & Harrington, D. P. (2005). Counting Processes and Survival Analysis. Hoboken, NJ: John Wiley and Sons. https://doi.org/10.1002/9781118150672 |

[10] |
Galar, M., Fernandez, A., Barrenechea, E., Bustince, H., & Herrera, F. (2012). A Review on Ensembles for the Class Imbalance Problem: Bagging-, Boosting-, and Hybrid-Based Approaches. IEEE Transactions on Systems, Man, and Cybernetics, Part C: Applications and Reviews, 42, 463-484. https://doi.org/10.1109/TSMCC.2011.2161285 |

[11] |
He, H., & Garcia, E. A. (2009). Learning from Imbalanced Data. IEEE Transactions on Knowledge and Data Engineering, 21, 1263-1284.
https://doi.org/10.1109/TKDE.2008.239 |

[12] |
Inoue, A., Jin, L., & Rossi, B. (2017). Rolling Window Selection for Out-of-Sample Forecasting with Time-Varying Parameters. Journal of Economoetrics, 196, 55-67.
https://doi.org/10.1016/j.jeconom.2016.03.006 |

[13] |
Jarrow, R., & Turnbull, S. (1995). Pricing Derivatives on Financial Securities Subject to Credit Risk. Journal of Finance, 50, 53-86.
https://doi.org/10.1111/j.1540-6261.1995.tb05167.x |

[14] | Kingman, J. F. C. (1993). Poisson Process. Oxford: Oxford University Press. |

[15] | Krawczyk, B. (2016). Learning from Imbalanced Data: Open Challenges and Future Directions. Progress in Artificial Intelligence, 5, 221-232. |

[16] |
Massey, W. A., Parker, G. A., & Whitt, W. (1996). Estimating the Parameters of a Nonhomogeneous Poisson Process with Linear Rate. Telecommunication Systems, 5, 361-388. https://doi.org/10.1007/BF02112523 |

[17] |
Reiss, R.-D. (1993). A Course on Point Processes. Springer Series in Statistics, Berlin: Springer. https://doi.org/10.1007/978-1-4613-9308-5 |

[18] | Ross, S. M. (1996). Stochastic Processes. Hoboken, NJ: Wiley. |

[19] |
Ross, S. M. (2010). Introduction to Probability Models (10th ed.). Boston, MA: Academic Press. https://doi.org/10.1016/B978-0-12-375686-2.00007-8 |

Journals Menu

Contact us

+1 323-425-8868 | |

customer@scirp.org | |

+86 18163351462(WhatsApp) | |

1655362766 | |

Paper Publishing WeChat |

Copyright © 2024 by authors and Scientific Research Publishing Inc.

This work and the related PDF file are licensed under a Creative Commons Attribution 4.0 International License.