1 Learning to Impress in Sponsored Search Xin Supervisors: Prof. King and Prof. Lyu.

Slides:



Advertisements
Similar presentations
Online Ad Auctions By : Hal R. Varian Reviewed By : Sahil Gupta Instructor : Professor Mattmann TA: Kaijan Xu 14/11/2013.
Advertisements

Data Mining and Text Analytics Advertising Laura Quinn.
Psychological Advertising: Exploring User Psychology for Click Prediction in Sponsored Search Date: 2014/03/25 Author: Taifeng Wang, Jiang Bian, Shusen.
Suleyman Cetintas 1, Monica Rogati 2, Luo Si 1, Yi Fang 1 Identifying Similar People in Professional Social Networks with Discriminative Probabilistic.
1 Evaluation Rong Jin. 2 Evaluation  Evaluation is key to building effective and efficient search engines usually carried out in controlled experiments.
Minimizing Seed Set for Viral Marketing Cheng Long & Raymond Chi-Wing Wong Presented by: Cheng Long 20-August-2011.
Web Metrics This module covers the concepts of hits, pageviews, visits, visitors, clickthrough rate, cost per click, cost per order, cost per customer.
1 Ravi Vatrapu Thursday, 15-July-2010 Kilen 2.75, CBS, Frederiksberg, Denmark DØK HU2D - Internet Marketing: Lecture 15 Course Webpage:
Catching the Drift: Learning Broad Matches from Clickthrough Data Sonal Gupta, Mikhail Bilenko, Matthew Richardson University of Texas at Austin, Microsoft.
WSCD INTRODUCTION  Query suggestion has often been described as the process of making a user query resemble more closely the documents it is expected.
The Evolution of Online Advertisement Casey Shannon CompSci 49S February 21, 2008.
Integrating Bayesian Networks and Simpson’s Paradox in Data Mining Alex Freitas University of Kent Ken McGarry University of Sunderland.
1 Ravi Vatrapu Sponsored Search: History and Terminology Fain, D., & Pedersen, J. (2006) Sponsored search: A brief history. Sponsored search:
ONLINE EXPANSION OF RARE QUERIES FOR SPONSORED SEARCH attack Chih-Hung Wu.
Carnegie Mellon 1 Maximum Likelihood Estimation for Information Thresholding Yi Zhang & Jamie Callan Carnegie Mellon University
Time-dependent Similarity Measure of Queries Using Historical Click- through Data Qiankun Zhao*, Steven C. H. Hoi*, Tie-Yan Liu, et al. Presented by: Tie-Yan.
Presented by Li-Tal Mashiach Learning to Rank: A Machine Learning Approach to Static Ranking Algorithms for Large Data Sets Student Symposium.
Dept. of Computer Science & Engineering, CUHK Pseudo Relevance Feedback with Biased Support Vector Machine in Multimedia Retrieval Steven C.H. Hoi 14-Oct,
A Search-based Method for Forecasting Ad Impression in Contextual Advertising Defense.
Jennifer Ford.  Blog – A type of website or online journal that allows you to publish articles and updates that visitors.
CLICK FRAUD Alexander Tuzhilin By Vinny Rey. Why was the study done? Google was getting sued by advertisers because of click fraud. Google agreed to have.
Artur Strzelecki.  10 teams  10 non-profit organizations  6 students per team  2 weeks of developing campaigns  ~50€
Measure the total value of your Display Campaigns View-Through Conversion Reporting on the Google Display Network.
Query Planning for Searching Inter- Dependent Deep-Web Databases Fan Wang 1, Gagan Agrawal 1, Ruoming Jin 2 1 Department of Computer.
Harini Sridharan Stephen Duraski.  Behavioral Targeting (BT) is a technique that uses a user’s web-browsing behavior to determine which ads to display.
TransRank: A Novel Algorithm for Transfer of Rank Learning Depin Chen, Jun Yan, Gang Wang et al. University of Science and Technology of China, USTC Machine.
Advisor: Hsin-Hsi Chen Reporter: Chi-Hsin Yu Date:
1 CS 178H Introduction to Computer Science Research What is CS Research?
HAL R VARIAN FEBRUARY 16, 2009 PRESENTED BY : SANKET SABNIS Online Ad Auctions 1.
Active Learning for Class Imbalance Problem
1 Effective Fusion-based Approaches for Recommender Systems Xin Supervisors: Prof. King and Prof. Lyu Thesis Committees: Prof. Lam, Prof. Lui, and Prof.
APPLYING EPSILON-DIFFERENTIAL PRIVATE QUERY LOG RELEASING SCHEME TO DOCUMENT RETRIEVAL Sicong Zhang, Hui Yang, Lisa Singh Georgetown University August.
CPS 49S Google: The Computer Science Within and its Impact on Society Shivnath Babu Spring 2007.
Philosophy of IR Evaluation Ellen Voorhees. NIST Evaluation: How well does system meet information need? System evaluation: how good are document rankings?
Focused Matrix Factorization for Audience Selection in Display Advertising BHARGAV KANAGAL, AMR AHMED, SANDEEP PANDEY, VANJA JOSIFOVSKI, LLUIS GARCIA-PUEYO,
User Browsing Graph: Structure, Evolution and Application Yiqun Liu, Yijiang Jin, Min Zhang, Shaoping Ma, Liyun Ru State Key Lab of Intelligent Technology.
Ruirui Li, Ben Kao, Bin Bi, Reynold Cheng, Eric Lo Speaker: Ruirui Li 1 The University of Hong Kong.
CIKM’09 Date:2010/8/24 Advisor: Dr. Koh, Jia-Ling Speaker: Lin, Yi-Jhen 1.
Personalized Search Cheng Cheng (cc2999) Department of Computer Science Columbia University A Large Scale Evaluation and Analysis of Personalized Search.
1 Discovering Authorities in Question Answer Communities by Using Link Analysis Pawel Jurczyk, Eugene Agichtein (CIKM 2007)
Protecting Sensitive Labels in Social Network Data Anonymization.
Online Learning for Collaborative Filtering
Pay Per Click (PPC) – Advertising Jump Start Your Internet Marketing! IMMEDIATE RESULTS WITH UNMATCHED COST – EFFICIENCY! Not only can you begin generating.
Search Engine Marketing The Tools of Online Marketing and Thought Leadership.
Improving Cloaking Detection Using Search Query Popularity and Monetizability Kumar Chellapilla and David M Chickering Live Labs, Microsoft.
Exploiting Context Analysis for Combining Multiple Entity Resolution Systems -Ramu Bandaru Zhaoqi Chen Dmitri V.kalashnikov Sharad Mehrotra.
BEHAVIORAL TARGETING IN ON-LINE ADVERTISING: AN EMPIRICAL STUDY AUTHORS: JOANNA JAWORSKA MARCIN SYDOW IN DEFENSE: XILING SUN & ARINDAM PAUL.
Exploit of Online Social Networks with Community-Based Graph Semi-Supervised Learning Mingzhen Mo and Irwin King Department of Computer Science and Engineering.
Query Segmentation Using Conditional Random Fields Xiaohui and Huxia Shi York University KEYS’09 (SIGMOD Workshop) Presented by Jaehui Park,
Jiafeng Guo(ICT) Xueqi Cheng(ICT) Hua-Wei Shen(ICT) Gu Xu (MSRA) Speaker: Rui-Rui Li Supervisor: Prof. Ben Kao.
Presentation Template KwangSoo Yang Florida Atlantic University College of Engineering & Computer Science.
Diversifying Search Results Rakesh AgrawalSreenivas GollapudiSearch LabsMicrosoft Research Alan HalversonSamuel.
Supporting Privacy Protection in Personalized Web Search.
More Than Relevance: High Utility Query Recommendation By Mining Users' Search Behaviors Xiaofei Zhu, Jiafeng Guo, Xueqi Cheng, Yanyan Lan Institute of.
A New Algorithm for Inferring User Search Goals with Feedback Sessions.
Nonlinear differential equation model for quantification of transcriptional regulation applied to microarray data of Saccharomyces cerevisiae Vu, T. T.,
Evolving RBF Networks via GP for Estimating Fitness Values using Surrogate Models Ahmed Kattan Edgar Galvan.
Data Consolidation: A Task Scheduling and Data Migration Technique for Grid Networks Author: P. Kokkinos, K. Christodoulopoulos, A. Kretsis, and E. Varvarigos.
Identifying “Best Bet” Web Search Results by Mining Past User Behavior Author: Eugene Agichtein, Zijian Zheng (Microsoft Research) Source: KDD2006 Reporter:
Learning to Rank: From Pairwise Approach to Listwise Approach Authors: Zhe Cao, Tao Qin, Tie-Yan Liu, Ming-Feng Tsai, and Hang Li Presenter: Davidson Date:
Facilitating Document Annotation Using Content and Querying Value.
Usefulness of Quality Click- through Data for Training Craig Macdonald, ladh Ounis Department of Computing Science University of Glasgow, Scotland, UK.
Useful phrases/words: referring to literature Heeyeul Kwon November 25 th, 2014 English Seminar Technology Management Lab Department of Industrial Engineering.
Presented BY SIVA S Zinavo Technologies PAY PER CLICK.
What to Look for in Pay Per Click Management Published by:
Preface to the special issue on context-aware recommender systems
FRM: Modeling Sponsored Search Log with Full Relational Model
Copyright © 2011 Pearson Education, Inc. Publishing as Prentice Hall
A Large Scale Prediction Engine for App Install Clicks and Conversions
Deep Learning for the Soft Cutoff Problem
Presentation transcript:

