Using Association Rules for Fraud Detection in Web Advertising Networks
Summary: Streaming-Rules reports association rules in data streams with tight error guarantees, using small per-item processing. Modular design fits stream engines, targeting fraud in web advertising networks, showing scalability and fraud discovery. (summarized by gpt-5-nano on Feb 09 2026)
Incoming Non-self Citations Over Time
No non-self incoming citations found for this paper in this database.
Authors
- 1. Ahmed Metwally (University of California Santa Barbara)
- 2. Divyakant Agrawal (University of California Santa Barbara)
- 3. Amr El Abbadi (University of California Santa Barbara)
BibTeX Citation
@article{metwally_vldb05,
title = {{Using Association Rules for Fraud Detection in Web Advertising Networks}},
author = {Metwally, Ahmed and Agrawal, Divyakant and Abbadi, Amr El},
journal = {PVLDB},
series = {{VLDB} '05},
pages = {169--180},
year = {2005}
}
Incoming Citations (Sorted by Pagerank)
Showing 1 of 1 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 12,582 | SLEUTH: Single-pubLisher attack dEtection Using correlaTion Hunting | 2008 | VLDB | 5.093636e-05 |
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 6 of 6 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 13 | Mining Association Rules between Sets of Items in Large Databases | 1993 | SIGMOD | 0.0006567919 |
| 122 | Approximate Frequency Counts over Data Streams | 2002 | VLDB | 0.00031260115 |
| 161 | Mining Frequent Patterns without Candidate Generation | 2000 | SIGMOD | 0.00027981772 |
| 838 | What’s Hot and What’s Not: Tracking Most Frequent Items Dynamically | 2003 | PODS | 0.0001370404 |
| 4,683 | False Positive or False Negative: Mining Frequent Itemsets from High Speed Transactional Data Streams | 2004 | VLDB | 6.5641059e-05 |
| 6,305 | A Regression-Based Temporal Pattern Mining Scheme for Data Streams | 2003 | VLDB | 5.9204295e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 122 | Approximate Frequency Counts over Data Streams | 2002 | VLDB |
| 2 | 558 | An Efficient Algorithm for Mining Association Rules in Large Databases | 1995 | VLDB |
| 3 | 4,598 | Temporal Rules Discovery for Web Data Cleaning | 2016 | VLDB |
| 4 | 7,330 | Discovering Association Rules from Big Graphs | 2022 | VLDB |
| 5 | 462 | Sampling Large Databases for Association Rules | 1996 | VLDB |
| 6 | 27 | Fast Algorithms for Mining Association Rules | 1994 | VLDB |
| 7 | 13 | Mining Association Rules between Sets of Items in Large Databases | 1993 | SIGMOD |
| 8 | 12,582 | SLEUTH: Single-pubLisher attack dEtection Using correlaTion Hunting | 2008 | VLDB |
| 9 | 1,217 | Maintaining Data Privacy in Association Rule Mining | 2002 | VLDB |
| 10 | 4,005 | Fast Data Stream Algorithms using Associative Memories | 2007 | SIGMOD |