A Two-Dimensional Click Model for Query Auto-Completion Yanen Li 1, Anlei Dong 2, Hongning Wang 1, Hongbo Deng 2, Yi Chang 2, ChengXiang Zhai 1 1 University.

Slides:



Advertisements
Similar presentations
TWO STEP EQUATIONS 1. SOLVE FOR X 2. DO THE ADDITION STEP FIRST
Advertisements

1 Copyright © 2010, Elsevier Inc. All rights Reserved Fig 2.1 Chapter 2.
By D. Fisher Geometric Transformations. Reflection, Rotation, or Translation 1.
Wenke Lee and Nick Feamster Georgia Tech Botnet and Spam Detection in High-Speed Networks.
1 Random Sampling from a Search Engines Index Ziv Bar-Yossef Maxim Gurevich Department of Electrical Engineering Technion.
CWS: A Comparative Web Search System Jian-Tao Sun, Xuanhui Wang, § Dou Shen Hua-Jun Zeng, Zheng Chen Microsoft Research Asia University of Illinois at.
1 Random Sampling from a Search Engines Index Ziv Bar-Yossef Department of Electrical Engineering, Technion Maxim Gurevich Department of Electrical Engineering,
Sales Forecasting using Dynamic Bayesian Networks Steve Djajasaputra SNN Nijmegen The Netherlands.
Business Transaction Management Software for Application Coordination 1 Business Processes and Coordination.
Energy-Efficient Distributed Algorithms for Ad hoc Wireless Networks Gopal Pandurangan Department of Computer Science Purdue University.
An analysis of Social Network-based Sybil defenses Bimal Viswanath § Ansley Post § Krishna Gummadi § Alan Mislove ¶ § MPI-SWS ¶ Northeastern University.
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.
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.
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
Watching Television Over an IP Network & TV-Watching Behavior Research presented by Weiping He.
Context-Sensitive Query Auto-Completion AUTHORS:NAAMA KRAUS AND ZIV BAR-YOSSEF DATE OF PUBLICATION:NOVEMBER 2010 SPEAKER:RISHU GUPTA 1.
Google News Personalization Scalable Online Collaborative Filtering
BT Wholesale October Creating your own telephone network WHOLESALE CALLS LINE ASSOCIATED.
ACM SIGIR 2009 Workshop on Redundancy, Diversity, and Interdependent Document Relevance, July 23, 2009, Boston, MA 1 Modeling Diversity in Information.
Filtering Semi-Structured Documents Based on Faceted Feedback Lanbo Zhang, Yi Zhang, Qianli Xing Information Retrieval and Knowledge Management (IRKM)
Plan Recognition in Virtual Laboratories Ofra Amir and Yaakov (Kobi) Gal Ben-Gurion University of The Negev Department of Information Systems Engineering.
Vincent W. Zheng, Yu Zheng, Xing Xie, Qiang Yang Hong Kong University of Science and Technology Microsoft Research Asia This work was done when Vincent.
INTRODUCTION TO SIMULATION WITH OMNET++ José Daniel García Sánchez ARCOS Group – University Carlos III of Madrid.
Taming User-Generated Content in Mobile Networks via Drop Zones Ionut Trestian Supranamaya Ranjan Aleksandar Kuzmanovic Antonio Nucci Northwestern University.
Context-Aware Mobile Music Recommendation for Daily Activities
Slide 1 ILLINOIS - RAILROAD ENGINEERING Railroad Hazardous Materials Transportation Risk Analysis Under Uncertainty Xiang Liu, M. Rapik Saat and Christopher.
ACM CIKM 2008, Oct , Napa Valley 1 Mining Term Association Patterns from Search Logs for Effective Query Reformulation Xuanhui Wang and ChengXiang.
Text Categorization.
1 Evaluations in information retrieval. 2 Evaluations in information retrieval: summary The following gives an overview of approaches that are applied.
Landmark-Based User Location Inference in Social Media YUTO YAMAGUCHI †, TOSHIYUKI AMAGASA † AND HIROYUKI KITAGAWA † †UNIVERSITY OF TSUKUBA 13/10/08 COSN.
Squares and Square Root WALK. Solve each problem REVIEW:
Computer Science and Engineering Diversified Spatial Keyword Search On Road Networks Chengyuan Zhang 1,Ying Zhang 2,1,Wenjie Zhang 1, Xuemin Lin 3,1, Muhammad.
Devising Secure Sockets Layer-Based Distributed Systems: A Performance-Aware Approach Norman Lim, Shikharesh Majumdar,Vineet Srivastava, Dept. of Systems.
Partitioning Social Networks for Fast Retrieval of Time-dependent Queries Mindi Yuan, David Stein, Berenice Carrasco, Joana Trindade, Yi Lu University.
Temporal Query Log Profiling to Improve Web Search Ranking Alexander Kotov (UIUC) Pranam Kolari, Yi Chang (Yahoo!) Lei Duan (Microsoft)
Addition 1’s to 20.
25 seconds left…...
Test B, 100 Subtraction Facts
An Adaptive System for User Information needs based on the observed meta- Knowledge AKERELE Olubunmi Doctorate student, University of Ibadan, Ibadan, Nigeria;
Week 1.
We will resume in: 25 Minutes.
1 Unit 1 Kinematics Chapter 1 Day
1 PART 1 ILLUSTRATION OF DOCUMENTS  Brief introduction to the documents contained in the envelope  Detailed clarification of the documents content.
1 Chapter 13 LEVERAGE (The use of debt) © 2014 OnCourse Learning. All Rights Reserved.
Why does it work? We have not addressed the question of why does this classifier performs well, given that the assumptions are unlikely to be satisfied.
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.
Psychological Advertising: Exploring User Psychology for Click Prediction in Sponsored Search Date: 2014/03/25 Author: Taifeng Wang, Jiang Bian, Shusen.
Classification Classification Examples
1 Evaluation Rong Jin. 2 Evaluation  Evaluation is key to building effective and efficient search engines usually carried out in controlled experiments.
Modelling Relevance and User Behaviour in Sponsored Search using Click-Data Adarsh Prasad, IIT Delhi Advisors: Dinesh Govindaraj SVN Vishwanathan* Group:
Optimizing search engines using clickthrough data
Pete Bohman Adam Kunk.  Introduction  Related Work  System Overview  Indexing Scheme  Ranking  Evaluation  Conclusion.
1.Accuracy of Agree/Disagree relation classification. 2.Accuracy of user opinion prediction. 1.Task extraction performance on Bing web search log with.
Search Engines Information Retrieval in Practice All slides ©Addison Wesley, 2008.
Evaluating Search Engine
Adapting Deep RankNet for Personalized Search
Fan Guo 1, Chao Liu 2 and Yi-Min Wang 2 1 Carnegie Mellon University 2 Microsoft Research Feb 11, 2009.
Implicit User Feedback Hongning Wang Explicit relevance feedback 2 Updated query Feedback Judgments: d 1 + d 2 - d 3 + … d k -... Query User judgment.
Implicit User Feedback Hongning Wang Explicit relevance feedback 2 Updated query Feedback Judgments: d 1 + d 2 - d 3 + … d k -... Query User judgment.
Identifying “Best Bet” Web Search Results by Mining Past User Behavior Author: Eugene Agichtein, Zijian Zheng (Microsoft Research) Source: KDD2006 Reporter:
Federated text retrieval from uncooperative overlapped collections Milad Shokouhi, RMIT University, Melbourne, Australia Justin Zobel, RMIT University,
Learning to Personalize Query Auto-Completion
Evaluation of IR Systems
Content-Aware Click Modeling
Click Chain Model in Web Search
Presentation transcript:

