Reexamining the cluster hypothesis: scatter/gather on retrieval results
SIGIR '96 Proceedings of the 19th annual international ACM SIGIR conference on Research and development in information retrieval
A threshold of ln n for approximating set cover
Journal of the ACM (JACM)
Improving the effectiveness of information retrieval with local context analysis
ACM Transactions on Information Systems (TOIS)
On the red-blue set cover problem
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
Helping people find what they don't know
Communications of the ACM
Agglomerative clustering of a search engine query log
Proceedings of the sixth ACM SIGKDD international conference on Knowledge discovery and data mining
Clustering user queries of a search engine
Proceedings of the 10th international conference on World Wide Web
Approximation algorithms
Modern Information Retrieval
Set-based model: a new approach for information retrieval
SIGIR '02 Proceedings of the 25th annual international ACM SIGIR conference on Research and development in information retrieval
Evaluation of hierarchical clustering algorithms for document datasets
Proceedings of the eleventh international conference on Information and knowledge management
Constrained K-means Clustering with Background Knowledge
ICML '01 Proceedings of the Eighteenth International Conference on Machine Learning
Approximation algorithms for combinatorial problems
STOC '73 Proceedings of the fifth annual ACM symposium on Theory of computing
Proceedings of the 13th international conference on World Wide Web
Learning to cluster web search results
Proceedings of the 27th annual international ACM SIGIR conference on Research and development in information retrieval
A personalized search engine based on web-snippet hierarchical clustering
WWW '05 Special interest tracks and posters of the 14th international conference on World Wide Web
Introduction to Data Mining, (First Edition)
Introduction to Data Mining, (First Edition)
Concept-based interactive query expansion
Proceedings of the 14th ACM international conference on Information and knowledge management
Mining search engine query logs for query recommendation
Proceedings of the 15th international conference on World Wide Web
How are we searching the world wide web?: a comparison of nine search engine transaction logs
Information Processing and Management: an International Journal - Special issue: Formal methods for information retrieval
Approximation algorithms for the Label-CoverMAX and Red-Blue Set Cover problems
Journal of Discrete Algorithms
An experimental comparison of click position-bias models
WSDM '08 Proceedings of the 2008 International Conference on Web Search and Data Mining
Query-sets: using implicit feedback and query patterns to organize web documents
Proceedings of the 17th international conference on World Wide Web
Constrained Clustering: Advances in Algorithms, Theory, and Applications
Constrained Clustering: Advances in Algorithms, Theory, and Applications
Discovering search engine related queries using association rules
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
Optimising topical query decomposition
Proceedings of the 2009 workshop on Web Search Click Data
A Query Substitution-Search Result Refinement Approach for Long Query Web Searches
WI-IAT '09 Proceedings of the 2009 IEEE/WIC/ACM International Joint Conference on Web Intelligence and Intelligent Agent Technology - Volume 01
Graph structures and algorithms for query-log analysis
CiE'10 Proceedings of the Programs, proofs, process and 6th international conference on Computability in Europe
On the selection of tags for tag clouds
Proceedings of the fourth ACM international conference on Web search and data mining
Making interval-based clustering rank-aware
Proceedings of the 14th International Conference on Extending Database Technology
Identifying aspects for web-search queries
Journal of Artificial Intelligence Research
Topical clustering of search results
Proceedings of the fifth ACM international conference on Web search and data mining
Discovering coverage patterns for banner advertisement placement
PAKDD'12 Proceedings of the 16th Pacific-Asia conference on Advances in Knowledge Discovery and Data Mining - Volume Part II
Dynamic covering for recommendation systems
Proceedings of the 21st ACM international conference on Information and knowledge management
From keywords to keyqueries: content descriptors for the web
Proceedings of the 36th international ACM SIGIR conference on Research and development in information retrieval
| Hi-index | 0.00 |
We introduce the problem of query decomposition, where we are given a query and a document retrieval system, and we want to produce a small set of queries whose union of resulting documents corresponds approximately to that of the original query. Ideally, these queries should represent coherent, conceptually well-separated topics. We provide an abstract formulation of the query decomposition problem, and we tackle it from two different perspectives. We first show how the problem can be instantiated as a specific variant of a set cover problem, for which we provide an efficient greedy algorithm. Next, we show how the same problem can be seen as a constrained clustering problem, with a very particular kind of constraint, i.e., clustering with predefined clusters. We develop a two-phase algorithm based on hierarchical agglomerative clustering followed by dynamic programming. Our experiments, conducted on a set of actual queries in a Web scale search engine, confirm the effectiveness of the proposed solutions.