 |
|
|
|
|
|
|
|
|
|
|
|
|
 |
|
|||||||||||
 |
 |
 |
 |
 |
 |
 |
 |
 |
 |
 |
|
|
 |
 |
|
||||||||||
 |
|
|||||||||||
 |
|
|||||||||||
 |
 |
|
||||||||||
| Seminar Schedule (Seminar Organizer: Prof. Ziv Bar-Joseph) | |
Machine Learning Lunchtime Chats
|
Fall 2005 Seminar
Date: November 21, 2005 Time: 12:00 PM - 1:30 PM Location: 5409 Wean Hall Speaker: Elad Yom-Tov Title: Learning to Estimate Query Difficulty Abstract: In my talk I will present novel learning methods for estimating the quality of results returned by a search engine in response to a query. Estimation is based on the agreement between the top results of the full query and the top results of its sub-queries. I will demonstrate the usefulness of quality estimation for several applications, among them improvement of etrieval, detecting queries for which no relevant content exists in the document collection, and distributed information retrieval. Experiments on TREC data demonstrate the robustness and the effectiveness of our learning algorithms. This talk is based on our work which won the SIGIR 2005 Best Paper award.