Using association rules for fraud detection in web advertising networks

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

Volumn 1, Issue , 2005, Pages 169-180

  Metwally, Ahmed ^a   Agrawal, Divyakant ^a   El Abbadi, Amr ^a  

^a University of California   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

APPLICABILITY; ASSOCIATION RULES; FRAUD DETECTION; MODULAR DESIGN;

ALGORITHMS; BUFFER STORAGE; COMPUTER SIMULATION; ERROR DETECTION; MARKETING; WORLD WIDE WEB;

COMPUTER NETWORKS;

EID: 33745586336     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (23)

1. R. Agrawal, T. Imielinski, and A. Swami. Mining Association Rules Between Sets of Items in Large Databases. In Proceedings of the 12th ACM SIGMOD International Conference on Management of Data, pages 207-216, 1993.
2. R. Agrawal and R. Srikant. Mining Sequential Patterns. In Proceedings of the 11th IEEE ICDE International Conference on Data Engineering, pages 3-14, 1995.
3. V. Anupam, A. Mayer, K. Nissim, B. Pinkas, and M. Reiter. On the Security of Pay-Per-Click and Other Web Advertising Schemes. In Proceedings of the 8th WWW International World Wide Web Conference, pages 1091-1100, 1999.
4. J. Chang and W. Lee. Finding Recent Frequent Itemsets Adaptively over Online Data Streams. In Proceedings of the 9th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pages 487-492, 2003.
5. M. Charikar, K. Chen, and M. Farach-Colton. Finding Frequent Items in Data Streams. In Proceedings of the 29th ICALP International Colloquium on Automata, Languages and Programming, pages 693-703, 2002.
6. G. Cormode and S. Muthukrishnan. What's Hot and What's Not: Tracking Most Frequent Items Dynamically. In Proceedings of the 22nd ACM PODS Symposium on Principles of Database Systems, pages 296-306, 2003.
7. M. Datar, A. Gionis, P. Indyk, and R. Motwani. Maintaining Stream Statistics over Sliding Windows. In Proceedings of the 13th ACM SIAM Symposium on Discrete Algorithms, pages 635-644, 2002.
8. E. Demaine, A. López-Ortiz, and J. Munro. Frequency Estimation of Internet Packet Streams with Limited Space. In Proceedings of the 10th ESA Annual European Symposium on Algorithms, pages 348-360, 2002.
9. M. El-Sayed, C. Ruiz, and E. Rundensteiner. FS-Miner: Efficient and Incremental Mining of Frequent Sequence Patterns in Web Logs. In 6th ACM CIKM WIDM International Workshop on Web Information and Data Management, pages 128-135, 2004.
10. J. Han, J. Pei, and Y. Yin. Mining Frequent Patterns without Candidate Generation. In Proceedings of the 19th ACM SIGMOD international conference on Management of data, pages 1-12, 2000.
11. G. Manku and R. Motwani. Approximate Frequency Counts over Data Streams. In Proceedings of the 28th ACM VLDB International Conference on Very Large Data Bases, pages 346-357, 2002.
12. H. Mannila, H. Toivonen, and A. Verkamo. Discovery of Frequent Episodes in Event Sequences. Data Mining and Knowledge Discovery, 1(3):259-289, 1997.
13. M. Meiss, F. Menczer, and A. Vespignani. On the Lack of Typical Behavior in the Global Web Traffic Network. In Proceedings of the 14th WWW International World Wide Web Conference, pages 510-518, 2005.
14. A. Metwally, D. Agrawal, and A. El Abbadi. Duplicate Detection in Click Streams. In Proceedings of the 14th WWW International World Wide Web Conference, pages 12-21, 2005.
15. A. Metwally, D. Agrawal, and A. El Abbadi. Efficient Computation of Frequent and Top-k Elements in Data Streams. In Proceedings of the 10th ICDT International Conference on Database Theory, pages 398-412, 2005. An extended version appeared as a University of California, Santa Barbara, Department of Computer Sciemce, technical report 2005-23.
16. A. Metwally, D. Agrawal, and A. El Abbadi. Using Association Rules for Fraud Detection in Web Advertising Networks. Technical Report 2005-13, University of California, Santa Barbara, 2005.
17. M. Reiter, V. Anupam, and A. Mayer. Detecting Hit-Shaving in Click-Through Payment Schemes. In Proceedings of the 3rd USENIX Workshop on Electronic Commerce, pages 155-166, 1998.
18. C. Silverstein, H. Marais, M. Henzinger, and M. Moricz. Analysis of a Very Large Web Search Engine Query Log. SIGIR Forum, 33(1):6-12, 1999.
19. L. Sun and X. Zhang. Efficient Frequent Pattern Mining on Web Logs. In Advanced Web Technologies and Applications, 6th APWeb Asia-Pacific Web Conference, pages 533-542, 2004.
20. W. Teng, M. Chen, and P. Yu. A Regression-Based Temporal Pattern Mining Scheme for Data Streams. In Proceedings of the 29th ACM VLDB International Conference on Very Large Data Bases, pages 93-104, 2003.
21. A. Tung, H. Lu, J. Han, and L. Feng. Breaking the Barrier of Transactions: Mining Inter-Transaction Association Rules. In Proceedings of the 5th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pages 297-301, 1999.
22. J. Yu, Z. Chong, H. Lu, and A. Zhou. False Positive or False Negative: Mining Frequent Itemsets from High Speed Transactional Data Streams. In Proceedings of the 30th ACM VLDB International Conference on Very Large Data Bases, pages 204-215, 2004.
23. G. Zipf. Human Behavior and The Principle of Least Effort. Addison-Wesley, 1949.