Fighting Online Click-Fraud Using Bluff Ads

Online advertising is currently the greatest source of revenue for many Internet giants. The increased number of specialized websites and modern profiling techniques, have all contributed to an explosion of the income of ad brokers from online advertising. The single biggest threat to this growth, is however, click-fraud. Trained botnets and even individuals are hired by click-fraud specialists in order to maximize the revenue of certain users from the ads they publish on their websites, or to launch an attack between competing businesses. In this note we wish to raise the awareness of the networking research community on potential research areas within this emerging field. As an example strategy, we present Bluff ads; a class of ads that join forces in order to increase the effort level for click-fraud spammers. Bluff ads are either targeted ads, with irrelevant display text, or highly relevant display text, with irrelevant targeting information. They act as a litmus test for the legitimacy of the individual clicking on the ads. Together with standard threshold-based methods, fake ads help to decrease click-fraud levels.Comment: Draf

The Study on Supervision Model for Online Advertising Click Fraud

Considering the click fraud in the online advertising market, a basic game theoretic model for click fraud is built firstly. In this model, the Ads Network can choose to make click fraud supervision or trust, and advertising publishers can choose to publish advertisement honestly or to cheat. In this paper, we get the result of the mixed strategy Nash equilibrium solution firstly and then we extend the model to the 2-supervision game model, and then discuss the effect factors when the Ads network is punished due to click fraud. Further more, the model considers the influence on click fraud caused by the competitions between the multi-publishers and then get the new result of the Nash equilibrium solution. Based on the analysis above, click fraud can be effectively prevented in the following ways: intensifying the supervision and control process, implementing penalty on advertising network, reducing information asymmetry, choosing the honest publisher to publish advertisement, building the competitive mechanism, evaluating the online advertising effectiveness in time, and signing detailed operational contract in advance. Key words: Online advertising; Click fraud; Supervision model; Nash equilibriu

Whose Click Fraud Data Do You Trust? Effect Of Click Fraud On Advertiser’s Trust And Sponsored Search Advertising Decisions

Online sponsored search has emerged as a dominant business model for majority of search engines and as a popular advertising mechanism for online retailers. However, sponsored search advertising is being negatively impacted by click fraud which involves the intentional clicking on sponsored links with the purpose of gaining undue monetary returns for the search engine or harming a particular advertiser by depleting its advertising budget. While search engines tend to compensate advertisers to an extent for click frauds, it still leaves an element of uncertainty in the minds of advertisers whether search engine is being faithful in reporting the click fraud numbers. Armed with additional data available from third party click fraud audit companies, advertisers may have more reasons to suspect click fraud numbers reported by search engines if there is a discrepancy between the numbers reported by two sources (search engines and third party click fraud audit companies). While the phenomenon of click fraud has been acknowledged to exist, its effect on sponsored search advertisers’ trust and their decision to advertise with a particular search engine has not been given sufficient attention in the literature. As an initial step, in this research in progress study, we develop a theoretical model to examine the effect of click fraud on advertiser’s trust in search engine and its subsequent impact on advertiser’s decision to adjust advertising spend for different search engines. In this paper, we also outline the proposed experimental design to validate the theoretical model subsequently in future. Broadly, the research suggests that sponsored search advertisers are likely to adjust their advertising spend based on level of trust they have in search engine, click fraud numbers discrepancy, and return on investment obtained from advertising on that particular search engine

Web usage mining for click fraud detection

Estágio realizado na AuditMark e orientado pelo Eng.º Pedro FortunaTese de mestrado integrado. Engenharia Informática e Computação. Faculdade de Engenharia. Universidade do Porto. 201

Click fraud : how to spot it, how to stop it?

