Psychological Advertising: Exploring User Psychology for Click Prediction in Sponsored Search Date: 2014/03/25 Author: Taifeng Wang, Jiang Bian, Shusen.

Slides:



Advertisements
Similar presentations
Chapter 11 Attitude and Attitude Change
Advertisements

1 Copyright © 2010, Elsevier Inc. All rights Reserved Fig 2.1 Chapter 2.
Search Engine Optimization
By D. Fisher Geometric Transformations. Reflection, Rotation, or Translation 1.
A Novel Visualization Model for Web Search Results An Application of the Solar System Metaphor Tien N. Nguyen and Jin Zhang Electrical and Computer Engineering.
Business Transaction Management Software for Application Coordination 1 Business Processes and Coordination.
Exploring Traversal Strategy for Web Forum Crawling Yida Wang, Jiang-Ming Yang, Wei Lai, Rui Cai, Lei Zhang and Wei-Ying Ma Chinese Academy of Sciences.
Jeopardy Q 1 Q 6 Q 11 Q 16 Q 21 Q 2 Q 7 Q 12 Q 17 Q 22 Q 3 Q 8 Q 13
Jeopardy Q 1 Q 6 Q 11 Q 16 Q 21 Q 2 Q 7 Q 12 Q 17 Q 22 Q 3 Q 8 Q 13
Title Subtitle.
Multiplying binomials You will have 20 seconds to answer each of the following multiplication problems. If you get hung up, go to the next problem when.
0 - 0.
DIVIDING INTEGERS 1. IF THE SIGNS ARE THE SAME THE ANSWER IS POSITIVE 2. IF THE SIGNS ARE DIFFERENT THE ANSWER IS NEGATIVE.
ADDING INTEGERS 1. POS. + POS. = POS. 2. NEG. + NEG. = NEG. 3. POS. + NEG. OR NEG. + POS. SUBTRACT TAKE SIGN OF BIGGER ABSOLUTE VALUE.
MULT. INTEGERS 1. IF THE SIGNS ARE THE SAME THE ANSWER IS POSITIVE 2. IF THE SIGNS ARE DIFFERENT THE ANSWER IS NEGATIVE.
Addition Facts
ZMQS ZMQS
Internet Search Engine freshness by Web Server help Presented by: Barilari Alessandro.
Date : 2012/09/20 Author : Sina Fakhraee, Farshad Fotouhi Source : KEYS12 Speaker : Er-Gang Liu Advisor : Dr. Jia-ling Koh 1.
Learning to Question: Leveraging User Preferences for Shopping Advice
Date: 2013/1/17 Author: Yang Liu, Ruihua Song, Yu Chen, Jian-Yun Nie and Ji-Rong Wen Source: SIGIR12 Advisor: Jia-ling Koh Speaker: Chen-Yu Huang Adaptive.
Learning to Suggest: A Machine Learning Framework for Ranking Query Suggestions Date: 2013/02/18 Author: Umut Ozertem, Olivier Chapelle, Pinar Donmez,
ABC Technology Project
MARKETING INFORMATION AND RESEARCH
ACM CIKM 2008, Oct , Napa Valley 1 Mining Term Association Patterns from Search Logs for Effective Query Reformulation Xuanhui Wang and ChengXiang.
1 Sizing the Streaming Media Cluster Solution for a Given Workload Lucy Cherkasova and Wenting Tang HPLabs.
1 Undirected Breadth First Search F A BCG DE H 2 F A BCG DE H Queue: A get Undiscovered Fringe Finished Active 0 distance from A visit(A)
© Arjen P. de Vries Arjen P. de Vries Fascinating Relationships between Media and Text.
CAR Training Module PRODUCT REGISTRATION and MANAGEMENT Module 2 - Register a New Document - Without Alternate Formats (Run as a PowerPoint show)
RecMax – Can we combine the power of Social Networks and Recommender Systems? Amit Goyal and L. RecMax: Exploting Recommender Systems for Fun and Profit.
Traditional IR models Jian-Yun Nie.
GG Consulting, LLC I-SUITE. Source: TEA SHARS Frequently asked questions 2.
Addition 1’s to 20.
25 seconds left…...
Music Recommendation by Unified Hypergraph: Music Recommendation by Unified Hypergraph: Combining Social Media Information and Music Content Jiajun Bu,
1 Minimally Supervised Morphological Analysis by Multimodal Alignment David Yarowsky and Richard Wicentowski.
Week 1.
We will resume in: 25 Minutes.
1 Unit 1 Kinematics Chapter 1 Day
Introduction Distance-based Adaptable Similarity Search
CO-AUTHOR RELATIONSHIP PREDICTION IN HETEROGENEOUS BIBLIOGRAPHIC NETWORKS Yizhou Sun, Rick Barber, Manish Gupta, Charu C. Aggarwal, Jiawei Han 1.
Learning to Recommend Questions Based on User Ratings Ke Sun, Yunbo Cao, Xinying Song, Young-In Song, Xiaolong Wang and Chin-Yew Lin. In Proceeding of.
22 nd User Modeling, Adaptation and Personalization (UMAP 2014) Time-Sensitive User Profile for Optimizing Search Personalization Ameni Kacem, Mohand Boughanem,
Date : 2014/06/10 Author :Shahab Kamali Frank Wm. Tompa Source : SIGIR’13 Advisor : Jia-ling Koh Speaker : Shao-Chun Peng Retrieving Documents With Mathematical.
DQR : A Probabilistic Approach to Diversified Query recommendation Date: 2013/05/20 Author: Ruirui Li, Ben Kao, Bin Bi, Reynold Cheng, Eric Lo Source:
Diversity Maximization Under Matroid Constraints Date : 2013/11/06 Source : KDD’13 Authors : Zeinab Abbassi, Vahab S. Mirrokni, Mayur Thakur Advisor :
A Phrase Mining Framework for Recursive Construction of a Topical Hierarchy Date : 2014/04/15 Source : KDD’13 Authors : Chi Wang, Marina Danilevsky, Nihit.
1.Accuracy of Agree/Disagree relation classification. 2.Accuracy of user opinion prediction. 1.Task extraction performance on Bing web search log with.
Jean-Eudes Ranvier 17/05/2015Planet Data - Madrid Trustworthiness assessment (on web pages) Task 3.3.
Query Dependent Pseudo-Relevance Feedback based on Wikipedia SIGIR ‘09 Advisor: Dr. Koh Jia-Ling Speaker: Lin, Yi-Jhen Date: 2010/01/24 1.
AdWords Instructor: Dawn Rauscher. Quality Score in Action 0a2PVhPQhttp:// 0a2PVhPQ.
 An important problem in sponsored search advertising is keyword generation, which bridges the gap between the keywords bidded by advertisers and queried.
