Mining association rules between sets of items in large databases
SIGMOD '93 Proceedings of the 1993 ACM SIGMOD international conference on Management of data
SIGIR '02 Proceedings of the 25th annual international ACM SIGIR conference on Research and development in information retrieval
Cumulated gain-based evaluation of IR techniques
ACM Transactions on Information Systems (TOIS)
Fast Algorithms for Mining Association Rules in Large Databases
VLDB '94 Proceedings of the 20th International Conference on Very Large Data Bases
Mining Frequent Patterns without Candidate Generation: A Frequent-Pattern Tree Approach
Data Mining and Knowledge Discovery
Evaluating implicit measures to improve web search
ACM Transactions on Information Systems (TOIS)
Accurate unlexicalized parsing
ACL '03 Proceedings of the 41st Annual Meeting on Association for Computational Linguistics - Volume 1
Data Mining: Concepts and Techniques
Data Mining: Concepts and Techniques
Learning user interaction models for predicting web search result preferences
SIGIR '06 Proceedings of the 29th annual international ACM SIGIR conference on Research and development in information retrieval
Improving web search ranking by incorporating user behavior information
SIGIR '06 Proceedings of the 29th annual international ACM SIGIR conference on Research and development in information retrieval
SIGIR '06 Proceedings of the 29th annual international ACM SIGIR conference on Research and development in information retrieval
Investigating behavioral variability in web search
Proceedings of the 16th international conference on World Wide Web
Web projections: learning from contextual subgraphs of the web
Proceedings of the 16th international conference on World Wide Web
AdaRank: a boosting algorithm for information retrieval
SIGIR '07 Proceedings of the 30th annual international ACM SIGIR conference on Research and development in information retrieval
Query performance prediction in web search environments
SIGIR '07 Proceedings of the 30th annual international ACM SIGIR conference on Research and development in information retrieval
How well does result relevance predict session satisfaction?
SIGIR '07 Proceedings of the 30th annual international ACM SIGIR conference on Research and development in information retrieval
The relationship between IR effectiveness measures and user satisfaction
SIGIR '07 Proceedings of the 30th annual international ACM SIGIR conference on Research and development in information retrieval
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
Pfp: parallel fp-growth for query recommendation
Proceedings of the 2008 ACM conference on Recommender systems
Improved query difficulty prediction for the web
Proceedings of the 17th ACM conference on Information and knowledge management
Models of searching and browsing: languages, studies, and applications
IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
Characterizing and predicting search engine switching behavior
Proceedings of the 18th ACM conference on Information and knowledge management
The WEKA data mining software: an update
ACM SIGKDD Explorations Newsletter
Beyond DCG: user behavior as a predictor of a successful search
Proceedings of the third ACM international conference on Web search and data mining
Discounted cumulated gain based evaluation of multiple-query IR sessions
ECIR'08 Proceedings of the IR research, 30th European conference on Advances in information retrieval
Predicting searcher frustration
Proceedings of the 33rd international ACM SIGIR conference on Research and development in information retrieval
Assessing the scenic route: measuring the value of search trails in web logs
Proceedings of the 33rd international ACM SIGIR conference on Research and development in information retrieval
Predicting query performance using query, result, and user interaction features
RIAO '10 Adaptivity, Personalization and Fusion of Heterogeneous Information
Inferring and using location metadata to personalize web search
Proceedings of the 34th international ACM SIGIR conference on Research and development in Information Retrieval
Why searchers switch: understanding and predicting engine switching rationales
Proceedings of the 34th international ACM SIGIR conference on Research and development in Information Retrieval
Find it if you can: a game for modeling different types of web search success using interaction data
Proceedings of the 34th international ACM SIGIR conference on Research and development in Information Retrieval
Proceedings of the 20th ACM international conference on Information and knowledge management
Effects of search success on search engine re-use
Proceedings of the 20th ACM international conference on Information and knowledge management
Mining for insights in the search engine query stream
Proceedings of the 21st international conference companion on World Wide Web
Hi-index | 0.00 |
Search engines receive queries with a broad range of different search intents. However, they do not perform equally well for all queries. Understanding where search engines perform poorly is critical for improving their performance. In this paper, we present a method for automatically identifying poorly-performing query groups where a search engine may not meet searcher needs. This allows us to create coherent query clusters that help system design-ers generate actionable insights about necessary changes and helps learning-to-rank algorithms better learn relevance signals via spe-cialized rankers. The result is a framework capable of estimating dissatisfaction from Web search logs and learning to improve per-formance for dissatisfied queries. Through experimentation, we show that our method yields good quality groups that align with established retrieval performance metrics. We also show that we can significantly improve retrieval effectiveness via specialized rankers, and that coherent grouping of underperforming queries generated by our method is important in improving each group.