Click fraud detection

Electrical computers and digital processing systems: multicomput – Computer network managing – Computer network monitoring

Reexamination Certificate

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

C707S793000, C707S793000, C705S051000

Reexamination Certificate

active

07657626

ABSTRACT:
Systems and methods for detecting instances of click fraud are disclosed. Click fraud occurs when, for example, a user, malware, bot, or the like, clicks on a pay per click advertisement (e.g., hyperlink), a paid search listing, or the like without a good faith interest in the underlying subject of the hyperlink. Such fraudulent clicks can be expensive for an advertising sponsor. Statistical information, such as ratios of unpaid clicks to pay per clicks, are extracted from an event database. The statistical information of global data is used as a reference data set to compare to similar statistical information for a local data set under analysis. In one embodiment, when the statistical data sets match relatively well, no click fraud is determined to have occurred, and when the statistical data sets do not match relatively well, click fraud is determined to have occurred.

REFERENCES:
patent: 6006260 (1999-12-01), Barrick, Jr. et al.
patent: 6421675 (2002-07-01), Ryan et al.
patent: 6877007 (2005-04-01), Hentzel et al.
patent: 7206780 (2007-04-01), Slackman
patent: 2002/0082923 (2002-06-01), Merriman et al.
patent: 2002/0169760 (2002-11-01), Cheung et al.
patent: 2004/0267806 (2004-12-01), Lester
patent: 2005/0137939 (2005-06-01), Calabria et al.
patent: 2005/0222987 (2005-10-01), Vadon
patent: 2006/0031206 (2006-02-01), Deubel et al.
patent: 2006/0136294 (2006-06-01), Linden et al.
patent: 2006/0161520 (2006-07-01), Brewer et al.
patent: 2006/0161534 (2006-07-01), Carson et al.
patent: 2006/0161537 (2006-07-01), Amitay et al.
patent: 2006/0161541 (2006-07-01), Cencini
patent: 2006/0161542 (2006-07-01), Cucerzan et al.
patent: 2006/0161591 (2006-07-01), Huang et al.
patent: 2006/0161843 (2006-07-01), Ebrahimi et al.
patent: 2006/0167852 (2006-07-01), Dissett et al.
patent: 2006/0167854 (2006-07-01), Dissett et al.
patent: 2006/0167857 (2006-07-01), Kraft et al.
patent: 2006/0167874 (2006-07-01), von Ahn Arellano et al.
patent: 2006/0167896 (2006-07-01), Kapur et al.
patent: 2006/0168056 (2006-07-01), Gandhi et al.
patent: 2006/0200455 (2006-09-01), Wilson
patent: 2006/0265435 (2006-11-01), Denissov
patent: 2006/0265493 (2006-11-01), Brindley et al.
patent: 2007/0130131 (2007-06-01), Porter et al.
Thorsten Joachims; Optimizing Search Engines using Clickthrough Data, Proceedings of the ACM Conference on Knowledge Discovery and Data Mining, Association for Computing Machinery (2002).
Filip Radlinski & Thorsten Joachims; Query Chains: Learning to Rank from Implicit Feedback, Proceedings of the ACM Conference on Knowledge Discovery and Data Mining, Association for Computing Machinery (2005).
New Search Patent Applications: Aug. 1, 2006—Microsoft Answers?; [online] [retrieved on Aug. 21, 2006] Retrieved from the Internet: <URL: http://blog.searchenginewatch.com/blog/060801-232103>.
USPTO; Office Action dated May 2, 2008, from related application U.S. Appl. No. 11/454,305, filed Jun. 16, 2006.
USPTO; Office Action dated May 1, 2008, from related application U.S. Appl. No. 11/454,628, filed Jun. 16, 2006.

LandOfFree

Say what you really think

Search LandOfFree.com for the USA inventors and patents. Rate them and share your experience with other people.

Rating

Click fraud detection does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Click fraud detection, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Click fraud detection will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFUS-PAI-O-4185768

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.