A Two-Dimensional Click Model for Query Auto-Completion Yanen Li 1, Anlei Dong 2, Hongning Wang 1, Hongbo Deng 2, Yi Chang 2, ChengXiang Zhai 1 1 University of Illinois at Urbana-Champaign 2 Yahoo Labs at Sunnyvale, CA at SIGIR 2014

2 QACDocument Retrieval Query:prefixquery Objects:querydocument Method:learning -to-rank Labels: user clicks only editor labels QAC vs. Document Retrieval KeystrokeSugg List Clicked Query Query Auto-Completion (QAC)

3 Only last column on current query log [Arias PersDB’08] [Bar-Yossef WWW’11] [Shokouhi SIGIR’13] use all simulated columns No work has used real QAC log Questions: Can we do better with real QAC log? What’s the best way of exploiting QAC log? Existing Work on Relevance Modeling for QAC

4 1. Keystroke2. Cursor Pos3. Sugg List4. Clicked Query 5. Previous Query 6. Timestamp 7. User ID Potential uses: -- improve QAC relevance ranking -- understand user behaviors in QAC … New QAC Log: From Real User Interaction at Yahoo!. High Resolution: Record Every Keystroke in Milliseconds

5 MethodMRR RankSVM – Last0.514 RankSVM – All0.436 Experiment on Yahoo! QAC log First attempt on exploiting QAC log

