Yang Liu
ABSTRACT
Query suggestion is a useful tool to help users formulate better queries. Although this has been found highly useful globally, its effect on different queries may vary. In this paper, we examine the impact of query suggestion on queries of different degrees of difficulty. It turns out that query suggestion is much more useful for difficult queries than easy queries. In addition, the suggestions for difficult queries should rely less on their similarity to the original query. In this paper, we use a learning-to-rank approach to select query suggestions, based on several types of features including a query performance prediction. As query suggestion has different impacts on different queries, we propose an adaptive suggestion approach that makes suggestions only for difficult queries. We carry out experiments on real data from a search engine. Our results clearly indicate that an approach targeting difficult queries can bring higher gain than a uniform suggestion approach.
- G. Amati, C. Carpineto, and G. Romano. Query difficulty, robustness, and selective application of query expansion. In ECIR, pages 127--137, 2004.Google Scholar
Cross Ref
- R. A. Baeza-Yates, C. A. Hurtado, and M. Mendoza. Query recommendation using query logs in search engines. In EDBT Workshops, pages 588--596, 2004. Google ScholarDigital Library
- R. A. Baeza-Yates and A. Tiberi. Extracting semantic relations from query logs. In KDD, pages 76--85, 2007. Google ScholarDigital Library
- N. Balasubramanian, G. Kumaran, and V. R. Carvalho. Exploring reductions for long web queries. In SIGIR, pages 571--578, 2010. Google ScholarDigital Library
- N. Balasubramanian, G. Kumaran, and V. R. Carvalho. Predicting query performance on the web. In SIGIR, pages 785--786, 2010. Google ScholarDigital Library
- D. Beeferman and A. L. Berger. Agglomerative clustering of a search engine query log. In KDD, pages 407--416, 2000. Google ScholarDigital Library
- S. Bhatia, D. Majumdar, and P. Mitra. Query suggestions in the absence of query logs. In SIGIR, pages 795--804, 2011. Google ScholarDigital Library
- H. Cao, D. Jiang, J. Pei, Q. He, Z. Liao, E. Chen, and H. Li. Context-aware query suggestion by mining click-through and session data. In KDD, pages 875--883, 2008. Google ScholarDigital Library
- D. Carmel and E. Yom-Tov. Estimating the query difficulty for information retrieval. In SIGIR, page 911, 2010. Google ScholarDigital Library
- D. Carmel, E. Yom-Tov, A. Darlow, and D. Pelleg. What makes a query difficult? In SIGIR, pages 390--397, 2006. Google ScholarDigital Library
- S. Cronen-Townsend, Y. Zhou, and W. B. Croft. Predicting query performance. In SIGIR, pages 299--306, 2002. Google ScholarDigital Library
- V. Dang and W. B. Croft. Query reformulation using anchor text. In WSDM, pages 41--50, 2010. Google ScholarDigital Library
- N. Eiron and K. S. McCurley. Analysis of anchor text for web search. In SIGIR, pages 459--460, 2003. Google ScholarDigital Library
- C. Fox. Lexical analysis and stoplists. Information Retrieval - Data Structures & Algorithms, pages 102--130, 1992. Google ScholarDigital Library
- J. Gao, X. Li, D. Micol, C. Quirk, and X. Sun. A large scale ranker-based system for search query spelling correction. In COLING, pages 358--366, 2010. Google ScholarDigital Library
- J. Guo, G. Xu, H. Li, and X. Cheng. A unified and discriminative model for query refinement. In SIGIR, pages 379--386, 2008. Google ScholarDigital Library
- K. Jarvelin and J. Kekalainen. Cumulated gain-based evaluation of ir techniques. ACM Trans. Inf. Syst., 20(4):422--446, 2002. Google ScholarDigital Library
- J.C.Borda. Memoire sur les elections au scrutin. Histoire de l'Academie Royale des Sciences, 1781.Google Scholar
- T. Joachims. Optimizing search engines using clickthrough data. In KDD, pages 133--142, 2002. Google ScholarDigital Library
- R. Jones, B. Rey, O. Madani, and W. Greiner. Generating query substitutions. In WWW, pages 387--396, 2006. Google ScholarDigital Library
- R. Kraft and J. Y. Zien. Mining anchor text for query refinement. In WWW, pages 666--674, 2004. Google ScholarDigital Library
- V. Lavrenko and W. B. Croft. Relevance-based language models. In SIGIR, pages 120--127, 2001. Google ScholarDigital Library
- H. Ma, H. Yang, I. King, and M. R. Lyu. Learning latent semantic relations from clickthrough data for query suggestion. In CIKM, pages 709--718, 2008. Google ScholarDigital Library
- Q. Mei, D. Zhou, and K. W. Church. Query suggestion using hitting time. In CIKM, pages 469--478, 2008. Google ScholarDigital Library
- F. Peng, N. Ahmed, X. Li, and Y. Lu. Context sensitive stemming for web search. In SIGIR, pages 639--646, 2007. Google ScholarDigital Library
- M. Porter. An algorithm for suffix stripping. Program: electronic library and information systems, 14(3):130--137, 1980.Google Scholar
- S. E. Robertson. The probability ranking principle in ir. Journal of Documentation, 33:130--137, 1977.Google ScholarCross Ref
- Y. Song and L. wei He. Optimal rare query suggestion with implicit user feedback. In WWW, pages 901--910, 2010. Google ScholarDigital Library
- Y. Song, D. Zhou, and L. wei He. Post-ranking query suggestion by diversifying search results. In SIGIR, pages 815--824, 2011. Google ScholarDigital Library
- T. Tao and C. Zhai. Regularized estimation of mixture models for robust pseudo-relevance feedback. In SIGIR, pages 162--169, 2006. Google ScholarDigital Library
- X. Wang and C. Zhai. Mining term association patterns from search logs for effective query reformulation. In CIKM, pages 479--488, 2008. Google ScholarDigital Library
- J.-R. Wen, J.-Y. Nie, and H. Zhang. Clustering user queries of a search engine. In WWW, pages 162--168, 2001. Google ScholarDigital Library
- J. Xu and W. B. Croft. Improving the effectiveness of information retrieval with local context analysis. ACM Trans. Inf. Syst., 18(1):79--112, 2000. Google ScholarDigital Library
- E. Yom-Tov, S. Fine, D. Carmel, and A. Darlow. Learning to estimate query difficulty: including applications to missing content detection and distributed information retrieval. In SIGIR, pages 512--519, 2005. Google ScholarDigital Library
- Y. Zhou and W. B. Croft. Ranking robustness: a novel framework to predict query performance. In CIKM, pages 567--574, 2006. Google ScholarDigital Library
- Y. Zhou and W. B. Croft. Query performance prediction in web search environments. In SIGIR, pages 543--550, 2007. Google ScholarDigital Library
Index Terms
- Adaptive query suggestion for difficult queries
Recommendations
Visual query suggestion: Towards capturing user intent in internet image search
Query suggestion is an effective approach to bridge the Intention Gap between the users' search intents and queries. Most existing search engines are able to automatically suggest a list of textual query terms based on users' current query input, which ...
Visual query suggestion
MM '09: Proceedings of the 17th ACM international conference on MultimediaQuery suggestion is an effective approach to improve the usability of image search. Most existing search engines are able to automatically suggest a list of textual query terms based on users' current query input, which can be called Textual Query ...
Disjunctive Sets of Phrase Queries for Diverse Query Suggestion
WI '19: IEEE/WIC/ACM International Conference on Web IntelligenceThis paper proposes a method of suggesting expanded queries that disambiguate the original Web query which has multiple interpretations. In order to produce a diverse set of queries including those corresponding to infrequent query intents, our method ...
Comments