Computer Science – Information Retrieval
Scientific paper
2011-04-16
Proceedings of the VLDB Endowment (PVLDB), Vol. 4, No. 6, pp. 350-361 (2011)
Computer Science
Information Retrieval
VLDB2011
Scientific paper
Query expansion is a functionality of search engines that suggests a set of related queries for a user-issued keyword query. Typical corpus-driven keyword query expansion approaches return popular words in the results as expanded queries. Using these approaches, the expanded queries may correspond to a subset of possible query semantics, and thus miss relevant results. To handle ambiguous queries and exploratory queries, whose result relevance is difficult to judge, we propose a new framework for keyword query expansion: we start with clustering the results according to user specified granularity, and then generate expanded queries, such that one expanded query is generated for each cluster whose result set should ideally be the corresponding cluster. We formalize this problem and show its APX-hardness. Then we propose two efficient algorithms named iterative single-keyword refinement and partial elimination based convergence, respectively, which effectively generate a set of expanded queries from clustered results that provide a classification of the original query results. We believe our study of generating an optimal query based on the ground truth of the query results not only has applications in query expansion, but has significance for studying keyword search quality in general.
Chen Yi
Liu Ziyang
Natarajan Sivaramakrishnan
No associations
LandOfFree
Query Expansion Based on Clustered Results does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Query Expansion Based on Clustered Results, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Query Expansion Based on Clustered Results will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-346861