6 A closer look at QAC log: 2-Dimensional Click Distribution

7 Vertical Position PCiPhone 5 Vertical Position Bias Assumption A query on higher rank tends to attract more clicks regardless of its relevance to the prefix User behavior observation 1: vertical position bias

8 Should emphasize clicks at lower positions Implications for Relevance Ranking

9 happens in 60% of all sessions Horizontal Skipping Bias Assumption A query will receive no clicks if the user skips the suggested list of queries, regardless of the relevance of the query to the prefix User behavior observation 2: horizontal skipping (user skips relevant results)

10 Train on examined columns Implications for Relevance Ranking

P(C) = P(Relevance)∙P(Horizontal)∙P(Vertical) 11 better models of horizontal skipping bias and vertical position bias => better relevance model Our Goal: Develop a unified generative model to account for positional bias and horizontal skipping

Several click models -- UBM [Dupret SIGIR’08], -- DBN [Chapelle WWW’09], -- BSS [Wang WWW’13] No existing click model is suitable: horizontal skipping behavior is not modeled 2. not content-aware. They can’t handle unseen prefix-query pairs (67.4% in PC and 60.5% in iPhone 5). Starting point: Existing Click Models for document retrieval

13 H Model: Horizontal Skipping BehaviorD Model: Vertical Position Bias D i = j: examine to depth j C Model: Relevance C i,j = 1: a click at position (i,j) New Model: Two-Dimensional Click Model (TDCM) H i =1: stop and examine H i =0: skip Features: Typing speed isWordBoundary Current position

14 H i =0 No click H i =1 D i =2 No click H i =1 D i =4 H i =1 D i =4 H i =1 D i =4 Click Only when examined and relevant, a click happens Disambiguate “no clicks”: Multiple scenarios Stop examine relevant clicked irrelevant Skip

15 E Step: evaluate the Q function by: M Step: maximize, while Solving the Model by E-M Algorithm

16 Data Random Bucket: shuffle query lists for each prefix; unbiased evaluation of R model with vertical position bias removed Metric average MRR across all columns Experiments: Data and Evaluation Metric

17 Comparison MethodDescription MPCMost Popular Completion UBM-last [Dupret SIGIR’08] User Browsing Model UBM-all [Dupret SIGIR’08] User Browsing Model DBN-last [Chapelle WWW’09] Dynamic Bayesian Network model DBN-all [Chapelle WWW’09] Dynamic Bayesian Network model BSS-last [Wang WWW’13] Bayesian Sequential State model BSS-all [Wang WWW’13] Bayesian Sequential State model TDCMOur model non content-aware modelsContent-aware models Experiments: Models Evaluated

18 MRR on Normal Bucket MethodPC iPhone 5 MPC UBM-last UBM-all DBN-last DBN-all BSS-last0.515 ‡ BSS-all TDCM0.525 ‡ ‡ Note: ‡ indicates p-value<0.05 compared to MPC MRR on Random Bucket (PC data only) MPC0.429 UBM-last0.381 UBM-all0.397 DBN-last0.373 DBN-all0.388 BSS-last0.471 ‡ BSS-all0.460 TDCM0.493 ‡ Results

19 Viewed columns: P(H i = 1) > 0.7 RankSVM Performance Validating the H Model: Using inferred p(H=1) to Enhance other Methods

20 Feature Weights Learned by TDCM Understanding User Behavior via Feature Weights H Model: TypingSpeed is negatively proportional to p(H=1) IsWordBoundary is also important D Model: Top 3 positions occupy most of the examine probability R Model: QryHistFreq is important: user uses QAC as a memory GeoSense and TimeSense have valid contributions

Collect the first set of high-resolution query log specifically for QAC Analyze horizontal skipping bias and vertical position bias: implications for relevance modeling Propose a Two-Dimensional Click Model to model these user behaviors in a unified way, – Outperforming existing click models – Revealing interesting user behavior Future Work – More accurate component models (H, D, R) – Exploiting the model to character user groups (clustering users based on inferred model parameters) 21 Conclusions and Future Work

Questions? 22 Contact: Yanen Li University of Illinois at Urbana-Champaign A Two-Dimensional Click Model for Query Auto-completion