In this article, we apply a graph-based approach for pseudo-relevance feedback. We model term co-occurrences in a fixed window or at the document level as a graph and apply a random walk algorithm to select expansion terms. Evaluation of the proposed approach on several standard TREC and CLEF collections including the recent TREC-Microblog dataset show that this approach is in line with state-of-the-art pseudo-relevance feedback models. © 2012 Springer-Verlag Berlin Heidelberg.
CITATION STYLE
De Groc, C., & Tannier, X. (2012). Experiments on pseudo relevance feedback using graph random walks. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7608 LNCS, pp. 193–198). Springer Verlag. https://doi.org/10.1007/978-3-642-34109-0_20
Mendeley helps you to discover research relevant for your work.