Algorithms for the Longest Common Subsequence Problem
Journal of the ACM (JACM)
Interactive Internet search: keyword, directory and query reformulation mechanisms compared
SIGIR '00 Proceedings of the 23rd annual international ACM SIGIR conference on Research and development in information retrieval
Learning to Solve Markovian Decision Processes
Learning to Solve Markovian Decision Processes
Ontology mapping: the state of the art
The Knowledge Engineering Review
A study of smoothing methods for language models applied to information retrieval
ACM Transactions on Information Systems (TOIS)
Combining the language model and inference network approaches to retrieval
Information Processing and Management: an International Journal - Special issue: Bayesian networks and information retrieval
Evaluating implicit feedback models using searcher simulations
ACM Transactions on Information Systems (TOIS)
To personalize or not to personalize: modeling queries with variation in user intent
Proceedings of the 31st annual international ACM SIGIR conference on Research and development in information retrieval
A unified and discriminative model for query refinement
Proceedings of the 31st annual international ACM SIGIR conference on Research and development in information retrieval
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
Reinforcement learning: a survey
Journal of Artificial Intelligence Research
Analyzing and evaluating query reformulation strategies in web search logs
Proceedings of the 18th ACM conference on Information and knowledge management
Optimal rare query suggestion with implicit user feedback
Proceedings of the 19th international conference on World wide web
Personalizing information retrieval for multi-session tasks: the roles of task stage and task type
Proceedings of the 33rd international ACM SIGIR conference on Research and development in information retrieval
Ready to buy or just browsing?: detecting web searcher goals from interaction data
Proceedings of the 33rd international ACM SIGIR conference on Research and development in information retrieval
Query similarity by projecting the query-flow graph
Proceedings of the 33rd international ACM SIGIR conference on Research and development in information retrieval
Analysis and evaluation of query reformulations in different task types
Proceedings of the 73rd ASIS&T Annual Meeting on Navigating Streams in an Information Ecosystem - Volume 47
Intentions and attention in exploratory health search
Proceedings of the 34th international ACM SIGIR conference on Research and development in Information Retrieval
Efficient and effective spam filtering and re-ranking for large web datasets
Information Retrieval
Simulating simple user behavior for system effectiveness evaluation
Proceedings of the 20th ACM international conference on Information and knowledge management
Query suggestion by constructing term-transition graphs
Proceedings of the fifth ACM international conference on Web search and data mining
Personalization of search results using interaction behaviors in search sessions
SIGIR '12 Proceedings of the 35th international ACM SIGIR conference on Research and development in information retrieval
Increasing stability of result organization for session search
ECIR'13 Proceedings of the 35th European conference on Advances in Information Retrieval
| Hi-index | 0.00 |
Session search is the Information Retrieval (IR) task that performs document retrieval for a search session. During a session, a user constantly modifies queries in order to find relevant documents that fulfill the information need. This paper proposes a novel query change retrieval model (QCM), which utilizes syntactic editing changes between adjacent queries as well as the relationship between query change and previously retrieved documents to enhance session search. We propose to model session search as a Markov Decision Process (MDP). We consider two agents in this MDP: the user agent and the search engine agent. The user agent's actions are query changes that we observe and the search agent's actions are proposed in this paper. Experiments show that our approach is highly effective and outperforms top session search systems in TREC 2011 and 2012.