Event-Driven Query Expansion
A significant number of event-related queries are issued in Web search. In this paper, we seek to improve retrieval performance by leveraging events and specifically target the classic task of query expansion. We propose a method to expand an event-related query by first detecting the events related to it. Then, we derive the candidates for expansion as terms semantically related to both the query and the events. To identify the candidates, we utilize a novel mechanism to simultaneously embed words and events in the same vector space. We show that our proposed method of leveraging events improves query expansion performance significantly compared with state-of-the-art methods on various newswire TREC datasets.
Code (1)
Tasks
Ad-Hoc Information RetrievalRetrievalSimilar Papers 제목 키워드 기반
Proactive Query Expansion for Streaming Data Using External Source
Query expansion is the process of reformulating the original query by adding relevant words. Choosing which terms to add in order to improve the performance of the query expansion methods or to enhance the quality of the…
Information RetrievalRetrievalTopic ModelsMerchandise Recommendation for Retail Events with Word Embedding Weighted Tf-idf and Dynamic Query Expansion
To recommend relevant merchandises for seasonal retail events, we rely on item retrieval from marketplace inventory. With feedback to expand query scope, we discuss keyword expansion candidate selection using word embedd…
RetrievalJoint Modeling for Query Expansion and Information Extraction with Reinforcement Learning
Information extraction about an event can be improved by incorporating external evidence. In this study, we propose a joint model for pseudo-relevance feedback based query expansion and information extraction with reinfo…
Decision Makingreinforcement-learningReinforcement LearningReinforcement Learning (RL)+1Event-Centric Query Expansion in Web Search
In search engines, query expansion (QE) is a crucial technique to improve search experience. Previous studies often rely on long-term search log mining, which leads to slow updates and is sub-optimal for time-sensitive n…
Contrastive LearningRetrievalSemantic RetrievalAnchorPrune: Relevance-Anchored Contextual Expansion for Visual Token Pruning
Large vision-language models incur substantial inference costs because high-resolution inputs introduce thousands of visual tokens, many of which are redundant for a given query. Existing pruning methods often combine qu…