Using Association Rules to Discover Search Engines Related Queries
LA-WEB '03 Proceedings of the First Conference on Latin American Web Congress
Approximate hotlink assignment
Information Processing Letters
Evaluating implicit measures to improve web search
ACM Transactions on Information Systems (TOIS)
The query-flow graph: model and applications
Proceedings of the 17th ACM conference on Information and knowledge management
Beyond the session timeout: automatic hierarchical segmentation of search topics in query logs
Proceedings of the 17th ACM conference on Information and knowledge management
Query suggestions using query-flow graphs
Proceedings of the 2009 workshop on Web Search Click Data
Quicklink selection for navigational query results
Proceedings of the 18th international conference on World wide web
Enhancing hyperlink structure for improving web performance
Journal of Web Engineering
Query recommendation using query logs in search engines
EDBT'04 Proceedings of the 2004 international conference on Current Trends in Database Technology
Proceedings of the fourth ACM international conference on Web search and data mining
CONQUER: a system for efficient context-aware query suggestions
Proceedings of the 20th international conference companion on World wide web
Query reformulation mining: models, patterns, and applications
Information Retrieval
Towards contextual search: social networks, short contexts and multiple personas
UMAP'11 Proceedings of the 19th international conference on User modeling, adaption, and personalization
Mining Concept Sequences from Large-Scale Search Logs for Context-Aware Query Suggestion
ACM Transactions on Intelligent Systems and Technology (TIST)
Query suggestion by constructing term-transition graphs
Proceedings of the fifth ACM international conference on Web search and data mining
Structured query suggestion for specialization and parallel movement: effect on search behaviors
Proceedings of the 21st international conference on World Wide Web
More than relevance: high utility query recommendation by mining users' search behaviors
Proceedings of the 21st ACM international conference on Information and knowledge management
Recommending high utility query via session-flow graph
ECIR'13 Proceedings of the 35th European conference on Advances in Information Retrieval
Journal of Web Engineering
Concept based query recommendation
AusDM '11 Proceedings of the Ninth Australasian Data Mining Conference - Volume 121
A vlHMM approach to context-aware search
ACM Transactions on the Web (TWEB)
QUBiC: An adaptive approach to query-based recommendation
Journal of Intelligent Information Systems
Analyzing, Detecting, and Exploiting Sentiment in Web Queries
ACM Transactions on the Web (TWEB)
Interactive interface for query formulation
Proceedings of the 25th Australian Computer-Human Interaction Conference: Augmentation, Application, Innovation, Collaboration
A probabilistic optimization framework for the empty-answer problem
Proceedings of the VLDB Endowment
When do people use query suggestion? A query suggestion log analysis
Information Retrieval
Hi-index | 0.00 |
Query recommendation is an integral part of modern search engines. The goal of query recommendation is to facilitate users while searching for information. Query recommendation also allows users to explore concepts related to their information needs. In this paper, we present a formal treatment of the problem of query recommendation. In our framework we model the querying behavior of users by a probabilistic reformula- tion graph, or query-flow graph [Boldi et al. CIKM 2008]. A sequence of queries submitted by a user can be seen as a path on this graph. Assigning score values to queries allows us to define suitable utility functions and to consider the expected utility achieved by a reformulation path on the query-flow graph. Providing recommendations can be seen as adding shortcuts in the query-flow graph that "nudge" the reformulation paths of users, in such a way that users are more likely to follow paths with larger expected utility. We discuss in detail the most important questions that arise in the proposed framework. In particular, we provide examples of meaningful utility functions to optimize, we discuss how to estimate the effect of recommendations on the reformulation probabilities, we address the complexity of the optimization problems that we consider, we suggest efficient algorithmic solutions, and we validate our models and algorithms with extensive experimentation. Our techniques can be applied to other scenarios where user behavior can be modeled as a Markov process.