Abstract
Click frauds are Internet crimes where clicks are deliberately performed to increase the publisher’s earnings or to deplete an advertising budget of the advertiser’s competitor. This paper presents an approach to automatically detecting click frauds by using a mathematical theory of evidence to estimate the likelihood of the frauds from click behaviors. Unlike most existing work, our approach provides online computation that incorporates incoming behaviors on real-time. It is theoretical-grounded, easily extensible and employs only data available at the advertiser’s site. The latter makes the approach feasible for the advertisers to guard themselves against the frauds. The paper describes the approach and evaluates its validity using real-world case scenarios.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsReferences
Kshetri N (2010) The economics of click fraud. IEEE Secur Priv 8(3):45–53. http://libres.uncg.edu/ir/uncg/f/N_Kshetri_Economics_2010.pdf
Li X, Liu Y, Zeng D (2011). Publisher click fraud in the pay-per-click advertising market: incentives and consequences. In: Proceedings of the IEEE international conference on intelligence and security informatics, pp 207–209
Antoniou D, Paschou M, Sakkopoulos E, Sourla E, Tzimas G, Tsakalidis A, Viennas E (2011) Exposing click-fraud using a burst detection algorithm. In: Proceedings of the ISCC on computers and communications, IEEE symposium, pp 1111–1116
Tuzhilin A (2006) The Lane’s gifts vs. Google report. http://googleblog.blogspot.com/pdf/Tuzhilin_Report.pdf
Haddadi H (2010) Fighting online click-fraud using bluff ads. ACM SIGCOMM Comput Comm Rev 40(2):21–25
Walgampaya C, Kantardzic M, Yampolskiy R (2010) Real time click fraud prevention using multi-level data fusion. In: Proceedings of the world congress on engineering and computer science, San Francisco, 20–22 Oct 2010
Walgampaya C, Kantardzic M (2011) Cracking the Smart ClickBot. In: Proceedings of the 13th IEEE symposium on web systems evolution, pp 125–134
Shafer G (1976) A mathematical theory of evidence. Princeton University Press, Princeton
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer Science+Business Media Dordrecht
About this paper
Cite this paper
Hewett, R., Agarwal, A. (2013). Protecting Advertisers Against Click Frauds. In: Kim, K., Chung, KY. (eds) IT Convergence and Security 2012. Lecture Notes in Electrical Engineering, vol 215. Springer, Dordrecht. https://doi.org/10.1007/978-94-007-5860-5_8
Download citation
DOI: https://doi.org/10.1007/978-94-007-5860-5_8
Published:
Publisher Name: Springer, Dordrecht
Print ISBN: 978-94-007-5859-9
Online ISBN: 978-94-007-5860-5
eBook Packages: EngineeringEngineering (R0)