Adaptive targeting for online advertisement

We consider the problem of adaptive targeting for real-time bidding for internet advertisement. This problem involves making fast decisions on whether to show a given ad to a particular user. For intelligent platforms, these decisions are based on information extracted from big data sets containing records of previous impressions, clicks and subsequent purchases. We discuss several strategies for maximizing the click through rate, which is often the main criteria of measuring the success of an advertisement campaign. In the second part of the paper, we provide some results of statistical analysis of real data

Adaptive designs for optimizing online advertisement campaigns

We investigate the problem of adaptive targeting for real-time bidding in online advertisement using independent advertisement exchanges. This is a problem of making decisions based on information extracted from large data sets related to previous experience. We describe an adaptive strategy for optimizing the click through rate which is a key criterion used by advertising platforms to measure the efficiency of an advertisement campaign.We also provide some results of statistical analysis of real data

Is adaptation of e-advertising the way forward?

E-advertising is a multi-billion dollar industry that has shown exponential growth in the last few years. However, although the number of users accessing the Internet increases, users don’t respond positively to adverts. Adaptive e-advertising may be the key to ensuring effectiveness of the ads reaching their target. Moreover, social networks are good sources of user information and can be used to extract user behaviour and characteristics for presentation of personalized advertising. Here we present a two-sided study based on two questionnaires, one directed to Internet users and the other to businesses. Our study shows that businesses agree that personalized advertising is the best way for the future, to maximize effectiveness and profit. In addition, our results indicate that most Internet users would prefer adaptive advertisements. From this study, we can propose a new design for a system that meets both Internet users’ and businesses’ requirements

An exploratory study to design an adaptive hypermedia system for online-advertisement

The revolutionary world of the World Wide Web has created an open space for a multitude of fields to develop and propagate. One of these major fields is advertisement. Online advertisement has become one of the main activities conducted on the web, heavily supported by the industry. Importantly, it is one of the main contributors to any businesses’ income. However, consumers usually ignore the great majority of adverts online. This research paper studies the field of online advertisement, by conducting an exploratory study to understand end users’ needs for targeted online advertisement using adaptive hypermedia techniques. Additionally, we explore social networks, one of the booming phenomena of the web, to enhance the appropriateness of the advertising to the users. The main current outcome of this research is that end users are interested in personalised advertisement that tackles their needs and that they believe that the use of social networks and social actions help in the contextualisation of advertisement

Market-based Recommendation: Agents that Compete for Consumer Attention

The amount of attention space available for recommending suppliers to consumers on e-commerce sites is typically limited. We present a competitive distributed recommendation mechanism based on adaptive software agents for efficiently allocating the 'consumer attention space', or banners. In the example of an electronic shopping mall, the task is delegated to the individual shops, each of which evaluates the information that is available about the consumer and his or her interests (e.g. keywords, product queries, and available parts of a profile). Shops make a monetary bid in an auction where a limited amount of 'consumer attention space' for the arriving consumer is sold. Each shop is represented by a software agent that bids for each consumer. This allows shops to rapidly adapt their bidding strategy to focus on consumers interested in their offerings. For various basic and simple models for on-line consumers, shops, and profiles, we demonstrate the feasibility of our system by evolutionary simulations as in the field of agent-based computational economics (ACE). We also develop adaptive software agents that learn bidding strategies, based on neural networks and strategy exploration heuristics. Furthermore, we address the commercial and technological advantages of this distributed market-based approach. The mechanism we describe is not limited to the example of the electronic shopping mall, but can easily be extended to other domains

Adaptive targeting in online advertisement: models based on relative influence of factors

We consider the problem of adaptive targeting for real-time bidding for internet advertisement. This problem involves making fast decisions on whether to show a given ad to a particular user. For demand partners, these decisions are based on information extracted from big data sets containing records of previous impressions, clicks and subsequent purchases. We discuss several criteria which allow us to assess the significance of different factors on probabilities of clicks and conversions. We then devise simple strategies that are based on the use of the most influential factors and compare their performance with strategies that are much more computationally demanding. To make the numerical comparison, we use real data collected by Crimtan in the process of running several recent ad campaigns

Profiling user activities with minimal traffic traces

Understanding user behavior is essential to personalize and enrich a user's online experience. While there are significant benefits to be accrued from the pursuit of personalized services based on a fine-grained behavioral analysis, care must be taken to address user privacy concerns. In this paper, we consider the use of web traces with truncated URLs - each URL is trimmed to only contain the web domain - for this purpose. While such truncation removes the fine-grained sensitive information, it also strips the data of many features that are crucial to the profiling of user activity. We show how to overcome the severe handicap of lack of crucial features for the purpose of filtering out the URLs representing a user activity from the noisy network traffic trace (including advertisement, spam, analytics, webscripts) with high accuracy. This activity profiling with truncated URLs enables the network operators to provide personalized services while mitigating privacy concerns by storing and sharing only truncated traffic traces. In order to offset the accuracy loss due to truncation, our statistical methodology leverages specialized features extracted from a group of consecutive URLs that represent a micro user action like web click, chat reply, etc., which we call bursts. These bursts, in turn, are detected by a novel algorithm which is based on our observed characteristics of the inter-arrival time of HTTP records. We present an extensive experimental evaluation on a real dataset of mobile web traces, consisting of more than 130 million records, representing the browsing activities of 10,000 users over a period of 30 days. Our results show that the proposed methodology achieves around 90% accuracy in segregating URLs representing user activities from non-representative URLs