Detecting changes in large data sets of payment card data: a case study

  • Authors:
  • Chris Curry;Robert L. Grossman;David Locke;Steve Vejcik;Joseph Bugajski

  • Affiliations:
  • Open Data Group, River Forest, IL;Open Data Group, River Forest, IL;Open Data Group, River Forest, IL;Open Data Group, River Forest, IL;Visa International, Foster City, CA

  • Venue:
  • Proceedings of the 13th ACM SIGKDD international conference on Knowledge discovery and data mining
  • Year:
  • 2007

Quantified Score

Hi-index 0.00

Visualization

Abstract

An important problem in data mining is detecting changes in large datasets. Although there are a variety of change detection algorithms that have been developed, in practice it can be a problem to scale these algorithms to large data sets due to the heterogeneity of the data. In this paper, we describe a case study involving payment card data in which we built and monitored a separate change detection model for each cell in a multi-dimensional data cube. We describe a system that has been in operation for the past two years that builds and monitors over 15,000 separate baseline models and the process that isused for generating and investigating alerts using these baselines.