Query Expansion via structural motifs in Wikipedia Graph
The search for relevant information can be very frustrating for users who, unintentionally, use too general or inappropriate keywords to express their requests. To overcome this situation, query expansion techniques aim at transforming the user request by adding new terms, referred as expansion features, that better describe the real intent of the users. We propose a method that relies exclusively on relevant structures (as opposed to the use of semantics) found in knowledge bases (KBs) to extract the expansion features. We call our method Structural Query Expansion (SQE). The structural analysis of KBs takes us to propose a set of structural motifs that connect their strongly related entries, which can be used to extract expansion features. In this paper we use Wikipedia as our KB, which is probably one of the largest sources of information. SQE is capable of achieving more than 150% improvement over non expanded queries and is able to identify the expansion features in less than 0.2 seconds in the worst case scenario. Most significantly, we believe that we are contributing to open new research directions in query expansion, proposing a method that is orthogonal to many current systems. For example, SQE improves pseudo-relevance feedback techniques up to 13%
Code (0)
등록된 구현이 없습니다.
Similar Papers 제목 키워드 기반
Wiki-MetaSemantik: A Wikipedia-derived Query Expansion Approach based on Network Properties
This paper discusses the use of Wikipedia for building semantic ontologies to do Query Expansion (QE) in order to improve the search results of search engines. In this technique, selecting related Wikipedia concepts beco…
A new approach for query expansion using Wikipedia and WordNet
Query expansion (QE) is a well-known technique used to enhance the effectiveness of information retrieval. QE reformulates the initial query by adding similar terms that help in retrieving more relevant results. Several …
Information RetrievalRetrievalCN-Motifs Perceptive Graph Neural Networks
Graph neural networks (GNNs) have been the dominant approaches for graph representation learning. However, most GNNs are applied to homophily graphs and perform poorly on heterophily graphs. Meanwhile, these GNNs fail to…
Graph Representation LearningNode ClassificationRepresentation LearningBeyond the Reranker: Do RAG Retrieval Enhancements Help Once a Strong Reranker Is Present?
Retrieval-augmented generation (RAG) is routinely extended with methods meant to improve retrieval: query expansion, hierarchical and cross-document summarization, graph-based expansion, per-query routing, rank fusion, a…
Document SummarizationBenchmark for Complex Answer Retrieval
Retrieving paragraphs to populate a Wikipedia article is a challenging task. The new TREC Complex Answer Retrieval (TREC CAR) track introduces a comprehensive dataset that targets this retrieval scenario. We present earl…
Information RetrievalRetrieval