PageRank without hyperlinks: Reranking with PubMed related article networks for biomedical text retrieval
Lists
Only you see this
Abstract
Graph analysis algorithms such as PageRank and HITS have been successful in Web environments because they are able to extract important inter-document relationships from manually-created hyperlinks. We consider the application of these techniques to biomedical text retrieval. In the current PubMed® search interface, a MEDLINE® citation is connected to a number of related citations, which are in turn connected to other citations. Thus, a MEDLINE record represents a node in a vast content-similarity network. This article explores the hypothesis that these networks can be exploited for text retrieval, in the same manner as hyperlink graphs on the Web.
BibTeX
@article{lin2008pagerank,
author = {Jimmy Lin},
title = {{PageRank without hyperlinks: Reranking with PubMed related article networks for biomedical text retrieval}},
journal = {BMC Bioinformatics},
year = {2008},
doi = {10.1186/1471-2105-9-270},
}Loading related content...