WordNet: a lexical database for English
Communications of the ACM
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
ACM SIGIR Forum
Mining Generalized Query Patterns from Web Logs
HICSS '01 Proceedings of the 34th Annual Hawaii International Conference on System Sciences ( HICSS-34)-Volume 5 - Volume 5
Automatic identification of user goals in Web search
WWW '05 Proceedings of the 14th international conference on World Wide Web
Getting work done on the web: supporting transactional queries
SIGIR '06 Proceedings of the 29th annual international ACM SIGIR conference on Research and development in information retrieval
MapReduce: simplified data processing on large clusters
OSDI'04 Proceedings of the 6th conference on Symposium on Opearting Systems Design & Implementation - Volume 6
Determining the informational, navigational, and transactional intent of Web queries
Information Processing and Management: an International Journal
Towards recency ranking in web search
Proceedings of the third ACM international conference on Web search and data mining
Exploring features for the automatic identification of user goals in web search
Information Processing and Management: an International Journal
Towards rich query interpretation: walking back and forth for mining query templates
Proceedings of the 19th international conference on World wide web
Improving recommendation for long-tail queries via templates
Proceedings of the 20th international conference on World wide web
Transactional query identification in web search
AIRS'05 Proceedings of the Second Asia conference on Asia Information Retrieval Technology
Hi-index | 0.00 |
Search queries have been roughly classified into three categories --- navigational, informational and transactional. The latter group includes queries that aim to perform some Web-mediated task, often by interacting with parameterized Web services. In order to assist users in completing tasks online, one of the first building blocks is identifying whether and which transactional use-case is associated with each query. This paper describes a framework and an algorithm for automatically generating compact representations of queries associated with transactional use cases. We mine search click logs for queries that lead to clicks on pages associated with a use-case, generalize the set of mined queries into templates by replacing query terms with taxonomy categories, and eliminate redundancies. This approach allows associating the use-case with queries unseen in the log sample, while keeping a concise model. Our methodology allows a business owner to select an appropriate operating point that balances the tradeoff between precision and recall. We report the results of an offline evaluation of our framework on three transactional domains, and demonstrate the viability of the approach.