PageRank without hyperlinks: Reranking with PubMed related article networks for biomedical text retrieval
Author:
Open Access
- 6 June 2008
- journal article
- Published by Springer Nature in BMC Bioinformatics
- Vol. 9 (1) , 270
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.Keywords
This publication has 16 references indexed in Scilit:
- Navigating information spaces: A case study of related article search in PubMedInformation Processing & Management, 2008
- How Do Users Find Things with PubMed? Towards Automatic Utility Evaluation with User Simulations2008
- PubMed related articles: a probabilistic topic-based model for content similarityBMC Bioinformatics, 2007
- Find-similar2006
- Cluster-based retrieval using language models2004
- Probabilistic models of information retrieval based on measuring the divergence from randomnessACM Transactions on Information Systems, 2002
- Information foraging.Psychological Review, 1999
- Authoritative sources in a hyperlinked environmentJournal of the ACM, 1999
- The effectiveness of document neighboring in search enhancementInformation Processing & Management, 1994
- The cluster hypothesis revisited1985