1 Learning to Impress in Sponsored Search Xin Supervisors: Prof. King and Prof. Lyu

2 Sponsored Search Pay-per-click model: advertisers will pay an amount of money to search engine company once their ads shown in sponsored search results are clicked by users. organic results sponsored search results query sponsored search results

3 Sponsored Search is Important Online advertising has obtained more and more money in recent years. Sponsored search takes the main contribution for online advertising.

4 Impression in Sponsored Search Ad Impression Number: The number of the advertisements shown to a user for a certain query in sponsored search. The research task: How many ads should be shown to users given a query?

5 Why learning the Ad impression number is important?

6 The Roles in Sponsored Search Advertiser Agency UserPublisher Advertisers wants ROI and volume dual roles Ad network wants the amount of users and advertisers User wants relevance Publisher wants revenue per impressions/search Balance the utilities of advertisers, users, and publishers

7 If we do not control the Ad impression number…

8 Hidden Commercial Intrusion –Users will not be satisfied. Some users will not use the search engine Existing users will be trained to ignore the ads. –Advertisers will have less ROI. –Publishers will get less money. –The whole network will become smaller.

9 Evidences of Commercial Intrusion Users have shown bias against sponsored search results [Marable 2003]. More than 82% of users will see organic results first [Jansen 2006]. Organic results have obtained much higher clickthrough rate [Danescu- Niculescu-Mizil 2010]. Irrelevant ads will train the users to ignore ads [Buscher 2010] –Learning to impress is an important research issue in sponsored search

10 Motivation Previous work is mainly about estimating the expected revenue of a query-ad pair. This paper is focusing on the strategy to impress ads

11 Our Contributions Formulate the task of learning to impress in sponsored search We show that the revenues of query-ads pairs are not stable and therefore static method cannot work well. We propose a novel dynamic approach for the unstable problem. We combine the dynamic and static methods for another improvement.

12 Problem Definition

13 Evaluation Metric The smaller the better.

14 Dataset Sogou click-though data.

15 Static Method

16 Experimental Result

17 Unstable problem (1)

18 Unstable Problem (2)

19 Unstable Problem (3)

20 Unstable Problem (4)

21 Dynamic Method

22 Algorithm

23 Theoretically Analysis

24 Experimental Analysis (1)

25 Experimental Analysis (2)

26 Experimental Analysis(3)

27 Combination method

28 Real Value in Application

29 Conclusion We formulate the problem of learning to impress task in sponsored search We demonstrate the unstable problem We propose a dynamic algorithm that can well solve the unstable problem The combination method outperform static methods significantly