Reexamining the cluster hypothesis: scatter/gather on retrieval results
SIGIR '96 Proceedings of the 19th annual international ACM SIGIR conference on Research and development in information retrieval
Searching for content-based addresses on the World-Wide Web
Proceedings of the third ACM conference on Digital libraries
Grouper: a dynamic clustering interface to Web search results
WWW '99 Proceedings of the eighth international conference on World Wide Web
Probabilistic query expansion using query logs
Proceedings of the 11th international conference on World Wide Web
Query association for effective retrieval
Proceedings of the eleventh international conference on Information and knowledge management
Re-examining the potential effectiveness of interactive query expansion
Proceedings of the 26th annual international ACM SIGIR conference on Research and development in informaion retrieval
Query expansion using associated queries
CIKM '03 Proceedings of the twelfth international conference on Information and knowledge management
Generating query substitutions
Proceedings of the 15th international conference on World Wide Web
InfoScale '06 Proceedings of the 1st international conference on Scalable information systems
Web searching on the Vivisimo search engine
Journal of the American Society for Information Science and Technology
Information-need driven query refinement
Web Intelligence and Agent Systems
Empirical Analysis of the Rank Distribution of Relevant Documents in Web Search
WI-IAT '08 Proceedings of the 2008 IEEE/WIC/ACM International Conference on Web Intelligence and Intelligent Agent Technology - Volume 01
Improved query suggestion by query search
KI'12 Proceedings of the 35th Annual German conference on Advances in Artificial Intelligence
| Hi-index | 0.00 |
This paper introduces and analyzes a new approach to query suggestion. After the user issues a query q_0, for every document retrieved in a certain rank range [Theta_1,Theta_2], a query search procedure constructs queries that rank the document high enough for the user to see it. From this set of queries the suggestions to be presented to the user are then selected so as to give the best possible access to the documents that were ranked in [Theta_1,Theta_2] for the user's initial query q_0. This approach turns out to be successful under certain assumptions, which are discussed in this paper.