Learning User Behaviors for Advertisements Click Prediction Chieh-Jen Wang & Hsin-Hsi Chen National Taiwan University Taipei, Taiwan.

Slides:



Advertisements
Similar presentations
Predicting User Interests from Contextual Information
Advertisements

A Comparison of Implicit and Explicit Links for Web Page Classification Dou Shen 1 Jian-Tao Sun 2 Qiang Yang 1 Zheng Chen 2 1 Department of Computer Science.
Struggling or Exploring? Disambiguating Long Search Sessions
Temporal Query Log Profiling to Improve Web Search Ranking Alexander Kotov (UIUC) Pranam Kolari, Yi Chang (Yahoo!) Lei Duan (Microsoft)
Psychological Advertising: Exploring User Psychology for Click Prediction in Sponsored Search Date: 2014/03/25 Author: Taifeng Wang, Jiang Bian, Shusen.
Modelling Relevance and User Behaviour in Sponsored Search using Click-Data Adarsh Prasad, IIT Delhi Advisors: Dinesh Govindaraj SVN Vishwanathan* Group:
A Graph-based Recommender System Zan Huang, Wingyan Chung, Thian-Huat Ong, Hsinchun Chen Artificial Intelligence Lab The University of Arizona 07/15/2002.
Particle swarm optimization for parameter determination and feature selection of support vector machines Shih-Wei Lin, Kuo-Ching Ying, Shih-Chieh Chen,
Experiments on Query Expansion for Internet Yellow Page Services Using Log Mining Summarized by Dongmin Shin Presented by Dongmin Shin User Log Analysis.
WSCD INTRODUCTION  Query suggestion has often been described as the process of making a user query resemble more closely the documents it is expected.
Toward Whole-Session Relevance: Exploring Intrinsic Diversity in Web Search Date: 2014/5/20 Author: Karthik Raman, Paul N. Bennett, Kevyn Collins-Thompson.
Query Dependent Pseudo-Relevance Feedback based on Wikipedia SIGIR ‘09 Advisor: Dr. Koh Jia-Ling Speaker: Lin, Yi-Jhen Date: 2010/01/24 1.
1 Learning User Interaction Models for Predicting Web Search Result Preferences Eugene Agichtein Eric Brill Susan Dumais Robert Ragno Microsoft Research.
Estimation of the Number of Relevant Images in Infinite Databases Presented by: Xiaoling Wang Supervisor: Prof. Clement Leung.
Click Evidence Signals and Tasks Vishwa Vinay Microsoft Research, Cambridge.
Context-Aware Query Classification Huanhuan Cao 1, Derek Hao Hu 2, Dou Shen 3, Daxin Jiang 4, Jian-Tao Sun 4, Enhong Chen 1 and Qiang Yang 2 1 University.
Query Log Analysis Naama Kraus Slides are based on the papers: Andrei Broder, A taxonomy of web search Ricardo Baeza-Yates, Graphs from Search Engine Queries.
Personalization in Local Search Personalization of Content Ranking in the Context of Local Search Philip O’Brien, Xiao Luo, Tony Abou-Assaleh, Weizheng.
1 Context-Aware Search Personalization with Concept Preference CIKM’11 Advisor : Jia Ling, Koh Speaker : SHENG HONG, CHUNG.
Automatically Identifying Localizable Queries Center for E-Business Technology Seoul National University Seoul, Korea Nam, Kwang-hyun Intelligent Database.
 An important problem in sponsored search advertising is keyword generation, which bridges the gap between the keywords bidded by advertisers and queried.
