Using centrality to rank web snippets

1Citations
Citations of this article
3Readers
Mendeley users who have this article in their library.
Get full text

Abstract

We describe our participation in the WebCLEF 2007 task, targeted at snippet retrieval from web data. Our system ranks snippets based on a simple similarity-based centrality, inspired by the web page ranking algorithms. We experimented with retrieval units (sentences and paragraphs) and with the similarity functions used for centrality computations (word overlap and cosine similarity). We found that using paragraphs with the cosine similarity function shows the best performance with precision around 20% and recall around 25% according to human assessments of the first 7,000 bytes of responses for individual topics. © 2008 Springer-Verlag Berlin Heidelberg.

Cite

CITATION STYLE

APA

Jijkoun, V., & De Rijke, M. (2008). Using centrality to rank web snippets. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5152 LNCS, pp. 737–741). Springer Verlag. https://doi.org/10.1007/978-3-540-85760-0_94

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free