Transaction aggregation as a strategy for credit card fraud detection

  • Authors:
  • C. Whitrow;D. J. Hand;P. Juszczak;D. Weston;N. M. Adams

  • Affiliations:
  • Institute for Mathematical Sciences, Imperial College, London, UK;Institute for Mathematical Sciences, Imperial College, London, UK and Department of Mathematics, Imperial College, London, UK;Institute for Mathematical Sciences, Imperial College, London, UK;Institute for Mathematical Sciences, Imperial College, London, UK;Department of Mathematics, Imperial College, London, UK

  • Venue:
  • Data Mining and Knowledge Discovery
  • Year:
  • 2009

Quantified Score

Hi-index 0.00

Visualization

Abstract

The problem of preprocessing transaction data for supervised fraud classification is considered. It is impractical to present an entire series of transactions to a fraud detection system, partly because of the very high dimensionality of such data but also because of the heterogeneity of the transactions. Hence, a framework for transaction aggregation is considered and its effectiveness is evaluated against transaction-level detection, using a variety of classification methods and a realistic cost-based performance measure. These methods are applied in two case studies using real data. Transaction aggregation is found to be advantageous in many but not all circumstances. Also, the length of the aggregation period has a large impact upon performance. Aggregation seems particularly effective when a random forest is used for classification. Moreover, random forests were found to perform better than other classification methods, including SVMs, logistic regression and KNN. Aggregation also has the advantage of not requiring precisely labeled data and may be more robust to the effects of population drift.