Time-sensitive Personalized Query Auto-Completion

Slides:



Advertisements
Similar presentations
Context-Sensitive Query Auto-Completion AUTHORS:NAAMA KRAUS AND ZIV BAR-YOSSEF DATE OF PUBLICATION:NOVEMBER 2010 SPEAKER:RISHU GUPTA 1.
Advertisements

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.
Temporal Query Log Profiling to Improve Web Search Ranking Alexander Kotov (UIUC) Pranam Kolari, Yi Chang (Yahoo!) Lei Duan (Microsoft)
DQR : A Probabilistic Approach to Diversified Query recommendation Date: 2013/05/20 Author: Ruirui Li, Ben Kao, Bin Bi, Reynold Cheng, Eric Lo Source:
Collaborative QoS Prediction in Cloud Computing Department of Computer Science & Engineering The Chinese University of Hong Kong Hong Kong, China Rocky.
Knowledge Base Completion via Search-Based Question Answering
Date : 2014/12/04 Author : Parikshit Sondhi, ChengXiang Zhai Source : CIKM’14 Advisor : Jia-ling Koh Speaker : Sz-Han,Wang.
Date : 2013/05/27 Author : Anish Das Sarma, Lujun Fang, Nitin Gupta, Alon Halevy, Hongrae Lee, Fei Wu, Reynold Xin, Gong Yu Source : SIGMOD’12 Speaker.
Date : 2014/04/01 Author : Zhung-Xun Liao, Yi-Chin Pan, Wen-Chih Peng, Po-Ruey Lei Source : CIKM’13 Advisor : Jia-ling Koh Speaker : Shao-Chun Peng.
Sequence Clustering and Labeling for Unsupervised Query Intent Discovery Speaker: Po-Hsien Shih Advisor: Jia-Ling Koh Source: WSDM’12 Date: 1 November,
Toward Whole-Session Relevance: Exploring Intrinsic Diversity in Web Search Date: 2014/5/20 Author: Karthik Raman, Paul N. Bennett, Kevyn Collins-Thompson.
Sentiment Diversification with Different Biases Date : 2014/04/29 Source : SIGIR’13 Advisor : Prof. Jia-Ling, Koh Speaker : Wei, Chang 1.
Mining Query Subtopics from Search Log Data Date : 2012/12/06 Resource : SIGIR’12 Advisor : Dr. Jia-Ling Koh Speaker : I-Chih Chiu.
Memory-Based Recommender Systems : A Comparative Study Aaron John Mani Srinivasan Ramani CSCI 572 PROJECT RECOMPARATOR.
Personalized Search Result Diversification via Structured Learning
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.
Tag Clouds Revisited Date : 2011/12/12 Source : CIKM’11 Speaker : I- Chih Chiu Advisor : Dr. Koh. Jia-ling 1.
SEEKING STATEMENT-SUPPORTING TOP-K WITNESSES Date: 2012/03/12 Source: Steffen Metzger (CIKM’11) Speaker: Er-gang Liu Advisor: Dr. Jia-ling Koh 1.
Leveraging Conceptual Lexicon : Query Disambiguation using Proximity Information for Patent Retrieval Date : 2013/10/30 Author : Parvaz Mahdabi, Shima.
1 Applying Collaborative Filtering Techniques to Movie Search for Better Ranking and Browsing Seung-Taek Park and David M. Pennock (ACM SIGKDD 2007)
A Personalized Recommender System Based on Users’ Information In Folksonomies Date: 2013/12/18 Author: Mohamed Nader Jelassi, Sadok Ben Yahia, Engelbert.
1 A Unified Relevance Model for Opinion Retrieval (CIKM 09’) Xuanjing Huang, W. Bruce Croft Date: 2010/02/08 Speaker: Yu-Wen, Hsu.
Automated Social Hierarchy Detection through Network Analysis (SNAKDD07) Ryan Rowe, Germ´an Creamer, Shlomo Hershkop, Salvatore J Stolfo 1 Advisor:
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.
Exploring Online Social Activities for Adaptive Search Personalization CIKM’10 Advisor : Jia Ling, Koh Speaker : SHENG HONG, CHUNG.
A Probabilistic Graphical Model for Joint Answer Ranking in Question Answering Jeongwoo Ko, Luo Si, Eric Nyberg (SIGIR ’ 07) Speaker: Cho, Chin Wei Advisor:
Date: 2014/02/25 Author: Aliaksei Severyn, Massimo Nicosia, Aleessandro Moschitti Source: CIKM’13 Advisor: Jia-ling Koh Speaker: Chen-Yu Huang Building.
RANKING SUPPORT FOR KEYWORD SEARCH ON STRUCTURED DATA USING RELEVANCE MODEL Date: 2012/06/04 Source: Veli Bicer(CIKM’11) Speaker: Er-gang Liu Advisor:
Date : 2012/10/25 Author : Yosi Mass, Yehoshua Sagiv Source : WSDM’12 Speaker : Er-Gang Liu Advisor : Dr. Jia-ling Koh 1.
Probabilistic Models of Novel Document Rankings for Faceted Topic Retrieval Ben Cartrette and Praveen Chandar Dept. of Computer and Information Science.
A fuzzy time series-based neural network approach to option price forecasting Speaker: Prof. Yungho Leu Authors: Yungho Leu, Chien-Pang Lee, Chen-Chia.
Enhancing Cluster Labeling Using Wikipedia David Carmel, Haggai Roitman, Naama Zwerdling IBM Research Lab (SIGIR’09) Date: 11/09/2009 Speaker: Cho, Chin.
1 Using The Past To Score The Present: Extending Term Weighting Models with Revision History Analysis CIKM’10 Advisor : Jia Ling, Koh Speaker : SHENG HONG,
Templated Search over Relational Databases Date: 2015/01/15 Author: Anastasios Zouzias, Michail Vlachos, Vagelis Hristidis Source: ACM CIKM’14 Advisor:
2009/05/04 Y.H.Chang 1Trend Prediction in Social Bookmark Service Using Time Series of Bookmarks Advisor: Hsin-Hsi Chen Reporter: Y.H Chang
LOGO Identifying Opinion Leaders in the Blogosphere Xiaodan Song, Yun Chi, Koji Hino, Belle L. Tseng CIKM 2007 Advisor : Dr. Koh Jia-Ling Speaker : Tu.
Date: 2012/08/21 Source: Zhong Zeng, Zhifeng Bao, Tok Wang Ling, Mong Li Lee (KEYS’12) Speaker: Er-Gang Liu Advisor: Dr. Jia-ling Koh 1.
Date: 2013/6/10 Author: Shiwen Cheng, Arash Termehchy, Vagelis Hristidis Source: CIKM’12 Advisor: Jia-ling Koh Speaker: Chen-Yu Huang Predicting the Effectiveness.
Bloom Cookies: Web Search Personalization without User Tracking Authors: Nitesh Mor, Oriana Riva, Suman Nath, and John Kubiatowicz Presented by Ben Summers.
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.
Date: 2011/1/11 Advisor: Dr. Koh. Jia-Ling Speaker: Lin, Yi-Jhen Mr. KNN: Soft Relevance for Multi-label Classification (CIKM’10) 1.
Ranking-based Processing of SQL Queries Date: 2012/1/16 Source: Hany Azzam (CIKM’11) Speaker: Er-gang Liu Advisor: Dr. Jia-ling Koh.
Date: 2013/4/1 Author: Jaime I. Lopez-Veyna, Victor J. Sosa-Sosa, Ivan Lopez-Arevalo Source: KEYS’12 Advisor: Jia-ling Koh Speaker: Chen-Yu Huang KESOSD.
A Clustering-based QoS Prediction Approach for Web Service Recommendation Shenzhen, China April 12, 2012 Jieming Zhu, Yu Kang, Zibin Zheng and Michael.
TO Each His Own: Personalized Content Selection Based on Text Comprehensibility Date: 2013/01/24 Author: Chenhao Tan, Evgeniy Gabrilovich, Bo Pang Source:
LEARNING FROM THE PAST: ANSWERING NEW QUESTIONS WITH PAST ANSWERS Date: 2012/11/22 Author: Anna Shtok, Gideon Dror, Yoelle Maarek, Idan Szpektor Source:
SEMANTIC VERIFICATION IN AN ONLINE FACT SEEKING ENVIRONMENT DMITRI ROUSSINOV, OZGUR TURETKEN Speaker: Li, HueiJyun Advisor: Koh, JiaLing Date: 2008/5/1.
Search Result Diversification in Resource Selection for Federated Search Date : 2014/06/17 Author : Dzung Hong, Luo Si Source : SIGIR’13 Advisor: Jia-ling.
{ Adaptive Relevance Feedback in Information Retrieval Yuanhua Lv and ChengXiang Zhai (CIKM ‘09) Date: 2010/10/12 Advisor: Dr. Koh, Jia-Ling Speaker: Lin,
Predicting User Interests from Contextual Information R. W. White, P. Bailey, L. Chen Microsoft (SIGIR 2009) Presenter : Jae-won Lee.
1 Blog Cascade Affinity: Analysis and Prediction 2009 ACM Advisor : Dr. Koh Jia-Ling Speaker : Chou-Bin Fan Date :
Predicting Short-Term Interests Using Activity-Based Search Context CIKM’10 Advisor: Jia Ling, Koh Speaker: Yu Cheng, Hsieh.
LOGO Comments-Oriented Blog Summarization by Sentence Extraction Meishan Hu, Aixin Sun, Ee-Peng Lim (ACM CIKM’07) Advisor : Dr. Koh Jia-Ling Speaker :
Reputation-aware QoS Value Prediction of Web Services Weiwei Qiu, Zhejiang University Zibin Zheng, The Chinese University of HongKong Xinyu Wang, Zhejiang.
Short Text Similarity with Word Embedding Date: 2016/03/28 Author: Tom Kenter, Maarten de Rijke Source: CIKM’15 Advisor: Jia-Ling Koh Speaker: Chih-Hsuan.
The Wisdom of the Few Xavier Amatrian, Neal Lathis, Josep M. Pujol SIGIR’09 Advisor: Jia Ling, Koh Speaker: Yu Cheng, Hsieh.
QUERY-PERFORMANCE PREDICTION: SETTING THE EXPECTATIONS STRAIGHT Date : 2014/08/18 Author : Fiana Raiber, Oren Kurland Source : SIGIR’14 Advisor : Jia-ling.
Improving Search Relevance for Short Queries in Community Question Answering Date: 2014/09/25 Author : Haocheng Wu, Wei Wu, Ming Zhou, Enhong Chen, Lei.
Where Did You Go: Personalized Annotation of Mobility Records
Learning to Personalize Query Auto-Completion
Asymmetric Correlation Regularized Matrix Factorization for Web Service Recommendation Qi Xie1, Shenglin Zhao2, Zibin Zheng3, Jieming Zhu2 and Michael.
Summarizing answers in non-factoid community Question-answering
Measuring the Latency of Depression Detection in Social Media
Movie Recommendation System
Date : 2013/1/10 Author : Lanbo Zhang, Yi Zhang, Yunfei Chen
Date: 2012/11/15 Author: Jin Young Kim, Kevyn Collins-Thompson,
HeteroMed: Heterogeneous Information Network for Medical Diagnosis
Ranking using Multiple Document Types in Desktop Search
Preference Based Evaluation Measures for Novelty and Diversity
Presentation transcript:

Time-sensitive Personalized Query Auto-Completion Date: 2015/01/29 Author: Fei Cai, Shangsong Liang, Maarten de Rijke Source: CIKM’14 Advisor:Jia-ling Koh Speaker:Sz-Han,Wang

Outline Introduction Method Experiment Conclusion

Introduction Query auto-completion(QAC) is aimed at saving user’s time

Introduction A common approach: Extract past queries from query log, and rank them by their past popularity → performance on average but far from optimal Time and trend MH370 movie christmas

Introduction User-specific

Introduction Goal: Propose a hybrid QAC model considers both of time-sensitivity and personalization to achieve optimal QAC effectiveness for a user. Time-sensitivity: predict query popularity based on periodicity of a query and its recent trend Personalization: exploit each user’s previous queries, both during the current session and from historical logs as user-specific

top N query completions Flow Chart Personalized QAC Score user-specific query similarity query Time-sensitive QAC Rank QAC candidates by predicted query popularity top N query completions candidates Hybrid QAC Rerank QAC candidates by combined time-sensitive QAC with personalized QAC

Outline Introduction Method Experiment Conclusion

Time-sensitive QAC Rank QAC candidates by predicted query popularity Predict query popularity based on its recent trend and periodicity Time-sensitive score = 𝑦 𝑡0+1 𝑞,λ =λ× 𝑦 𝑡0+1 𝑞 𝑡𝑟𝑒𝑛𝑑 + 1−λ × 𝑦 𝑡0+1 𝑞 𝑝𝑒𝑟𝑖

Time-sensitive QAC Predict form recent trend (recent N days) harry f: decay factor, TD(i): the interval from day i to future day t0+1 harry harry potter harry winston harry style N days = 3, f=0.95 𝑦 𝑡 0+1 ℎ𝑎𝑟𝑟𝑦 𝑝𝑜𝑡𝑡𝑒𝑟 𝑡𝑟𝑒𝑛𝑑 =0.35∗125+0.33∗130+0.32∗140 =131.45 𝑦 𝑡 0+1 ℎ𝑎𝑟𝑟𝑦 𝑝𝑜𝑡𝑡𝑒𝑟 𝑡𝑟𝑒𝑛𝑑 𝑡 0+1 𝑡 0 𝑡 0−1 𝑡 0−2 𝑡 0−3 85 90 110 70 𝑡 0−4 𝑇𝐷 1 =2,𝑤 1 = 0.95 2−1 =0.95 → 𝑛𝑜𝑟𝑚(𝑤 1 )=0.35 𝑇𝐷 2 =3,𝑤 2 = 0.95 3−1 =0.9025 → 𝑛𝑜𝑟𝑚(𝑤 2 )=0.33 𝑇𝐷 3 =4,𝑤 3 = 0.95 4−1 =0.85735 → 𝑛𝑜𝑟𝑚(𝑤 3 )=0.32 𝑦 𝑡 0+1 (ℎ𝑎𝑟𝑟𝑦 𝑝𝑜𝑡𝑡𝑒𝑟,1) 𝑡𝑟𝑒𝑛𝑑 =90+15=105 𝑦 𝑡 0+1 (ℎ𝑎𝑟𝑟𝑦 𝑝𝑜𝑡𝑡𝑒𝑟,2) 𝑡𝑟𝑒𝑛𝑑 =85+40=125 𝑦 𝑡 0+1 (ℎ𝑎𝑟𝑟𝑦 𝑝𝑜𝑡𝑡𝑒𝑟,3) 𝑡𝑟𝑒𝑛𝑑 =70+55=125

Time-sensitive QAC Predict form periodicity harry harry potter Use autocorrelation coefficient to detect q’s periodicity , 𝑇 𝑞 denotes q’s periodicity 𝑇 𝑞 =1 𝑦𝑒𝑎𝑟, 𝑀=3 harry harry potter harry winston harry style 2005/07/16 100 95 120 2005/07/17 2004/07/17 2003/07/17 2002/07/17 𝑦 𝑡 0+1 ℎ𝑎𝑟𝑟𝑦 𝑝𝑜𝑡𝑡𝑒𝑟 𝑝𝑒𝑟𝑖 = 1 3 100+95+120 =105 𝑦 𝑡 0+1 ℎ𝑎𝑟𝑟𝑦 𝑝𝑜𝑡𝑡𝑒𝑟 𝑝𝑒𝑟𝑖 1 2 3 𝑟 1 = 1−2 ∗ 2−2 + 2−2 ∗ 3−2 +…+ 2−2 ∗(3−2) (1−2) 2 + (2−2) 2 + …+(2−2) 2 =−0.33 𝑟 2 = 1−2 ∗ 3−2 + 2−2 ∗ 1−2 +…+ 1−2 ∗(3−2) (1−2) 2 + (2−2) 2 + …+(1−2) 2 =−0.67 𝑟 3 = 1−2 ∗ 1−2 + 2−2 ∗ 2−2 + 3−2 ∗(3−2) (1−2) 2 + (2−2) 2 + (3−2) 2 =1

Personalized QAC Score user-specific query similarity Using a combination of similarity scores 𝑆𝑐𝑜𝑟𝑒( 𝑄 𝑠 ,𝑞 𝑐 ) and 𝑆𝑐𝑜𝑟𝑒( 𝑄 𝑢 ,𝑞 𝑐 ) 𝑄 𝑠 : the recent queries in the current search, 𝑄 𝑢 : the same user issued before Personalized score =𝜔×𝑆𝑐𝑜𝑟𝑒( 𝑄 𝑠 ,𝑞 𝑐 )+ 1−𝜔 ×𝑆𝑐𝑜𝑟𝑒( 𝑄 𝑢 ,𝑞 𝑐 )

Personalized QAC 𝑤 𝑠 = 𝑓 𝑇𝐷 𝑠 −1 harry potter harry , f: decay factor, TD(s): the interval between 𝑞 𝑐 and 𝑞 𝑠 𝑝 𝑞 𝑐 𝑞 𝑠 = 𝑤 𝑐𝑖 ∈ 𝑞 𝑐 𝑝 𝑤 𝑐𝑖 𝑞 𝑠 𝑁( 𝑤 𝑐𝑖 , 𝑞 𝑐 ) = 𝑤 𝑐𝑖 ∈ 𝑞 𝑐 𝑝 𝑤 𝑐𝑖 𝑊(𝑤 𝑐𝑖 ) 𝑁( 𝑤 𝑐𝑖 , 𝑞 𝑐 ) W( 𝑤 𝑐𝑖 )={𝑤:𝑤∈ 𝑞 𝑠 |𝑤 0 = 𝑤 𝑐𝑖 [0]} ,N( 𝑤 ∗ , 𝑞 ∗ ) denotes the frequency of term 𝑤 ∗ appearing in 𝑞 ∗ 𝑝 𝑤 𝑐𝑖 𝑊(𝑤 𝑐𝑖 ) ≡𝑆𝑖𝑚𝑖𝑙𝑎𝑟𝑖𝑡𝑦( 𝑤 𝑐𝑖 ,𝑊( 𝑤 𝑐𝑖 ))= 1 𝑊(𝑤 𝑐𝑖 | 𝑤 𝑗 ∈ 𝑊(𝑤 𝑐𝑖 ) 𝑆𝑖𝑚𝑖𝑙𝑎𝑟𝑖𝑡𝑦( 𝑤 𝑐𝑖 , 𝑤 𝑗 ) = 1 𝑊(𝑤 𝑐𝑖 | 𝑤 𝑗 ∈ 𝑊(𝑤 𝑐𝑖 ) 𝑙𝑒𝑛(𝑐𝑜𝑚𝑚𝑜𝑛 𝑤 𝑐𝑖 , 𝑤 𝑗 ) 𝑚𝑖𝑛( 𝑙𝑒𝑛(𝑤 𝑐𝑖 ), 𝑙𝑒𝑛(𝑤 𝑗 )) harry potter harry harry potter hogwarts 𝑝 ℎ𝑎𝑟𝑟𝑦 𝑝𝑜𝑡𝑡𝑒𝑟 ℎ𝑎𝑟𝑟𝑦 𝑝𝑜𝑡𝑡𝑒𝑟 ℎ𝑜𝑔𝑤𝑎𝑟𝑡𝑠 = 0.7 1 2 × 1 1 2 =0.84 𝑝 ℎ𝑎𝑟𝑟𝑦 𝑝𝑜𝑡𝑡𝑒𝑟 ℎ𝑎𝑟𝑟𝑦 𝑝𝑜𝑡𝑡𝑒𝑟 ℎ𝑜𝑔𝑤𝑎𝑟𝑡𝑠 𝑝 ℎ𝑎𝑟𝑟𝑦 𝑊(ℎ𝑎𝑟𝑟𝑦) = 1 2 × 5 5 + 2 5 =0.7 𝑝 𝑝𝑜𝑡𝑡𝑒𝑟 𝑊(𝑝𝑜𝑡𝑡𝑒𝑟) = 1 1 × 6 6 =1 𝑞 𝑐 term {harry, potter} 𝑞 𝑠 term {harry, potter, hogwarts} W(harry)= {harry, hogwarts} W(potter)= {potter} , 𝑤 𝑢 depend on the query count

Hybrid QAC Rerank QAC candidates by combined time-sensitive QAC with personalized QAC Hybrid score =𝛾∙𝑇𝑆𝑠𝑐𝑜𝑟𝑒( 𝑞 𝑐 )+ 1−𝛾 ∙𝑃𝑠𝑐𝑜𝑟𝑒( 𝑞 𝑐 ) Standardize TSscore and Pscore 𝑇𝑆𝑠𝑐𝑜𝑟𝑒 𝑞 𝑐 ← 𝑦 𝑡0+1 𝑞,λ − 𝜇 𝑇 𝜎 𝑇 𝑃𝑠𝑐𝑜𝑟𝑒 𝑞 𝑐 ← 𝑃𝑠𝑐𝑜𝑟𝑒( 𝑞 𝑐 )− 𝜇 𝑃 𝜎 𝑃

Outline Introduction Method Experiment Conclusion

Experiment Dataset AOL sampled between 2006/03/01 and 2006/05/31 Sound and Vision sampled between 2013/01/01 and 2013/12/31

Experiment Evaluation metrics Measure forecast accuracy Mean Absolute Error (MAE) Symmetric Mean Absolute Error Evaluate the effectiveness of QAC rankings Mean Reciprocal Rank (MRR) 𝑦 𝑖 :𝑡ℎ𝑒 𝑡𝑟𝑢𝑒 𝑣𝑎𝑙𝑢𝑒, 𝑦 𝑖 :𝑡ℎ𝑒 𝑝𝑟𝑒𝑑𝑖𝑐𝑡𝑖𝑜𝑛 𝑣𝑎𝑙𝑢𝑒

Experiment Query popularity prediction evaluation

Experiment Impact of trade-off parameter 0.62 0.83

Experiment Performance of TS-QAC rankings Performance of Hybrid QAC rankings

Outline Introduction Method Experiment Conclusion

Conclusion Adopt a combination of the two aspects of the QAC problem Proposed to use time-series analysis for predicting its future frequency Extend time-sensitive QAC method with personalized The best performer λ *-H-QAC showing significant improvements over various time-sensitive QAC baselines Use parallel processing to enhance the efficiency of the method and use other metrics to evaluate the QAC rankings