UOS 1 Ontology Based Personalized Search Zhang Tao The University of Seoul.
CIKM’09 Date:2010/8/24 Advisor: Dr. Koh, Jia-Ling Speaker: Lin, Yi-Jhen 1.
Exploring Online Social Activities for Adaptive Search Personalization CIKM’10 Advisor : Jia Ling, Koh Speaker : SHENG HONG, CHUNG.
ON THE SELECTION OF TAGS FOR TAG CLOUDS (WSDM11) Advisor: Dr. Koh. Jia-Ling Speaker: Chiang, Guang-ting Date:2011/06/20 1.
Enhancing Cluster Labeling Using Wikipedia David Carmel, Haggai Roitman, Naama Zwerdling IBM Research Lab (SIGIR’09) Date: 11/09/2009 Speaker: Cho, Chin.
Date : 2013/03/18 Author : Jeffrey Pound, Alexander K. Hudek, Ihab F. Ilyas, Grant Weddell Source : CIKM’12 Speaker : Er-Gang Liu Advisor : Prof. Jia-Ling.
Jiafeng Guo(ICT) Xueqi Cheng(ICT) Hua-Wei Shen(ICT) Gu Xu (MSRA) Speaker: Rui-Rui Li Supervisor: Prof. Ben Kao.
A Classification-based Approach to Question Answering in Discussion Boards Liangjie Hong, Brian D. Davison Lehigh University (SIGIR ’ 09) Speaker: Cho,
Post-Ranking query suggestion by diversifying search Chao Wang.
Date: 2012/11/29 Author: Chen Wang, Keping Bi, Yunhua Hu, Hang Li, Guihong Cao Source: WSDM’12 Advisor: Jia-ling, Koh Speaker: Shun-Chen, Cheng.
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.
Predicting Short-Term Interests Using Activity-Based Search Context CIKM’10 Advisor: Jia Ling, Koh Speaker: Yu Cheng, Hsieh.
Customized of Social Media Contents using Focused Topic Hierarchy
Click Through Rate Prediction for Local Search Results
Improving Search Relevance for Short Queries in Community Question Answering Date: 2014/09/25 Author : Haocheng Wu, Wei Wu, Ming Zhou, Enhong Chen, Lei.
A Large Scale Prediction Engine for App Install Clicks and Conversions
Date: 2012/11/15 Author: Jin Young Kim, Kevyn Collins-Thompson,
Presentation transcript:

Psychological Advertising: Exploring User Psychology for Click Prediction in Sponsored Search Date: 2014/03/25 Author: Taifeng Wang, Jiang Bian, Shusen Liu*, Yuyu Zhang*, Tie-Yan Liu Source: KDD’ 13 Advisor: Jia-Ling Koh Speaker: Sz-Han Wang

Outline  Introduction  Method  Experiments  Conclusion 2

Introduction  As an online advertising system, sponsored search has been one of the most important business models for commercial Web search engines. 3 Sponsored search

