Detecting Click Fraud in Pay-Per-Click Streams of Online Advertising Networks

@article{Zhang2008DetectingCF,
  title={Detecting Click Fraud in Pay-Per-Click Streams of Online Advertising Networks},
  author={Linfeng Zhang and Yong Guan},
  journal={2008 The 28th International Conference on Distributed Computing Systems},
  year={2008},
  pages={77-84}
}
With the rapid growth of the Internet, online advertisement plays a more and more important role in the advertising market. One of the current and widely used revenue models for online advertising involves charging for each click based on the popularity of keywords and the number of competing advertisers. This pay-per-click model leaves room for individuals or rival companies to generate false clicks (i.e., click fraud), which pose serious problems to the development of healthy online… CONTINUE READING

Figures and Topics from this paper.

Citations

Publications citing this paper.
SHOWING 1-10 OF 84 CITATIONS

Inferential time-decaying Bloom filters

VIEW 10 EXCERPTS
CITES BACKGROUND & METHODS
HIGHLY INFLUENCED

Transactions on Large-Scale Data- and Knowledge-Centered Systems VIII

  • Lecture Notes in Computer Science
  • 2013
VIEW 11 EXCERPTS
CITES BACKGROUND & METHODS
HIGHLY INFLUENCED

Inferring Insertion Times and Optimizing Error Penalties in Time-decaying Bloom Filters

  • ACM Trans. Database Syst.
  • 2019
VIEW 10 EXCERPTS
CITES BACKGROUND & METHODS
HIGHLY INFLUENCED

Approximate Sliding Window Measurements

  • 2017
VIEW 8 EXCERPTS
CITES METHODS, BACKGROUND & RESULTS
HIGHLY INFLUENCED

Pay for a Sliding Bloom Filter and Get Counting, Distinct Elements, and Entropy for Free

  • IEEE INFOCOM 2018 - IEEE Conference on Computer Communications
  • 2017
VIEW 9 EXCERPTS
CITES METHODS & BACKGROUND
HIGHLY INFLUENCED

Poster abstract: A sliding counting bloom filter

  • 2017 IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS)
  • 2017
VIEW 4 EXCERPTS
CITES BACKGROUND
HIGHLY INFLUENCED

Detecting Duplicates over Sliding Windows with RAM-Efficient Detached Counting Bloom Filter Arrays

  • 2011 IEEE Sixth International Conference on Networking, Architecture, and Storage
  • 2011
VIEW 5 EXCERPTS
CITES METHODS & BACKGROUND
HIGHLY INFLUENCED

FILTER CITATIONS BY YEAR

2008
2019

CITATION STATISTICS

  • 9 Highly Influenced Citations

  • Averaged 12 Citations per year from 2017 through 2019

References

Publications referenced by this paper.
SHOWING 1-10 OF 29 REFERENCES