Query term ranking based on search results overlap

Authors:
Wei Song;Yu Zhang;Yubin Xie;Ting Liu;Sheng Li
Affiliations:
Computer Science and Technology Department, Harbin Institute of Technology, Harbin, China;Computer Science and Technology Department, Harbin Institute of Technology, Harbin, China;Computer Science and Technology Department, Harbin Institute of Technology, Harbin, China;Computer Science and Technology Department, Harbin Institute of Technology, Harbin, China;Computer Science and Technology Department, Harbin Institute of Technology, Harbin, China
Venue:
Proceedings of the 34th international ACM SIGIR conference on Research and development in Information Retrieval
Year:
2011

Citing 4
Cited 0

Learning to estimate query difficulty: including applications to missing content detection and distributed information retrieval

Proceedings of the 28th annual international ACM SIGIR conference on Research and development in information retrieval
Discovering key concepts in verbose queries

Proceedings of the 31st annual international ACM SIGIR conference on Research and development in information retrieval
A term dependency-based approach for query terms ranking

Proceedings of the 18th ACM conference on Information and knowledge management
Learning concept importance using a weighted dependence model

Proceedings of the third ACM international conference on Web search and data mining

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we propose a method to rank and assign weights to query terms according to their impact on the topic of the query. We use Search Result Overlap Ratio (SROR) to quantify the overlap of the search results of the full query and a shorten query after removing one term. Intuitively, if the overlap is small, it indicates a big topic shift and the removed term should be discriminative and important. The SROR could be used for measuring query term importance with a search engine automatically. By this way, learning based models could be trained based on a large number of automatically labeled instances and make predictions for future queries efficiently.