Menu
Home
People
Places
Arts
History
Plants & Animals
Science
Life & Culture
Technology
Reference.org
Click fraud
open-in-new
<h2 id="pay-per-click-advertising">Pay-per-click advertising</h2> <p class="note">Main article: <a href="/facts/Pay-per-click/yBnzc4Mc">Pay-per-click</a></p> <p>PPC advertising is an arrangement in which <a href="/facts/Webmaster/n0RlfsYG">webmasters</a> (operators of <a href="/facts/Websites/SAsjJnca">websites</a>), acting as publishers, display clickable links from advertisers in exchange for a charge per click. As this industry evolved, a number of advertising networks developed, which acted as middlemen between these two groups (publishers and advertisers). Each time a (believed to be) valid Web user clicks on an ad, the advertiser pays the advertising network, which in turn pays the publisher a share of this money. This revenue-sharing system is seen as an incentive for click fraud. </p><p>The largest of the advertising networks, <a href="/facts/Google/GT9Sugza">Google</a>'s <a href="/facts/AdWords/CNWv4Nnu">AdWords</a>/<a href="/facts/AdSense/ApWGT7cI">AdSense</a> and <a href="/facts/Yahoo!_Search_Marketing/hChTdaB9">Yahoo! Search Marketing</a>, act in a dual role, since they are also publishers themselves (on their search engines).<a class="footnote-ref" id="fnref:2" href="#fn:2"><sup>2</sup></a> According to critics, this complex relationship may create a conflict of interest. This is because these companies lose money to undetected click fraud when paying out to the publisher but make more money when collecting fees from the advertiser. Because of the spread between what they collect and pay out, unfettered click fraud would create short-term profits for these companies.<a class="footnote-ref" id="fnref:3" href="#fn:3"><sup>3</sup></a> </p> <h2 id="non-contracting-parties">Non-contracting parties</h2> <p>A secondary source of click fraud is non-contracting parties, who are not part of any pay-per-click agreement. This type of fraud is even harder to police, because perpetrators generally cannot be sued for breach of contract or charged criminally with fraud. Examples of non-contracting parties are: </p> <ul><li>Competitors of advertisers: These parties may wish to harm a competitor who advertises in the same market by clicking on their ads. The perpetrators do not profit directly but force the advertiser to pay for irrelevant clicks, thus weakening or eliminating a source of competition.</li> <li>Competitors of publishers: These persons may wish to frame a publisher. It is made to look as if the publisher is clicking on its own ads. The advertising network may then terminate the relationship. Many publishers rely exclusively on revenue from advertising and could be put out of business by such an attack.</li> <li>Other malicious intent: As with <a href="/facts/Vandalism/huCfsqth">vandalism</a>, there are many motives for wishing to cause harm to either an advertiser or a publisher, even by people who have nothing to gain financially. Motives include political and personal vendettas. These cases are often the hardest to deal with, since it is difficult to track down the culprit, and if found, there is little legal action that can be taken against them.</li> <li>Friends of the publisher: Sometimes upon learning a publisher profits from ads being clicked, a supporter of the publisher (like a fan, family member, political party supporter, charity patron or personal friend) will click on the ads to help. This can be considered patronage. However, this can backfire when the publisher (not the friend) is accused of click fraud.</li></ul> <p>Advertising networks may try to stop fraud by all parties but often do not know which clicks are legitimate. Unlike fraud committed by the publisher, it is difficult to know who should pay when past click fraud is found. Publishers resent having to pay refunds for something that is not their fault. However, advertisers are adamant that they should not have to pay for phony clicks. </p> <h2 id="organization">Organization</h2> <p>Click fraud can be as simple as one person starting a small Web site, becoming a publisher of ads, and clicking on those ads to generate revenue. Often the number of clicks and their value is so small that the fraud goes undetected. Publishers may claim that small amounts of such clicking is an accident, which is often the case.<a class="footnote-ref" id="fnref:4" href="#fn:4"><sup>4</sup></a> </p><p>Much larger-scale fraud also occurs in <a href="/facts/Cybercrime/cSyaFF96">cybercrime</a> communities.<a class="footnote-ref" id="fnref:5" href="#fn:5"><sup>5</sup></a> According to Jean-Loup Richet, Professor at the Sorbonne Business School, click fraud is frequently one link in the large <a href="/facts/Ad_fraud/jPsxTjpg">ad fraud</a> chain, and can be leveraged as part of a larger identity fraud and/or attribution fraud. <a class="footnote-ref" id="fnref:6" href="#fn:6"><sup>6</sup></a> Those engaged in large-scale fraud will often run <a href="/facts/Scripting_programming_language/8pF4ajBL">scripts</a> which simulate a human clicking on ads in Web pages. <a class="footnote-ref" id="fnref:7" href="#fn:7"><sup>7</sup></a> However, huge numbers of clicks appearing to come from just one, or a small number of computers, or a single geographic area, look highly suspicious to the advertising network and advertisers. Clicks coming from a computer known to be that of a publisher also look suspicious to those watching for click fraud. A person attempting large-scale fraud, from one computer, stands a good chance of being caught. </p><p>One type of fraud that circumvents detection based on IP patterns uses existing user traffic, turning this into clicks or impressions.<a class="footnote-ref" id="fnref:8" href="#fn:8"><sup>8</sup></a> Such an attack can be camouflaged from users by using 0-size <a href="/facts/HTML_element/s4TKzjUP">iframes</a> to display advertisements that are programmatically retrieved using <a href="/facts/JavaScript/XhhIIEsl">JavaScript</a>. It could also be camouflaged from advertisers and portals by ensuring that so-called "reverse <a href="/facts/Web_crawler/ra7D1xyb">spiders</a>" are presented with a legitimate page, while human visitors are presented with a page that commits click fraud. The use of 0-size iframes and other techniques involving human visitors may also be combined with the use of incentivized traffic, where members of "Paid to Read" (PTR) sites are paid small amounts of money (often a fraction of a cent) to visit a website and/or click on keywords and search results, sometimes hundreds or thousands of times every day<a class="footnote-ref" id="fnref:9" href="#fn:9"><sup>9</sup></a> Some owners of PTR sites are members of PPC engines and may send many email ads to users who do search, while sending few ads to those who do not. They do this mainly because the charge per click on search results is often the only source of revenue to the site. This is known as forced searching, a practice that is frowned upon in the Get Paid To industry. </p><p><a href="/facts/Organized_crime/m2eEga1z">Organized crime</a> can handle this by having many computers with their own Internet connections in different geographic locations. Often, scripts fail to mimic true human behavior, so organized crime networks use <a href="/facts/Trojan_horse_(computing)/FVqh3nDy">Trojan</a> code to turn the average person's machines into <a href="/facts/Zombie_computer/VLYfpDXN">zombie computers</a> and use sporadic <a href="/facts/URL_redirection/4o1p9l7C">redirects</a> or <a href="/facts/DNS_cache_poisoning/k85Akwm4">DNS cache poisoning</a> to turn the oblivious user's actions into actions generating revenue for the scammer. It can be difficult for advertisers, advertising networks, and authorities to pursue cases against networks of people spread around multiple countries. </p><p>Impression fraud is when falsely generated ad impressions affect an advertiser's account. In the case of <a href="/facts/Click-through_rate/RV3fQ0UC">click-through rate</a> based auction models, the advertiser may be penalized for having an unacceptably low click-through for a given <a href="/facts/Keyword_(Internet_search)/RNzIbb62">keyword</a>. This involves making numerous searches for a keyword without clicking of the ad. Such ads are disabled<a class="footnote-ref" id="fnref:10" href="#fn:10"><sup>10</sup></a> automatically, enabling a competitor's lower-bid ad for the same keyword to continue, while several high bidders (on the first page of the search results) have been eliminated. </p> <h3>Hit inflation attack</h3> <p>A hit inflation attack is a kind of fraudulent method used by some advertisement publishers to earn unjustified revenue on the traffic they drive to the advertisers’ Web sites. It is more sophisticated and harder to detect than a simple inflation attack. </p><p>This process involves the collaboration of two counterparts, a dishonest publisher, P, and a dishonest Web site, S. Web pages on S contain a script that redirects the customer to P's Web site, and this process is hidden from the customer. So, when user U retrieves a page on S, it would simulate a click or request to a page on P's site. P's site has two kinds of webpages: a manipulated version, and an original version. The manipulated version simulates a click or request to the advertisement, causing P to be credited for the click-through. P selectively determines whether to load the manipulated (and thus fraudulent) script to U's browser by checking if it was from S. This can be done through the <a href="/facts/HTTP_referer/WMQI4h4K">Referrer field</a>, which specifies the site from which the link to P was obtained. All requests from S will be loaded with the manipulated script, and thus the automatic and hidden request will be sent.<a class="footnote-ref" id="fnref:11" href="#fn:11"><sup>11</sup></a> </p><p>This attack will silently convert every innocent visit to S to a click on the advertisement on P's page. Even worse, P can be in collaboration with several dishonest Web sites, each of which can be in collaboration with several dishonest publishers. If the advertisement commissioner visits the Web site of P, the non-fraudulent page will be displayed, and thus P cannot be accused of being fraudulent. Without a reason for suspecting that such collaboration exists, the advertisement commissioner has to inspect all the Internet sites to detect such attacks, which is infeasible.<a class="footnote-ref" id="fnref:12" href="#fn:12"><sup>12</sup></a> </p><p>Another proposed method for detection of this type of fraud is through use of <a href="/facts/Association_rule/oX6w9Kux">association rules</a>.<a class="footnote-ref" id="fnref:13" href="#fn:13"><sup>13</sup></a> </p> <h2 id="manipulation-of-organic-search-results">Manipulation of organic search results</h2> <p>One major factor that affects the ranking of websites in organic search results is the CTR (Click-through Rate). That is the ratio of clicks to impressions, or in other words how many times a search result is clicked on, as compared to the number of times the listing appears in search results. </p><p>In contrast to PPC fraud, where a competitor leverages the services of a botnet, or low-cost labour, to generate false clicks, in this case the objective is to adopt a "<a href="/facts/Beggar_thy_neighbour/8TqPPb6N">beggar thy neighbour</a>" policy against competitors by making their CTR rate as low as possible, thereby diminishing their position in search results. </p><p>Bad actors will therefore generate false clicks on organic search results that they wish to promote, while avoiding search results they wish to demote. This technique can effectively create a cartel of business services controlled by the same bad actor, or be used to promote a certain political opinion etc. The scale of this issue is unknown but is certainly evident to many website developers who pay close attention to the statistics in webmaster tools. </p> <h2 id="legal-cases">Legal cases</h2> <h3>Lawsuits</h3> <ul><li>Disputes over the issue have resulted in a number of <a href="/facts/Lawsuit/gFeKr9ra">lawsuits</a>. In one case, Google (acting as both an advertiser and advertising network) won a lawsuit against a Texas company called Auction Experts (acting as a publisher), which Google accused of paying people to click on ads that appeared on Auction Experts' site, costing advertisers $50,000.<a class="footnote-ref" id="fnref:14" href="#fn:14"><sup>14</sup></a> Despite networks' efforts to stop it, publishers are suspicious of the motives of the advertising networks, because the advertising network receives money for each click, even if it is fraudulent.</li> <li>In July 2005, Yahoo settled a <a href="/facts/Class_action/VFeabe1R">class action</a> lawsuit against it by plaintiffs alleging it did not do enough to prevent click fraud. Yahoo paid $4.5 million in legal bills for the plaintiffs and agreed to settle advertiser claims dating back to 2004<a class="footnote-ref" id="fnref:15" href="#fn:15"><sup>15</sup></a> In July 2006, Google settled a similar suit for $90 million.<a class="footnote-ref" id="fnref:16" href="#fn:16"><sup>16</sup></a><a class="footnote-ref" id="fnref:17" href="#fn:17"><sup>17</sup></a></li> <li>On March 8, 2006, Google agreed to a $90 million settlement fund in the class-action lawsuit filed by Lane's Gifts & Collectibles.<a class="footnote-ref" id="fnref:18" href="#fn:18"><sup>18</sup></a> The class-action lawsuit was filed in Miller County, Arkansas, by Dallas attorneys Steve Malouf, Joel Fineberg, and Dean Gresham.<a class="footnote-ref" id="fnref:19" href="#fn:19"><sup>19</sup></a> The expert witness for the Plaintiffs in the case was Jessie Stricchiola, an internet search expert who first identified instances of PPC fraud in 2001.<a class="footnote-ref" id="fnref:20" href="#fn:20"><sup>20</sup></a></li></ul> <h3>Michael Anthony Bradley</h3> <p>In 2004, California resident Michael Anthony Bradley created Google Clique, a software program that he claimed could let spammers defraud <a href="/facts/Google/GT9Sugza">Google</a> out of millions of dollars in fraudulent clicks, which ultimately led to his arrest and indictment.<a class="footnote-ref" id="fnref:21" href="#fn:21"><sup>21</sup></a> </p><p>Bradley was able to demonstrate that fraud was possible, and was impossible for Google to detect. The <a href="/facts/United_States_Department_of_Justice/2SuTuevo">Department of Justice</a> alleged that he contacted Google saying that unless they paid him $100,000 for the rights to the technology, he would sell it to spammers, costing Google millions. As a result, Bradley was arrested for <a href="/facts/Extortion/tv3TraAp">extortion</a> and <a href="/facts/Mail_fraud/YcyoDGhC">mail fraud</a> in 2006.<a class="footnote-ref" id="fnref:22" href="#fn:22"><sup>22</sup></a> </p><p>Charges were dropped without explanation on November 22, 2006; both the US Attorney's office and Google declined to comment. <i><a href="/facts/Business_Week/EsGLjcge">Business Week</a></i> suggests that Google was unwilling to cooperate with the prosecution, as it would be forced to disclose its click fraud detection techniques publicly.<a class="footnote-ref" id="fnref:23" href="#fn:23"><sup>23</sup></a> </p> <h3>Fabio Gasperini</h3> <p>On June 18, 2016, Fabio Gasperini, an Italian citizen, was <a href="/facts/Extradition/W6tEfWRQ">extradited</a> to the United States on click fraud charges.<a class="footnote-ref" id="fnref:24" href="#fn:24"><sup>24</sup></a> An <a href="/facts/Indictment/ochlu0HA">indictment</a> charged Gasperini with: </p> <ul><li>two counts of <a href="/facts/Computer_intrusion/4bAJ9F1A">computer intrusion</a></li> <li>one count of <a href="/facts/Mail_and_wire_fraud/YcyoDGhC">wire fraud</a></li> <li>one count of wire fraud <a href="/facts/Conspiracy_(criminal)/SFr9KxYy">conspiracy</a></li> <li>and one count of <a href="/facts/Money_laundering/98Gw3mgx">money laundering</a></li></ul> <p>According to the U.S. government, Gasperini set up and operated a <a href="/facts/Botnet/bGspY7bJ">botnet</a> of over 140,000 computers around the world. This was the first click fraud trial in the United States. If convicted of all counts, Gasperini risked up to 70 years in prison. </p><p>Simone Bertollini, an Italian-American lawyer, represented Gasperini at trial. On August 9, 2017 a jury acquitted Gasperini of all the felony charges of the indictment. Gasperini was convicted of one misdemeanor count of obtaining information without a financial gain. Gasperini was sentenced to the statutory maximum of one year imprisonment, a $100,000 fine, and one year of supervised release following incarceration. Shortly after he was credited with time served and sent back to Italy. An <a href="/facts/Appeal/kJaMAf3p">appeal</a> is currently pending.<a class="footnote-ref" id="fnref:25" href="#fn:25"><sup>25</sup></a> </p> <h2 id="solutions">Solutions</h2> <p>Proving click fraud can be very difficult since it is hard to know who is behind a computer and what their intentions are. When it comes to mobile ad fraud detection, data analysis can give some reliable indications. Abnormal metrics can hint at the presence of different types of frauds. To detect click fraud in the ad campaign, advertisers can focus on the following attribution points:<a class="footnote-ref" id="fnref:26" href="#fn:26"><sup>26</sup></a> </p> <ul><li>IP Address: As bots run similar scripts from the same server, any click fraud on mobile ads will indicate a high density of clicks coming from the same IP address or a range of similar IP addresses. Advertisers can also run check on IP addresses to verify their history with another fraud.</li> <li>Click Timestamp: Click timestamp maintains the time at which the click is made on the ad. The bot-based click fraud runs repeatedly to attempt clicking on the ads, which increases click frequency for that duration. A high range of clicks with almost similar timestamp points at the possibility of click fraud. A low duration and high frequency mean a high probability of fraud.</li> <li>Action Timestamp: Action timestamp is the time at which the user takes action on (or engages with) the app or website. With a bot-based click attack, there can be a similarity with action timestamp. As bot clicks on the advertisement and then performs the action on app or website without any delay, the advertiser can notice a low or almost no action timestamp.</li></ul> <p>Often the best an advertising network can do is to identify which clicks are most likely fraudulent and not charge the account of the advertiser. Even more sophisticated means of detection are used,<a class="footnote-ref" id="fnref:27" href="#fn:27"><sup>27</sup></a> but none are foolproof. </p><p>The Tuzhilin Report<a class="footnote-ref" id="fnref:28" href="#fn:28"><sup>28</sup></a> produced by <a href="/facts/Alexander_Tuzhilin/9KbnbwpT">Alexander Tuzhilin</a> as part of a click fraud lawsuit settlement, has a detailed and comprehensive discussion of these issues. In particular, it defines "the Fundamental Problem of invalid (fraudulent) clicks": </p> <ul><li>"There is no conceptual definition of invalid clicks that can be operationalized [except for certain obviously clear cases]."</li> <li>"An operational definition cannot be fully disclosed to the general public because of the concerns that unethical users will take advantage of it, which may lead to a massive click fraud. However, if it is not disclosed, advertisers cannot verify or even dispute why they have been charged for certain clicks."</li></ul> <p>The PPC industry is lobbying for tighter laws on the issue. Many hope to have laws that will cover those not bound by contracts. </p><p>A number of companies are developing viable solutions for click fraud identification and are developing intermediary relationships with advertising networks. Such solutions fall into two categories: </p> <ol><li><i>Forensic analysis of advertisers' web server log files.</i>This analysis of the advertiser's web server data requires an in-depth look at the source and behavior of the traffic. As industry standard log files are used for the analysis, the data is verifiable by advertising networks. The problem with this approach is that it relies on the honesty of the middlemen in identifying fraud.</li> <li><i>Third-party corroboration.</i>Third parties offer web-based solutions that might involve placement of single-pixel images or Javascript on the advertiser's web pages and suitable tagging of the ads. The visitor may be presented with a cookie. Visitor information is then collected in a third-party data store and made available for download. The better offerings make it easy to highlight suspicious clicks, and they show the reasons for such a conclusion. Since an advertiser's log files can be tampered with, their accompaniment with corroborating data from a third-party forms a more convincing body of evidence to present to the advertising network. However, the problem with third-party solutions is that such solutions see only part of the traffic of the entire network. Hence, they can be less likely to identify patterns that span several advertisers. In addition, due to the limited amount of traffic they receive when compared to middlemen, they can be overly or less aggressive when judging traffic to be fraud.</li></ol> <p>In a 2007 interview in <a href="/facts/Forbes/lyULpGhW">Forbes</a>, Google click fraud prevention expert <a href="/facts/Shuman_Ghosemajumder/JDVbYpgP">Shuman Ghosemajumder</a> said that one of the key challenges in click fraud detection by third-parties was access to data beyond clicks, notably, ad impression data.<a class="footnote-ref" id="fnref:29" href="#fn:29"><sup>29</sup></a> </p><p>Click fraud is less likely in <a href="/facts/Cost_per_action/4ahkQG6T">cost per action</a> models. </p> <h2 id="research">Research</h2> <p>The fact that the middlemen (search engines) have the upper hand in the operational definition of invalid clicks is the reason for the conflict of interest between advertisers and the middlemen, as described above. This is manifested in the Tuzhilin Report<a class="footnote-ref" id="fnref:30" href="#fn:30"><sup>30</sup></a> as described above. The Tuzhilin report did not publicly define invalid clicks and did not describe the operational definitions in detail. Rather, it gave a high-level picture of the fraud-detection system and argued that the operational definition of the search engine under investigations is "reasonable". One aim of the report was to preserve the privacy of the fraud-detection system in order to maintain its effectiveness. This prompted some researchers to conduct public research on how the middlemen can fight click fraud.<a class="footnote-ref" id="fnref:31" href="#fn:31"><sup>31</sup></a> Since such research is presumably not tainted by market forces, there is hope that this research can be adopted to assess how rigorous a middleman is in detecting click fraud in future law cases. The fear that this research can expose the internal fraud-detection system of middlemen still applies. An example of such research is that done by Metwally, Agrawal and El Abbadi at <a href="/facts/UCSB/G7UvBWlK">UCSB</a>. Other work by Majumdar, Kulkarni, and Ravishankar at <a href="/facts/UC_Riverside/QVdCJj5c">UC Riverside</a> proposes protocols for the identification of fraudulent behavior by brokers and other intermediaries in content-delivery networks. </p> <h2 id="see-also">See also</h2> <ul><li><a href="/facts/Botnet/bGspY7bJ">Botnet</a></li> <li><a href="/facts/Click_farm/uTSIRSKu">Click farm</a></li> <li><a href="/facts/Clickbot.A/lNEpukoS">Clickbot.A</a></li> <li><a href="/facts/Trojan.Win32.DNSChanger/w6DojnlY">Trojan.Win32.DNSChanger</a></li> <li><a href="/facts/ZeroAccess_botnet/v9sFmHdp">ZeroAccess botnet</a></li> <li><a href="/facts/Zombie_(computer_science)/VLYfpDXN">Zombie (computer science)</a></li></ul> <h2 id="external-links">External links</h2> <ul><li>Metwally, Ahmed; Agrawal, Divyakant; El Abbadi, Amr (2007). <a href="http://www2007.org/papers/paper070.pdf">"DETECTIVES: DETEcting Coalition hiT Inflation attacks in adVertising nEtworks Streams"</a> (PDF). <i>Proceedings of the International WWW conference</i>. IW3C2. pp. 241–250.</li> <li>Metwally, Ahmed; Agrawal, Divyakant; El Abbadi, Amr (2005). <a href="http://www2005.org/cdrom/docs/p12.pdf">"Duplicate Detection in Click Streams"</a> (PDF). <i>Proceedings of the International WWW conference</i>. IW3C2. pp. 12–21.</li> <li>Majumdar, Saugat; Kulkarni, Dhananjay; Ravishankar, Chinya (2007). <a href="http://www.cs.ucr.edu/~ravi/Papers/NWConf/clickfraud.pdf">"Addressing Click Fraud in Content Delivery Systems"</a> (PDF). <i>Infocom</i>. IEEE.</li> <li>"<a href="http://www.economist.com/opinion/displaystory.cfm?story_id=8319505">Truth in advertising</a>", <i><a href="/facts/The_Economist/KNjzFCVU">The Economist</a></i>, November 23, 2006.</li> <li>"<a href="https://money.cnn.com/2004/12/02/technology/google_fraud/">Google CFO: Fraud a Big Threat</a>", <i><a href="/facts/CNN/kEYsUQqr">CNN</a> Money</i>. Retrieved December 2, 2004.</li> <li>"<a href="https://www.wired.com/wired/archive/14.01/fraud.html">How Click Fraud Could Swallow the Internet</a>", <i><a href="/facts/Wired_Magazine/RQb6gcyf">Wired Magazine</a></i>, issue 14.01 (January 2006). Retrieved December 29, 2005.</li> <li><a href="https://www.phil-fak.uni-duesseldorf.de/fileadmin/Redaktion/Institute/Informationswissenschaft/soubusta/onclickfraud.pdf">Simone Soubusta: "On Click Fraud"</a>, Retrieved March 2014.</li> <li>"<a href="http://digitalmarketingmagazine.co.uk/digital-marketing-advertising/the-crooks-willing-to-put-you-out-of-business-for-5/1740">Click fraud uncovered - Fiverr advertisers willing to click on ads for $5</a>. Retrieved April 2015</li> <li>"<a href="https://searchenginewatch.com/2019/02/14/how-google-ads-fighting-click-fraud/">How Google Ads is fighting click fraud"</a> Retrieved February 2019</li></ul> <h2 id="references">References</h2> <ol> <li id="fn:1"><p>Wilbur, Kenneth C.; Zhu, Yi (2008-10-24). "Click Fraud". Marketing Science. 28 (2): 293–308. doi:10.1287/mksc.1080.0397. ISSN 0732-2399. <a href="https://pubsonline.informs.org/doi/abs/10.1287/mksc.1080.0397" target="_blank">https://pubsonline.informs.org/doi/abs/10.1287/mksc.1080.0397</a> <a href="#fnref:1" class="footnote-back-ref">↩</a></p></li> <li id="fn:2"><p>Wilbur, Kenneth C.; Zhu, Yi (2008-10-24). "Click Fraud". Marketing Science. 28 (2): 293–308. doi:10.1287/mksc.1080.0397. ISSN 0732-2399. <a href="https://pubsonline.informs.org/doi/abs/10.1287/mksc.1080.0397" target="_blank">https://pubsonline.informs.org/doi/abs/10.1287/mksc.1080.0397</a> <a href="#fnref:2" class="footnote-back-ref">↩</a></p></li> <li id="fn:3"><p>Wilbur, Kenneth C.; Zhu, Yi (2008-10-24). "Click Fraud". Marketing Science. 28 (2): 293–308. doi:10.1287/mksc.1080.0397. ISSN 0732-2399. <a href="https://pubsonline.informs.org/doi/abs/10.1287/mksc.1080.0397" target="_blank">https://pubsonline.informs.org/doi/abs/10.1287/mksc.1080.0397</a> <a href="#fnref:3" class="footnote-back-ref">↩</a></p></li> <li id="fn:4"><p>Wilbur, Kenneth C.; Zhu, Yi (2008-10-24). "Click Fraud". Marketing Science. 28 (2): 293–308. doi:10.1287/mksc.1080.0397. ISSN 0732-2399. <a href="https://pubsonline.informs.org/doi/abs/10.1287/mksc.1080.0397" target="_blank">https://pubsonline.informs.org/doi/abs/10.1287/mksc.1080.0397</a> <a href="#fnref:4" class="footnote-back-ref">↩</a></p></li> <li id="fn:5"><p>Schonfeld, Erick; The Evolution Of Click Fraud: Massive Chinese Operation DormRing1 Uncovered". TechCrunch. October 8, 2009. <a href="https://techcrunch.com/2009/10/08/the-evolution-of-click-fraud-massive-chinese-operation-dormring1-uncovered/" target="_blank">https://techcrunch.com/2009/10/08/the-evolution-of-click-fraud-massive-chinese-operation-dormring1-uncovered/</a> <a href="#fnref:5" class="footnote-back-ref">↩</a></p></li> <li id="fn:6"><p>Richet, Jean-Loup (2022). "How cybercriminal communities grow and change: An investigation of ad-fraud communities". Technological Forecasting and Social Change. 174 (121282): 121282. doi:10.1016/j.techfore.2021.121282. ISSN 0040-1625. S2CID 239962449. <a href="https://doi.org/10.1016%2Fj.techfore.2021.121282" target="_blank">https://doi.org/10.1016%2Fj.techfore.2021.121282</a> <a href="#fnref:6" class="footnote-back-ref">↩</a></p></li> <li id="fn:7"><p>Richet, Jean-Loup (2011). "Adoption of deviant behavior and cybercrime 'Know how' diffusion". York Deviancy Conference. <a href="#fnref:7" class="footnote-back-ref">↩</a></p></li> <li id="fn:8"><p>Gandhi, Mona; Jakobsson, Markus; Ratkiewicz, Jacob;Badvertisements: Stealthy Click-Fraud with Unwitting Accessories Archived 2016-03-04 at the Wayback Machine", APWG eFraud conference, 2006 <a href="http://mobiusrobot.com/badvertisements" target="_blank">http://mobiusrobot.com/badvertisements</a> <a href="#fnref:8" class="footnote-back-ref">↩</a></p></li> <li id="fn:9"><p>Grow, Bryan; Elgin, Ben; with Herbst, Moira (October 2, 2006). "Click Fraud: The dark side of online advertising". BusinessWeek. Archived from the original on October 4, 2006. <a href="https://web.archive.org/web/20061004202255/http://www.businessweek.com/magazine/content/06_40/b4003001.htm" target="_blank">https://web.archive.org/web/20061004202255/http://www.businessweek.com/magazine/content/06_40/b4003001.htm</a> <a href="#fnref:9" class="footnote-back-ref">↩</a></p></li> <li id="fn:10"><p>"Botnets strangle Google Adwords campaigns, Keyword Hijacking Risk". The Register. Retrieved 2005-02-04. <a href="https://www.theregister.co.uk/2005/02/03/google_adwords_attack/" target="_blank">https://www.theregister.co.uk/2005/02/03/google_adwords_attack/</a> <a href="#fnref:10" class="footnote-back-ref">↩</a></p></li> <li id="fn:11"><p>V. Anupam; A. Mayer; K. Nissim; B. Pinkas; M. Reiter (1999). "On the Security of Pay-Per-Click and Other Web Advertising Schemes. In Proceedings of the 8th WWW International World Wide Web Conference" (PDF). Unizh.co. pp. 1091–1100. Archived from the original (PDF) on 2017-10-10. Retrieved 2014-03-11. <a href="https://web.archive.org/web/20171010023048/http://www.id.uzh.ch/home/mazzo/reports/www8conf/2149/pdf/pd1.pdf" target="_blank">https://web.archive.org/web/20171010023048/http://www.id.uzh.ch/home/mazzo/reports/www8conf/2149/pdf/pd1.pdf</a> <a href="#fnref:11" class="footnote-back-ref">↩</a></p></li> <li id="fn:12"><p>V. Anupam; A. Mayer; K. Nissim; B. Pinkas; M. Reiter (1999). "On the Security of Pay-Per-Click and Other Web Advertising Schemes. In Proceedings of the 8th WWW International World Wide Web Conference" (PDF). Unizh.co. pp. 1091–1100. Archived from the original (PDF) on 2017-10-10. Retrieved 2014-03-11. <a href="https://web.archive.org/web/20171010023048/http://www.id.uzh.ch/home/mazzo/reports/www8conf/2149/pdf/pd1.pdf" target="_blank">https://web.archive.org/web/20171010023048/http://www.id.uzh.ch/home/mazzo/reports/www8conf/2149/pdf/pd1.pdf</a> <a href="#fnref:12" class="footnote-back-ref">↩</a></p></li> <li id="fn:13"><p>A. Metwally; D. Agrawal; A. El Abbadi (2005). "Using Association Rules for Fraud Detection in Web Advertising Networks. In Proceedings of the 10th ICDT International Conference on Database Theory" (PDF). pp. 398–412. Archived from the original (PDF) on 2020-07-31. Retrieved 2013-03-01. An extended version appeared in a University of California, Santa Barbara, Department of Computer Science, technical report 2005-23. <a href="https://web.archive.org/web/20200731205901/https://www.cs.ucsb.edu/research/tech_reports/reports/2005-13.pdf" target="_blank">https://web.archive.org/web/20200731205901/https://www.cs.ucsb.edu/research/tech_reports/reports/2005-13.pdf</a> <a href="#fnref:13" class="footnote-back-ref">↩</a></p></li> <li id="fn:14"><p>Davis, Wendy (July 5, 2005). "Google Wins $75,000 in Click Fraud Case". Media Post. Retrieved 2024-04-15. <a href="https://www.mediapost.com/publications/article/31772/" target="_blank">https://www.mediapost.com/publications/article/31772/</a> <a href="#fnref:14" class="footnote-back-ref">↩</a></p></li> <li id="fn:15"><p>Ryan, Kevin M. (July 5, 2006). "Big Yahoo Click Fraud Settlement". iMedia Connection. Archived from the original on July 20, 2006. Retrieved July 6, 2006. <a href="https://web.archive.org/web/20060720015152/http://www.imediaconnection.com/content/10294.asp" target="_blank">https://web.archive.org/web/20060720015152/http://www.imediaconnection.com/content/10294.asp</a> <a href="#fnref:15" class="footnote-back-ref">↩</a></p></li> <li id="fn:16"><p>Wong, Nicole; "Update Lanes Gifts v. Google". Google Blog, March 8, 2006 <a href="/wiki/Nicole_Wong" target="_blank">/wiki/Nicole_Wong</a> <a href="#fnref:16" class="footnote-back-ref">↩</a></p></li> <li id="fn:17"><p>Griffin, Joe E. (July 27, 2006). "Lanes v. Google Final Order" (PDF). Googleblog.blogsport.com. <a href="http://googleblog.blogspot.com/pdf/lanes_google_final_order.pdf" target="_blank">http://googleblog.blogspot.com/pdf/lanes_google_final_order.pdf</a> <a href="#fnref:17" class="footnote-back-ref">↩</a></p></li> <li id="fn:18"><p>Sullivan, Danny;"Google Agrees To $90 Million Settlement In Class Action Lawsuit Over Click Fraud" Archived 2007-11-22 at the Wayback Machine. March 8, 2006 <a href="/wiki/Danny_Sullivan" target="_blank">/wiki/Danny_Sullivan</a> <a href="#fnref:18" class="footnote-back-ref">↩</a></p></li> <li id="fn:19"><p>"Court Docket For: Lane's Gifts and Collectibles, L.L.C. et al. v. Yahoo! Inc., et al". Docket Alarm, Inc. Retrieved 6 August 2013. <a href="https://www.docketalarm.com/cases/Arkansas_Western_District_Court/4--05-cv-04027/Lane%27s_Gifts_LLC_et_al_v._Yahoo%21_Inc._et_al/" target="_blank">https://www.docketalarm.com/cases/Arkansas_Western_District_Court/4--05-cv-04027/Lane%27s_Gifts_LLC_et_al_v._Yahoo%21_Inc._et_al/</a> <a href="#fnref:19" class="footnote-back-ref">↩</a></p></li> <li id="fn:20"><p>Stricchiola, Jessie (July 28, 2004). "Lost Per Click". Search Engine Watch. <a href="http://searchenginewatch.com/article/2065811/Lost-Per-Click-Search-Advertising-Click-Fraud" target="_blank">http://searchenginewatch.com/article/2065811/Lost-Per-Click-Search-Advertising-Click-Fraud</a> <a href="#fnref:20" class="footnote-back-ref">↩</a></p></li> <li id="fn:21"><p>"Criminal Docket for: USA v. Bradley, 5:04-cr-20108 (N.D.Cal.)". Docket Alarm, Inc. Retrieved 6 August 2013. <a href="https://www.docketalarm.com/cases/California_Northern_District_Court/5--04-cr-20108/USA_v._Bradley/" target="_blank">https://www.docketalarm.com/cases/California_Northern_District_Court/5--04-cr-20108/USA_v._Bradley/</a> <a href="#fnref:21" class="footnote-back-ref">↩</a></p></li> <li id="fn:22"><p>US Department of Justice; "Computer Programmer Arrested for Extortion and Mail Fraud Scheme Targeting Google, Inc." Archived 2006-10-01 at the Wayback Machine. March 18, 2004 <a href="/wiki/US_Department_of_Justice" target="_blank">/wiki/US_Department_of_Justice</a> <a href="#fnref:22" class="footnote-back-ref">↩</a></p></li> <li id="fn:23"><p>Elgin, Ben; "The Vanishing Click Fraud Case". Business Week. December 4, 2006 <a href="https://web.archive.org/web/20120706054600/http://www.businessweek.com/stories/2006-12-04/the-vanishing-click-fraud-casebusinessweek-business-news-stock-market-and-financial-advice" target="_blank">https://web.archive.org/web/20120706054600/http://www.businessweek.com/stories/2006-12-04/the-vanishing-click-fraud-casebusinessweek-business-news-stock-market-and-financial-advice</a> <a href="#fnref:23" class="footnote-back-ref">↩</a></p></li> <li id="fn:24"><p>"Cybercriminal Who Created Global Botnet Infected With Malicious Software Extradited To Face Click Fraud Charges". www.justice.gov. Retrieved 2017-11-21. <a href="https://www.justice.gov/usao-edny/pr/cybercriminal-who-created-global-botnet-infected-malicious-software-extradited-face" target="_blank">https://www.justice.gov/usao-edny/pr/cybercriminal-who-created-global-botnet-infected-malicious-software-extradited-face</a> <a href="#fnref:24" class="footnote-back-ref">↩</a></p></li> <li id="fn:25"><p>"Cybercriminal Convicted of Computer Hacking and Sentenced to Statutory Maximum". www.justice.gov. Retrieved 2017-11-21. <a href="https://www.justice.gov/usao-edny/pr/cybercriminal-convicted-computer-hacking-and-sentenced-statutory-maximum" target="_blank">https://www.justice.gov/usao-edny/pr/cybercriminal-convicted-computer-hacking-and-sentenced-statutory-maximum</a> <a href="#fnref:25" class="footnote-back-ref">↩</a></p></li> <li id="fn:26"><p>"Click Fraud Prevention – Identify & Reduce Bot Traffic in Your Paid Ads". June 7, 2019 <a href="https://mfaas.com/resources/click-fraud-prevention/" target="_blank">https://mfaas.com/resources/click-fraud-prevention/</a> <a href="#fnref:26" class="footnote-back-ref">↩</a></p></li> <li id="fn:27"><p>Ghosemajumder, Shuman; "Using data to help prevent fraud". March 18, 2008 <a href="/wiki/Shuman_Ghosemajumder" target="_blank">/wiki/Shuman_Ghosemajumder</a> <a href="#fnref:27" class="footnote-back-ref">↩</a></p></li> <li id="fn:28"><p>Tuzhilin, Alexander; The Lane's Gifts v. Google Report, by Alexander Tuzhilin. July, 2006 <a href="http://googleblog.blogspot.com/pdf/Tuzhilin_Report.pdf" target="_blank">http://googleblog.blogspot.com/pdf/Tuzhilin_Report.pdf</a> <a href="#fnref:28" class="footnote-back-ref">↩</a></p></li> <li id="fn:29"><p>Greenberg, Andy; "Counting Clicks". Forbes. September 14, 2007 <a href="https://www.forbes.com/2007/09/13/google-shuman-fraud-tech-cx_ag_0914google.html" target="_blank">https://www.forbes.com/2007/09/13/google-shuman-fraud-tech-cx_ag_0914google.html</a> <a href="#fnref:29" class="footnote-back-ref">↩</a></p></li> <li id="fn:30"><p>Tuzhilin, Alexander; The Lane's Gifts v. Google Report, by Alexander Tuzhilin. July, 2006 <a href="http://googleblog.blogspot.com/pdf/Tuzhilin_Report.pdf" target="_blank">http://googleblog.blogspot.com/pdf/Tuzhilin_Report.pdf</a> <a href="#fnref:30" class="footnote-back-ref">↩</a></p></li> <li id="fn:31"><p>Jansen, B. J. (2007) Click fraud. IEEE Computer. 40(7), 85-86. <a href="https://faculty.ist.psu.edu/jjansen/academic/jansen_click_fraud.pdf" target="_blank">https://faculty.ist.psu.edu/jjansen/academic/jansen_click_fraud.pdf</a> <a href="#fnref:31" class="footnote-back-ref">↩</a></p></li> </ol>