Detecting Changes in Large Data Sets of Payments Cards Data: A Case Study

author: Robert Grossman, Open Data Group
published: Aug. 14, 2007,   recorded: August 2007,   views: 4497


Related Open Educational Resources

Related content

Report a problem or upload files

If you have found a problem with this lecture or would like to send us extra material, articles, exercises, etc., please use our ticket system to describe your request and upload the data.
Enter your e-mail into the 'Cc' field, and we will keep you updated with your request's status.
Lecture popularity: You need to login to cast your vote.


An important problem in data mining is detecting changes in large data sets. 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 is used for generating and investigating alerts using these baselines.

See Also:

Download slides icon Download slides: kdd07_grossman_dcilsp_01.ppt (210.5┬áKB)

Help icon Streaming Video Help

Link this page

Would you like to put a link to this lecture on your homepage?
Go ahead! Copy the HTML snippet !

Reviews and comments:

Comment1 S. Connelly, August 27, 2007 at 10:38 p.m.:

Great idea to tape these and make them available.

Would be better if speakers could be confined to the
microphone and podium. This talk is difficult to hear.

Every professor believes their voice projects sufficiently.
Most are wrong :)

Write your own review or comment:

make sure you have javascript enabled or clear this field: