Detecting click fraud in pay-per-click streams of online advertising networks

Proceedings - The 28th International Conference on Distributed Computing Systems, ICDCS 2008

Volumn , Issue , 2008, Pages 77-84

  Zhang, Linfeng ^a   Guan, Yong ^a  

^a Iowa State University of Science and Technology   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

BLOOM FILTERING; CLICK STREAMS; DISTRIBUTED COMPUTING SYSTEMS; FALSE NEGATIVES; FALSE POSITIVE RATE; INNOVATIVE ALGORITHMS; INTERNATIONAL CONFERENCES; MEMORY SPACES; ONE-PASS; ONLINE ADVERTISING; RAPID GROWTH; REVENUE MODELING; RIVAL COMPANIES; SLIDING WINDOWS; THEORETICAL ANALYSIS;

ALGORITHMS; BLOOMS (METAL); COMPUTER SYSTEMS; DATA STRUCTURES; DECODING; ELECTRIC NETWORK ANALYSIS; FILE ORGANIZATION; LAWS AND LEGISLATION; RIVERS; WAVE FILTERS;

WINDOWS;

EID: 51849168110     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICDCS.2008.98     Document Type: Conference Paper

References (31)

1. Google click fraud settlement. http://googleblog.blogspot.com/pdf/ lanes_google_final_order.pdf, Mar. 2006.
2. Yahoo click fraud settlement. http://yhoo.client.shareholder.com/ ReleaseDetail.cfm?ReleaseID=202354, June 2006.
3. V. Anupam, A. Mayer, K. Nissim, B. Pinkas, and M. K. Reiter. On the security of pay-per-click and other web advertising schemes. In WWW 1999.
4. A. Arasu and G. S. Manku. Approximate counts and quantiles over sliding windows. In PODS 2004.
5. B. Babcock, S. Babu, M. Datar, R. Motwani, and J. Widom. Models and issues in data stream systems. In PODS 2002.
6. B. Babcock, M. Datar, R. Motwani, and L. O'Callaghan. Maintaining variance and k-medians over data stream windows. In PODS 2003.
7. B. H. Bloom. Space/time trade-offs in hash coding with allowable errors. Communications of the ACM, 13(7):422-426, July 1970.
8. A. Broder and M. Mitzenmacher. Network applications of Bloom filters: A survey. In the 40th Annual Allerton Conference on Communication, Control, and Computing.
9. M. Datar, A. Gionis, P. Indyk, and R. Motwani. Maintaining stream statistics over sliding windows. In SODA 2002.
10. F. Deng and D. Rafiei. Approximately detecting duplicates for streaming data using stable bloom filters. In SIGMOD 2006.
11. eMarketer. Online ad spending to total $19.5 billion in 2007. http://www.emarketer.com/Article.aspx?1004635, Feb. 2007.
12. L. Fan, P. Cao, J. Almeida, and A. Z. Broder. Summary cache: a scalable wide-area Web cache sharing protocol. Transactions on Networking, 8(3):281-293, 2000.
13. M. Gandhi, M. Jakobsson, and J. Ratkiewicz. Badvertisements: Stealthy click-fraud with unwitting accessories. Anti-Phishing and Online Fraud, Part I Journal of Digital Forensic Practice, 1, Nov. 2006.
14. H. Garcia-Molina, J. Ullman, and J. Widom. Database Systems: The Complete Book. Prentice Hall, 2002.
15. P. B. Gibbons and S. Tirthapura. Distributed streams algorithms for sliding windows. In SPAA 2002.
16. L. Golab, D. DeHaan, E. D. Demaine, A. López-Ortiz, and J. I. Munro. Identifying frequent items in sliding windows over on-line packet streams. In IMC 2003.
17. Internet Advertising Bureau of United Kingdom. IAB online adspend study - 2006. http://www.iabuk.net/en/1/iabknowledgebankadspend.html.
18. L. Lee and H. Ting. A simpler and more efficient deterministic scheme for finding frequent items over sliding windows. In PODS 2006.
19. X. Lin, H. Lu, J. Xu, and J. X. Yu. Continuously maintaining quantile summaries of the most recent N elements over a data stream. In ICDE 2004.
20. A. Metwally, D. Agrawal, and A. E. Abbadi. DETEC-TIVES: DETEcting Coalition hiT Inflation attacks in advertising nEtworks Streams. In WWW 2007.
21. A. Metwally, D. Agrawal, and A. E. Abbadi. Duplicate detection in click streams. In WWW 2005.
22. A. Metwally, D. Agrawal, and A. E. Abbadi. Using association rules for fraud detection in web advertising networks. In VLDB 2005.
23. A. Metwally, D. Agrawal, A. E. Abbadi, and Q. Zheng. On hit inflation techniques and detection in streams of web advertising networks. In ICDCS 2007.
24. S. Muthukrishnan. Data streams: Algorithms and applications. Technical report, Rutgers University, 2003.
25. Outsell Survey. Hot topics: Click fraud reaches $1.3 billion, dictates end of "don't ask, don't tell" era. http://www.outsellinc. com/store/products/243.
26. M. K. Reiter, V. Anupam, and A. Mayer. Detecting hit shaving in click-through payment schemes. In Proceedings of the 3rd USENIX Workshop on Electronic Commerce, 1998.
27. S. Tirthapura, B. Xu, and C. Busch. Sketching asynchronous streams over sliding windows. In PODC 2006.
28. L. Zhang and Y. Guan. Frequency estimation over sliding windows. In ICDE 2008.
29. L. Zhang and Y. Guan. Variance estimation over sliding windows. In PODS 2007.
30. L. Zhang and Y. Guan. Detecting click fraud in pay-per-click streams of online advertising networks. Technical report, Iowa State University, Mar. 2008.
31. Y. Zhu and D. Shasha. StatStream: Statistical monitoring of thousands of data streams in real time. In VLDB 2002.