Search Query Disambiguation from Short Sessions
author: Raymond J. Mooney, Department of Computer Sciences, The University of Texas at Austin
Description
Web searches tend to be short and ambiguous. It is therefore not surprising that Web query disambiguation is an actively researched topic. However, most existing work relies on the existence of search engine log data in which each user's search activities are recorded over long periods of time. Such approaches may raise privacy concerns and may be difficult to implement for pragmatic reasons. In this work, we present an approach to Web query disambiguation that bases its predictions only on a short glimpse of user search activity, captured in a brief session of about 5--6 previous searches on average. Our method exploits the relations of the current search session in which the ambiguous query is issued to previous sessions in order to predict the user's intentions and is based on Markov logic. We present empirical results that demonstrate the effectiveness of our proposed approach on data collected form a commercial general-purpose search engine.
| Slides | |
| 0:00 | Search Query Disambiguationfrom Short Sessions |
| 0:04 | Query Disambiguation |
| 0:18 | Existing Work |
| 0:38 | Privacy Concerns |
| 1:07 | Pragmatic Concerns |
| 1:43 | Proposed Setting |
| 2:28 | How Short is Short-Term? |
| 3:03 | Is This Enough Info? |
| 3:47 | More Closely Related Work |
| 4:44 | Main Challenge |
| 5:14 | Using Relational Information |
| 6:25 | Details |
| 7:08 | Predicates |
| 7:56 | Re-Ranking of Search Results |
| 8:29 | MLN 1 |
| 9:12 | MLN 2 |
| 9:29 | MLN 3 |
| 9:46 | Data |
| 10:31 | Data Limitation #1: |
| 11:31 | Data Limitation #2 |
| 12:46 | Result Set Sizes |
| 13:01 | Evaluation Metrics: MAP |
| 13:46 | Evaluation Metrics: AUC-ROC |
| 14:15 | Baselines |
| 14:34 | Click-Sim |
| 15:13 | Click-KW-Sim |
| 15:20 | Results (MAP) |
| 15:56 | Results (AUC-ROC) |
| 16:02 | Current/Future Work |
| 17:09 | - questions |
Lecture rating
| People found this lecture: | ||
| Worth seeing | ||
| because it is: | ||
| Valuable and informative | ||
| Well presented | ||
| Easily understandable | ||
| Acceptably recorded | ||
| You need to login to cast your vote. | ||
Report a problem or upload files
If you have found a problem with this lecture or would like to send us extra material, articles, exercises, etc., please use our ticket system to describe your request and upload the data.Enter your e-mail into the 'Cc' field, and we will keep you updated with your request's status.
Related content
SEE ALSO:
Link this page
Would you like to put a link to this lecture on your homepage?Go ahead! Copy the HTML snippet !