Introduction  A sponsored search consists of a couple of technical components  query-to-ad matching  click prediction for matched ads  filtration of the ads according to thresholds for relevance and click probability,  auction to determine the ranking, placement, and pricing of the remaining ads  Employ a machine learning model to predict the probability that a user clicks an ad  Historical click information  Relevance information 4

Introduction  In order for more accurate click prediction, we need to examine why users click  Propose modeling user psychological desire for both ads and users based on textual patterns in sponsored search according to Maslow’s desire theory 5

Outline  Introduction  Method  Experiments  Conclusion 6

Framework CLICK PREDICTION MODELING 1. Maximum-Entropy Modeling 2. Integrating User Psychological Desires into Click Prediction DISCOVERING USERS PSYCHOLOGICAL DESIRE FROM ADS 1. Mining User Desire Patterns2. Hierarchy of User Psychological Desire DATA ANALYSIS ON USER PSYCHOLOGICAL DESIRES 1. Consumer Decision Making Process2. Effects of User Psychological Desire 7

DATA ANALYSIS ON USER PSYCHOLOGICAL DESIRES Consumer Decision Making Process  According to the decision making is affected by three effects:  contextual (environmental effects)  thought-based (pricing discount, deliver time limitation, etc.,)  feeling-based (brand preference, trustworthiness, luxury seeking, etc.,).  Since consumer psychological desires are diverse, it is naturally to organize them into a hierarchy to model consumer behaviors in a more effective way. 8

DATA ANALYSIS ON USER PSYCHOLOGICAL DESIRES Effects of User Psychological Desire 9

DATA ANALYSIS ON USER PSYCHOLOGICAL DESIRES 10 Effects of User Psychological Desire  User psychological desire has been well utilized by advertisers to lead users to click more on their ads.

DISCOVERING USERS PSYCHOLOGICAL DESIRE FROM ADS 11  3 principle: 1. The text content should cover enough volume in real ad traffic 2. Similar content can reflect the specific same desire can be organized in a cluster of text phrases. call one cluster a user desire pattern. Ex: coupon, can be “coupon code”, “get coupon”, “free coupons”. 3. Text content from experienced advertisers will be highly possible to form useful desire patterns.

DISCOVERING USERS PSYCHOLOGICAL DESIRE FROM ADS Mining User Desire Patterns  Step 1: Cleaning up content targeting for relevance  Query: cheap car  Step 2: Finding n-grams with high frequency  Step 3: pattern generalization  K=300 12

DISCOVERING USERS PSYCHOLOGICAL DESIRE FROM ADS Hierarchy of User Psychological Desire  Organize extracted general desires into a hierarchy of user psychological desires according to Maslow’s hierarchy of needs 13

CLICK PREDICTION MODELING Maximum-Entropy Modeling  formulate click prediction in sponsored search as a supervised learning problem  training samples, Dtrain ={ }  (query, ad, user, position), ci ∈ {0, 1} (non-click or click)  Edit distance: ad and bid keyword  Consine similiarity : ad and query  History COEC:,position  compute the probability of click p(c | q, a, u, p).  Apply the maximum entropy model for click prediction, its strength in combining diverse forms of contextual (query, ad, user, position) 14

CLICK PREDICTION MODELING Integrating User Psychological Desires into Click Prediction  Modeling Psychological Desire as Ad Features  Ad desire pattern features : Da(P)  Ad desire level features : Da(L)  Modeling Psychological Desire as User Features  User desire pattern features : Du(P)  User desire level features : Du(L)  Modeling Desire Matching Between Users and Ads  Desire pattern matching features  Desire level matching features 15

Outline  Introduction  Method  Experiments  Conclusion 16

Experimental Settings  Data set:  based on the click-through logs of a real world commercial search engine  collect the whole click-through logs of a two-week period from this search engine  randomly sample a set of query events from the original whole traffic  finally collect about 20M ad impressions in each of these two weeks 17

Experimental Settings  Compared Methods  HF: only uses historical click features.  HF-RF: uses historical click features and relevance features.  HF-DPF: uses historical click features and desire pattern features.  HF-DPLF: uses historical click features and both desire pattern and desire level features.  HF-RF-DPF: uses historical click features, relevance features, and desire pattern features.  HF-RF-DPLF: uses historical click features, relevance features, and both desire pattern and desire level features. 18

Experimental Result  Overall Performance  Impacts on Ads with Rich v.s. Rare History 19

Experimental Result  Effects of User Desires on Different Ads Categories  Effects of Combinations over Desire Patterns 20

Outline  Introduction  Method  Experiments  Conclusion 21

Conclusion  Explores a new way for computational advertising to embrace the traditional psychological analysis to enhance the computational advertising  Answering “why” users click search ads by exploring user psychological desire according to consumer behavior analysis and Maslow’s desire theory.  Construct novel features for both ads and users based on our definition on psychological desire and incorporate them into the learning framework of click prediction. 22