Improving Web Search Ranking by Incorporating User Behavior Information Eugene Agichtein Eric Brill Susan Dumais Microsoft Research.
Fan Guo 1, Chao Liu 2 and Yi-Min Wang 2 1 Carnegie Mellon University 2 Microsoft Research Feb 11, 2009.
CIKM’09 Date:2010/8/24 Advisor: Dr. Koh, Jia-Ling Speaker: Lin, Yi-Jhen 1.
Understanding and Predicting Personal Navigation Date : 2012/4/16 Source : WSDM 11 Speaker : Chiu, I- Chih Advisor : Dr. Koh Jia-ling 1.
Presenter: Lung-Hao Lee ( 李龍豪 ) January 7, 309.
Kernel Methods A B M Shawkat Ali 1 2 Data Mining ¤ DM or KDD (Knowledge Discovery in Databases) Extracting previously unknown, valid, and actionable.
Personalizing Search on Shared Devices Ryen White and Ahmed Hassan Awadallah Microsoft Research, USA Contact:
Binxing Jiao et. al (SIGIR ’10) Presenter : Lin, Yi-Jhen Advisor: Dr. Koh. Jia-ling Date: 2011/4/25 VISUAL SUMMARIZATION OF WEB PAGES.
Ensemble Learning Spring 2009 Ben-Gurion University of the Negev.
Deep Learning Powered In- Session Contextual Ranking using Clickthrough Data Xiujun Li 1, Chenlei Guo 2, Wei Chu 2, Ye-Yi Wang 2, Jude Shavlik 1 1 University.
A Novel Local Patch Framework for Fixing Supervised Learning Models Yilei Wang 1, Bingzheng Wei 2, Jun Yan 2, Yang Hu 2, Zhi-Hong Deng 1, Zheng Chen 2.
Analysis of Topic Dynamics in Web Search Xuehua Shen (University of Illinois) Susan Dumais (Microsoft Research) Eric Horvitz (Microsoft Research) WWW 2005.
BEHAVIORAL TARGETING IN ON-LINE ADVERTISING: AN EMPIRICAL STUDY AUTHORS: JOANNA JAWORSKA MARCIN SYDOW IN DEFENSE: XILING SUN & ARINDAM PAUL.
Personalizing Web Search using Long Term Browsing History Nicolaas Matthijs, Cambridge Filip Radlinski, Microsoft In Proceedings of WSDM
Jun Li, Peng Zhang, Yanan Cao, Ping Liu, Li Guo Chinese Academy of Sciences State Grid Energy Institute, China Efficient Behavior Targeting Using SVM Ensemble.
CONFIDENTIAL1 Hidden Decision Trees to Design Predictive Scores – Application to Fraud Detection Vincent Granville, Ph.D. AnalyticBridge October 27, 2009.
Jiafeng Guo(ICT) Xueqi Cheng(ICT) Hua-Wei Shen(ICT) Gu Xu (MSRA) Speaker: Rui-Rui Li Supervisor: Prof. Ben Kao.
1 A Web Search Engine-Based Approach to Measure Semantic Similarity between Words Presenter: Guan-Yu Chen IEEE Trans. on Knowledge & Data Engineering,
Retroactive Answering of Search Queries Beverly Yang Glen Jeh.
Social Tag Prediction Paul Heymann, Daniel Ramage, and Hector Garcia- Molina Stanford University SIGIR 2008.
Iterative similarity based adaptation technique for Cross Domain text classification Under: Prof. Amitabha Mukherjee By: Narendra Roy Roll no: Group:
Post-Ranking query suggestion by diversifying search Chao Wang.
More Than Relevance: High Utility Query Recommendation By Mining Users' Search Behaviors Xiaofei Zhu, Jiafeng Guo, Xueqi Cheng, Yanyan Lan Institute of.
Context-Aware Query Classification Huanhuan Cao, Derek Hao Hu, Dou Shen, Daxin Jiang, Jian-Tao Sun, Enhong Chen, Qiang Yang Microsoft Research Asia SIGIR.
Finding the Right Facts in the Crowd: Factoid Question Answering over Social Media J. Bian, Y. Liu, E. Agichtein, and H. Zha ACM WWW, 2008.
26/01/20161Gianluca Demartini Ranking Categories for Faceted Search Gianluca Demartini L3S Research Seminars Hannover, 09 June 2006.
Divided Pretreatment to Targets and Intentions for Query Recommendation Reporter: Yangyang Kang /23.
11 A Classification-based Approach to Question Routing in Community Question Answering Tom Chao Zhou 1, Michael R. Lyu 1, Irwin King 1,2 1 The Chinese.
KAIST TS & IS Lab. CS710 Know your Neighbors: Web Spam Detection using the Web Topology SIGIR 2007, Carlos Castillo et al., Yahoo! 이 승 민.
Identifying “Best Bet” Web Search Results by Mining Past User Behavior Author: Eugene Agichtein, Zijian Zheng (Microsoft Research) Source: KDD2006 Reporter:
Date: 2013/9/25 Author: Mikhail Ageev, Dmitry Lagun, Eugene Agichtein Source: SIGIR’13 Advisor: Jia-ling Koh Speaker: Chen-Yu Huang Improving Search Result.
A Framework to Predict the Quality of Answers with Non-Textual Features Jiwoon Jeon, W. Bruce Croft(University of Massachusetts-Amherst) Joon Ho Lee (Soongsil.
A Framework for Detection and Measurement of Phishing Attacks Reporter: Li, Fong Ruei National Taiwan University of Science and Technology 2/25/2016 Slide.
Predicting User Interests from Contextual Information R. W. White, P. Bailey, L. Chen Microsoft (SIGIR 2009) Presenter : Jae-won Lee.
Predicting Short-Term Interests Using Activity-Based Search Context CIKM’10 Advisor: Jia Ling, Koh Speaker: Yu Cheng, Hsieh.
Machine Learning: A Brief Introduction Fu Chang Institute of Information Science Academia Sinica ext. 1819
To Personalize or Not to Personalize: Modeling Queries with Variation in User Intent Presented by Jaime Teevan, Susan T. Dumais, Daniel J. Liebling Microsoft.
Distinguishing humans from robots in web search logs preliminary results using query rates and intervals Omer Duskin Dror G. Feitelson School of Computer.
1 Context-Aware Ranking in Web Search (SIGIR 10’) Biao Xiang, Daxin Jiang, Jian Pei, Xiaohui Sun, Enhong Chen, Hang Li 2010/10/26.
Opinion spam and Analysis 소프트웨어공학 연구실 G 최효린 1 / 35.
CMPS 142/242 Review Section Fall 2011 Adapted from Lecture Slides.
1 Clustering Web Queries John S. Whissell, Charles L.A. Clarke, Azin Ashkan CIKM ’ 09 Speaker: Hsin-Lan, Wang Date: 2010/08/31.
Combining Models Foundations of Algorithms and Machine Learning (CS60020), IIT KGP, 2017: Indrajit Bhattacharya.
Lin Lu, Margaret Dunham, and Yu Meng
Personalizing Search on Shared Devices
Detecting Online Commercial Intention (OCI)
Date: 2012/11/15 Author: Jin Young Kim, Kevyn Collins-Thompson,
Efficient Multiple-Click Models in Web Search
Modeling IDS using hybrid intelligent systems
Presentation transcript:

Learning User Behaviors for Advertisements Click Prediction Chieh-Jen Wang & Hsin-Hsi Chen National Taiwan University Taipei, Taiwan

SIGIR 2011 workshop: Internet Advertising Introduction  The commercial value of advertisements on the web depends on whether users click on the advertisements  Predicting potential advertisement clicks of users before target advertisements are displayed is important -advertisement recommendation -advertisement placement -presentation pricing  Problem specification -Given a current search session (q 1, q 2,..., q (i-1) ), we will predict if there is an ad click event when query q i is submitted.

SIGIR 2011 workshop: Internet Advertising Related Work  Advertisiment click prediction model -Feature representation text features (Richardson et al., 2007) demographics features (Cheng & Cantú-Paz, 2010) mouse trajectory features (Guo & Agichtein, 2010) -Machine learning algorithm logistic regression (Richardson, Dominowska, & Ragno, 2007) maximum entropy (Cheng & Cantú-Paz, 2010) support vector machines (Broder et al., 2008) conditional random field (Guo & Agichtein, 2010)

SIGIR 2011 workshop: Internet Advertising Related Work  User search intent -navigational, informational and transactional (Broder, 2002) -noncommercial/commercial & navigational/informational (Ashkan et al., 2009) -research & purchase (Guo & Agichtein, 2010) -receptive & not receptive (Guo & Agichtein, 2010) “receptive” (i.e., an advertisement click is expected in a future search within the current session) “not receptive” (i.e., not any future advertisement clicks are expected within the current session)

SIGIR 2011 workshop: Internet Advertising Overview

SIGIR 2011 workshop: Internet Advertising Overview

SIGIR 2011 workshop: Internet Advertising Microsoft AdCenter Logs  Time: ~ (84 days)  The Microsoft AdCenter logs include: -101 million impressions million clicks million sessions (5.06 million sessions contain at least one click)  An impression is defined as a single search results page described by a set of attributes  A session is defined by a repeated search engine usage of intervals of 10 minutes and less, with a total session not longer then 8 hours

SIGIR 2011 workshop: Internet Advertising Data Purify  For the purposes of promotions, some specific queries are issued or advertisements are clicked by software robots  Filter criteria -issue queries more than 7 times in any 10 second interval -issue queries at two distinct places at the same time -click an advertisement more than one time in any 5 second interval -duplicated impression IDs  Data partition -Training: sessions which contain at least one advertisement click in the first 56 days -Testing: sessions in the last 28 days

SIGIR 2011 workshop: Internet Advertising Experiment Datasets TrainingTesting # of sessions (clicks)3.12M1.42M # of sessions (non-clicks)010.61M # of click impressions3.75M1.73M # of non-click impressions6.92M37.41M

SIGIR 2011 workshop: Internet Advertising Overview

SIGIR 2011 workshop: Internet Advertising Feature Extraction  Feature representation -Every impression q i (1  i  n) in session s = (q 1, q 2,..., q (i-1), q i, q (i+1),..., q n ) is represented as a feature vector -q i itself (Current Impression Level) -the first impression q 1 (First Impression Level) -the previous n impression q (i-n) (Previous n Impression Level) -all the contextual impressions q 1, q 2,..., q (i-1) in s (Contextual Impression Level)  Labeling -click if impression q i contains at least one advertisement click, otherwise non- click.

SIGIR 2011 workshop: Internet Advertising Feature Extraction from Current Impression Level  These features aim to capture query information, users’ intent and the similarity between current query an previous one  QC (query category) -14 categories (exclusive of “Regional” and “World”) on the 2nd level of the Open Directory Project (ODP) ontology to represent query categories  QIntent (query intent) -4,020 intent clusters are learned from MSN Search Query Log excerpt (Wang et al., 2010) -QIntent is specified by the distribution of the top 100 similar intent clusters FeatureDescriptionFeatureDescription QP Position of q i in s, i.e., iQtypeType of query in q i : information, navigation, or transaction #QT Number of query terms in q i QCODP categories of query in q i QT Query terms in q i QIntentIntent type of query in q i IsURLQ1 if the query in q i is in the form of a URL, and 0 otherwise QSim Cosine similarity between query terms in q i and q i-1 QDMADMA level user location ID of q i QOverlapOverlapping between query terms in q i and q i-1

SIGIR 2011 workshop: Internet Advertising Feature Extraction from First Impression Level  These features aim to capture an initial search goal of a session. FeatureDescriptionFeatureDescription FQQuery terms in q 1 TimeToFQTime duration (in seconds) between q 1 and q i

SIGIR 2011 workshop: Internet Advertising Feature Extraction from Previous n Impression Level  These features aim to capture the advertisements clicks information of the previous n impression.  In our experiments, n is set to 1 and 2 FeatureDescriptionFeatureDescription PNP n Page number of the result page of q (i-n) ClickDNP n URLdomain names of clicked advertisements in the result page of q (i-n) #AdP n Number of advertisements displayed in the result page of q (i-n) AdCP n ODP categories of the clicked advertisements in q (i-n) IsClickP n 1 if there is at least one advertisement click in q (i-n), and 0 otherwise AdIntentP n Intent types of the clicked advertisements in q (i-n) T#ClickP n Total number of clicked advertisements in q (i-n) TimeToP n Time duration (in seconds) between q (i-n) and q i ClickRP n The ranks of clicked advertisements in the result page of q (i-n) #AdoverlapDisplayed advertisements overlapping between q i-n and q i-(n+1)

SIGIR 2011 workshop: Internet Advertising Feature Extraction from Contextual Impression Level FeatureDescriptionFeatureDescription T#AdTotal advertisements reported in q 1, q 2,..., q (i-1) ConClicki-j where qj, q(j+1),..., q(i-1) contain clicked advertisements continuously T#ClickTotal number of clicked advertisements in q 1, q 2,..., q (i-1) NearClicki-j where qj is the nearest impression containing clicked advertisements CTRAdvertisements click through ratio before qi = total clicked ads divided by total ads before qi CTQCODP categories of queries in q1, q2,..., q(i-1) number of advertisement reports at rank m of q1, q2,..., q(i-1), where m=1, 2,..., 8 CTQIntentIntent types of queries in q1, q2,..., q(i-1) m Total number of advertisements clicks at each rank of q1, q2,..., q(i-1) CTAdCODP categories of clicked advertisements in q1, q2,..., q(i-1) through ratio for each rank at q1, q2,..., q(i-1) CTAdIntentIntent types of clicked advertisements in q1, q2,..., q(i-1) T#ConCli ck Total number of advertisements clicked in q 1, q 2,..., q (i-1) CTIntentDisIntents of clicked advertisements in q1, q2,..., q(i-1) after disambiguation

SIGIR 2011 workshop: Internet Advertising Feature Extraction from Contextual Impression Level  These features represent a sequence of users’ behaviors  Weight of intent types of submitted queries (CTQIntent) and clicked advertisements (CTAdIntent) in the access history is defined as: -P m is a probability of the type m intent -w j denotes a query or a clicked advertisement in q j  Weight of ODP categories (CTQC & CTAdC) Jelinek-mercer smoothing

SIGIR 2011 workshop: Internet Advertising Overview

SIGIR 2011 workshop: Internet Advertising Click Prediction Model  Four learning algorithms -Conditional Random Fields (CRF) -Support Vector Machine (SVM) kernel function (RBF, linear kernel) parameter optimization (grid algorithm for c and g) -Decision Tree C4.5 Tree -Back-Propagation Neural Networks Hidden Layer =2 Learning rate = 0.8 Momentum = 0.2

SIGIR 2011 workshop: Internet Advertising Feature Selection Algorithm  Random Subspace Method (RS) -an ensemble classifier that consists of several classifiers -prediction is through a majority vote from the classifiers  F-Score (FS) & Information Gain (IG) -greedy inclusion algorithm -retain a number of the best terms or features for use by the classier

SIGIR 2011 workshop: Internet Advertising Overview

SIGIR 2011 workshop: Internet Advertising Performance of Advertisements Click Prediction All FeaturesNon-click typeClick type ModelAccPrecRecF1F1PrecRecF1F1 Guess MM CRF DT BPN SVM (RBF) SVM (Linear)  Metrics -accuracy (Acc), precision (Prec), recall (Rec), and F-measure (F1)  Baseline -guessing the majority class (non-click) is one baseline. -Markov Model (MM), formulated by query transition.

SIGIR 2011 workshop: Internet Advertising Performance of Feature Selection Features SelectionNon-click typeClick type ModelAccPrecRecF1F1PrecRecF1F1 CRF(ALL) CRF(RS15) CRF(RS25) CRF(RS35) CRF(RS45) CRF(FS) CRF(IG) SVM(ALL) SVM(RS15) SVM(RS25) SVM(RS35) SVM(RS45) SVM(FS) SVM(IG)

SIGIR 2011 workshop: Internet Advertising Top-10 Important Features F-ScoreInformation Gain RankFeatureFLRIFeatureFLRI 1QTCI1QTCI1 2CTAdIntentCT CTIntent Dis CT CTIntent Dis CT0.6498CTQIntentCT CTQIntentCT0.5092T#ClickP 1 PI FQFI0.3557CTRCT IsClickP 1 PI0.3222T#AdCT CTRCT0.3052ConClickCT T#ClickP 1 PI0.2943CTAdIntentCT ConClickCT0.2688NearClickCT NearClickCT0.2568QtypeCI0.2082

SIGIR 2011 workshop: Internet Advertising Conclusion and Future Work  We explore the effects of various intent-related features on advertisements click prediction  CRF model performs better than two baselines and SVM significantly  When random subspace method is introduced to feature selection, the precision of click prediction is increased from to  In the future, we plan to expand our model to consider fine-grained user intent and user interactions  In addition, we will extend this approach to predict which advertisements will be clicked

SIGIR 2011 workshop: Internet Advertising Thank You Q & A