Using association rules for fraud detection in web advertising networks

Ahmed Metwally, Divyakant Agrawal, Amr El Abbadi

Research output: Chapter in Book/Report/Conference proceedingConference contribution

45 Citations (Scopus)

Abstract

Discovering associations between elements occurring in a stream is applicable in numerous applications, including predictive caching and fraud detection. These applications require a new model of association between pairs of elements in streams. We develop an algorithm, Stream ing-Rules, to report association rules with tight guarantees on errors, using limited processing per element, and minimal space. The modular design of Stream ing-Rules allows for integration with current stream management systems, since it employs existing techniques for finding frequent elements. The presentation emphasizes the applicability of the algorithm to fraud detection in advertising networks. Such fraud instances have not been successfully detected by current techniques. Our experiments on synthetic data demonstrate scalability and efficiency. On real data, potential fraud was discovered.

Original languageEnglish
Title of host publicationVLDB 2005 - Proceedings of 31st International Conference on Very Large Data Bases
Pages169-180
Number of pages12
Volume1
Publication statusPublished - 1 Dec 2005
Externally publishedYes
EventVLDB 2005 - 31st International Conference on Very Large Data Bases - Trondheim, Norway
Duration: 30 Aug 20052 Sep 2005

Other

OtherVLDB 2005 - 31st International Conference on Very Large Data Bases
CountryNorway
CityTrondheim
Period30/8/052/9/05

Fingerprint

Association rules
Marketing
Scalability
Processing
Experiments

ASJC Scopus subject areas

  • Engineering(all)

Cite this

Metwally, A., Agrawal, D., & El Abbadi, A. (2005). Using association rules for fraud detection in web advertising networks. In VLDB 2005 - Proceedings of 31st International Conference on Very Large Data Bases (Vol. 1, pp. 169-180)

Using association rules for fraud detection in web advertising networks. / Metwally, Ahmed; Agrawal, Divyakant; El Abbadi, Amr.

VLDB 2005 - Proceedings of 31st International Conference on Very Large Data Bases. Vol. 1 2005. p. 169-180.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Metwally, A, Agrawal, D & El Abbadi, A 2005, Using association rules for fraud detection in web advertising networks. in VLDB 2005 - Proceedings of 31st International Conference on Very Large Data Bases. vol. 1, pp. 169-180, VLDB 2005 - 31st International Conference on Very Large Data Bases, Trondheim, Norway, 30/8/05.
Metwally A, Agrawal D, El Abbadi A. Using association rules for fraud detection in web advertising networks. In VLDB 2005 - Proceedings of 31st International Conference on Very Large Data Bases. Vol. 1. 2005. p. 169-180
Metwally, Ahmed ; Agrawal, Divyakant ; El Abbadi, Amr. / Using association rules for fraud detection in web advertising networks. VLDB 2005 - Proceedings of 31st International Conference on Very Large Data Bases. Vol. 1 2005. pp. 169-180
@inproceedings{32d8d253460c416d9ab3f441066b3dc7,
title = "Using association rules for fraud detection in web advertising networks",
abstract = "Discovering associations between elements occurring in a stream is applicable in numerous applications, including predictive caching and fraud detection. These applications require a new model of association between pairs of elements in streams. We develop an algorithm, Stream ing-Rules, to report association rules with tight guarantees on errors, using limited processing per element, and minimal space. The modular design of Stream ing-Rules allows for integration with current stream management systems, since it employs existing techniques for finding frequent elements. The presentation emphasizes the applicability of the algorithm to fraud detection in advertising networks. Such fraud instances have not been successfully detected by current techniques. Our experiments on synthetic data demonstrate scalability and efficiency. On real data, potential fraud was discovered.",
author = "Ahmed Metwally and Divyakant Agrawal and {El Abbadi}, Amr",
year = "2005",
month = "12",
day = "1",
language = "English",
isbn = "1595931546",
volume = "1",
pages = "169--180",
booktitle = "VLDB 2005 - Proceedings of 31st International Conference on Very Large Data Bases",

}

TY - GEN

T1 - Using association rules for fraud detection in web advertising networks

AU - Metwally, Ahmed

AU - Agrawal, Divyakant

AU - El Abbadi, Amr

PY - 2005/12/1

Y1 - 2005/12/1

N2 - Discovering associations between elements occurring in a stream is applicable in numerous applications, including predictive caching and fraud detection. These applications require a new model of association between pairs of elements in streams. We develop an algorithm, Stream ing-Rules, to report association rules with tight guarantees on errors, using limited processing per element, and minimal space. The modular design of Stream ing-Rules allows for integration with current stream management systems, since it employs existing techniques for finding frequent elements. The presentation emphasizes the applicability of the algorithm to fraud detection in advertising networks. Such fraud instances have not been successfully detected by current techniques. Our experiments on synthetic data demonstrate scalability and efficiency. On real data, potential fraud was discovered.

AB - Discovering associations between elements occurring in a stream is applicable in numerous applications, including predictive caching and fraud detection. These applications require a new model of association between pairs of elements in streams. We develop an algorithm, Stream ing-Rules, to report association rules with tight guarantees on errors, using limited processing per element, and minimal space. The modular design of Stream ing-Rules allows for integration with current stream management systems, since it employs existing techniques for finding frequent elements. The presentation emphasizes the applicability of the algorithm to fraud detection in advertising networks. Such fraud instances have not been successfully detected by current techniques. Our experiments on synthetic data demonstrate scalability and efficiency. On real data, potential fraud was discovered.

UR - http://www.scopus.com/inward/record.url?scp=33745586336&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=33745586336&partnerID=8YFLogxK

M3 - Conference contribution

SN - 1595931546

SN - 9781595931542

VL - 1

SP - 169

EP - 180

BT - VLDB 2005 - Proceedings of 31st International Conference on Very Large Data Bases

ER -