Online search advertising is currently the greatest source of revenue for many Internet giants such as Google™, Yahoo!™, and Bing™. The increased number of specialized websites and modern profiling techniques have all contributed to an explosion of the income of ad brokers from online advertising. The single biggest threat to this growth is however click fraud. Trained botnets and even individuals are hired by click-fraud specialists in order to maximize the revenue of certain users from the ads they publish on their websites, or to launch an attack between competing businesses. Most academics and consultants who study online advertising estimate that 15% to 35% of ads in pay per click (PPC) online advertising systems are not authentic. In the first two quarters of 2010, US marketers alone spent $5.7 billion on PPC ads, where PPC ads are between 45 and 50 percent of all online ad spending. On average about$1.5 billion is wasted due to click-fraud. These fraudulent clicks are believed to be initiated by users in poor countries, or botnets, who are trained to click on specific ads. For example, according to a 2010 study from Information Warfare Monitor, the operators of Koobface, a program that installed malicious software to participate in click fraud, made over $2 million in just over a year. The process of making such illegitimate clicks to generate revenue is called click-fraud. Search engines claim they filter out most questionable clicks and either not charge for them or reimburse advertisers that have been wrongly billed. However this is a hard task, despite the claims that brokers\u27 efforts are satisfactory. In the simplest scenario, a publisher continuously clicks on the ads displayed on his own website in order to make revenue. In a more complicated scenario. a travel agent may hire a large, globally distributed, botnet to click on its competitor\u27s ads, hence depleting their daily budget. We analyzed those different types of click fraud methods and proposed new methodologies to detect and prevent them real time. While traditional commercial approaches detect only some specific types of click fraud, Collaborative Click Fraud Detection and Prevention (CCFDP) system, an architecture that we have implemented based on the proposed methodologies, can detect and prevents all major types of click fraud. The proposed solution analyzes the detailed user activities on both, the server side and client side collaboratively to better describe the intention of the click. Data fusion techniques are developed to combine evidences from several data mining models and to obtain a better estimation of the quality of the click traffic. Our ideas are experimented through the development of the Collaborative Click Fraud Detection and Prevention (CCFDP) system. Experimental results show that the CCFDP system is better than the existing commercial click fraud solution in three major aspects: 1) detecting more click fraud especially clicks generated by software; 2) providing prevention ability; 3) proposing the concept of click quality score for click quality estimation. In the CCFDP initial version, we analyzed the performances of the click fraud detection and prediction model by using a rule base algorithm, which is similar to most of the existing systems. We have assigned a quality score for each click instead of classifying the click as fraud or genuine, because it is hard to get solid evidence of click fraud just based on the data collected, and it is difficult to determine the real intention of users who make the clicks. Results from initial version revealed that the diversity of CF attack Results from initial version revealed that the diversity of CF attack types makes it hard for a single counter measure to prevent click fraud. Therefore, it is important to be able to combine multiple measures capable of effective protection from click fraud. Therefore, in the CCFDP improved version, we provide the traffic quality score as a combination of evidence from several data mining algorithms. We have tested the system with a data from an actual ad campaign in 2007 and 2008. We have compared the results with Google Adwords reports for the same campaign. Results show that a higher percentage of click fraud present even with the most popular search engine. The multiple model based CCFDP always estimated less valid traffic compare to Google. Sometimes the difference is as high as 53%. Detection of duplicates, fast and efficient, is one of the most important requirement in any click fraud solution. Usually duplicate detection algorithms run in real time. In order to provide real time results, solution providers should utilize data structures that can be updated in real time. In addition, space requirement to hold data should be minimum. In this dissertation, we also addressed the problem of detecting duplicate clicks in pay-per-click streams. We proposed a simple data structure, Temporal Stateful Bloom Filter (TSBF), an extension to the regular Bloom Filter and Counting Bloom Filter. The bit vector in the Bloom Filter was replaced with a status vector. Duplicate detection results of TSBF method is compared with Buffering, FPBuffering, and CBF methods. False positive rate of TSBF is less than 1% and it does not have false negatives. Space requirement of TSBF is minimal among other solutions. Even though Buffering does not have either false positives or false negatives its space requirement increases exponentially with the size of the stream data size. When the false positive rate of the FPBuffering is set to 1% its false negative rate jumps to around 5%, which will not be tolerated by most of the streaming data applications. We also compared the TSBF results with CBF. TSBF uses only half the space or less than standard CBF with the same false positive probability. One of the biggest successes with CCFDP is the discovery of new mercantile click bot, the Smart ClickBot. We presented a Bayesian approach for detecting the Smart ClickBot type clicks. The system combines evidence extracted from web server sessions to determine the final class of each click. Some of these evidences can be used alone, while some can be used in combination with other features for the click bot detection. During training and testing we also addressed the class imbalance problem. Our best classifier shows recall of 94%. and precision of 89%, with F1 measure calculated as 92%. The high accuracy of our system proves the effectiveness of the proposed methodology. Since the Smart ClickBot is a sophisticated click bot that manipulate every possible parameters to go undetected, the techniques that we discussed here can lead to detection of other types of software bots too. Despite the enormous capabilities of modern machine learning and data mining techniques in modeling complicated problems, most of the available click fraud detection systems are rule-based. Click fraud solution providers keep the rules as a secret weapon and bargain with others to prove their superiority. We proposed validation framework to acquire another model of the clicks data that is not rule dependent, a model that learns the inherent statistical regularities of the data. Then the output of both models is compared. Due to the uniqueness of the CCFDP system architecture, it is better than current commercial solution and search engine/ISP solution. The system protects Pay-Per-Click advertisers from click fraud and improves their Return on Investment (ROI). The system can also provide an arbitration system for advertiser and PPC publisher whenever the click fraud argument arises. Advertisers can gain their confidence on PPC advertisement by having a channel to argue the traffic quality with big search engine publishers. The results of this system will booster the internet economy by eliminating the shortcoming of PPC business model. General consumer will gain their confidence on internet business model by reducing fraudulent activities which are numerous in current virtual internet world

Computational Challenges in E-Commerce

Economic and social sciences will drive Internet protocols and services into the future.Engineering and Applied Science

Поліноми Кунченка для розпізнавання образів

В статті розглянута задача розпізнавання образів за допомогою застосування поліномів наближення Кунченка. Викладення ведеться на прикладі виділення шаблону (зразка) стереотипної поведінки зловмисника, що займається мережевим шахрайством типу «склікування». Запропоновано новий підхід до аналізу часових рядів, що містять дані про «склікування». Показано, що це дозволяє визначити певні типи недійсних переходів по рекламним посиланням. Обґрунтовано перспективність застосування вказаного підходу до дослідження моделей в області статистики та соціології.This paper concerns the task of pattern recognition by using Kunchenko’s approximating polynomials. We take a stereotyped behavior template matching of intruder during click fraud as an example. New approach for clicks’ time series analyzing is proposed. It has been shown, that with the help of proposed techniques it is possible to define some invalid clicks. The prospects for further research in area of statistics and sociology are confirmed

Student Academic Conference 2011

Minnesota State University Moorhead Student Academic Conference abstract book.https://red.mnstate.edu/sac-book/1012/thumbnail.jp