Clustering user queries of a search engine
Proceedings of the 10th international conference on World Wide Web
Center-piece subgraphs: problem definition and fast solutions
Proceedings of the 12th ACM SIGKDD international conference on Knowledge discovery and data mining
Heads and tails: studies of web search with common and rare queries
SIGIR '07 Proceedings of the 30th 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
From "Dango" to "Japanese Cakes": Query Reformulation Models and Patterns
WI-IAT '09 Proceedings of the 2009 IEEE/WIC/ACM International Joint Conference on Web Intelligence and Intelligent Agent Technology - Volume 01
Optimal rare query suggestion with implicit user feedback
Proceedings of the 19th international conference on World wide web
Mining Query Logs: Turning Search Usage Data into Knowledge
Foundations and Trends in Information Retrieval
| Hi-index | 0.00 |
We define a new approach to the query recommendation problem. In particular, our main goal is to design a model enabling the generation of query suggestions also for rare and previously unseen queries. In other words we are targeting queries in the long tail. The model is based on a graph having two sets of nodes: Term nodes, and Query nodes. The graph induces a Markov chain on which a generic random walker starts from a subset of Term nodes, moves along Query nodes, and restarts (with a given probability) only from the same initial subset of Term nodes. Computing the stationary distribution of such a Markov chain is equivalent to extracting the so-called Center-piece Subgraph from the graph associated with the Markov chain itself. Given a query, we extract its terms and we set the restart subset to this term set. Therefore, we do not require a query to have been previously observed for the recommending model to be able to generate suggestions.