Skip to content
University of Maryland LibrariesDigital Repository at the University of Maryland
    • Login
    View Item 
    •   DRUM
    • College of Information Studies
    • Information Studies
    • Information Studies Research Works
    • View Item
    •   DRUM
    • College of Information Studies
    • Information Studies
    • Information Studies Research Works
    • View Item
    JavaScript is disabled for your browser. Some features of this site may not work without it.

    PageRank without hyperlinks: Reranking with PubMed related article networks for biomedical text retrieval

    Thumbnail
    View/Open
    1471-2105-9-270.pdf (823.6Kb)
    No. of downloads: 36

    External Link(s)
    https://doi.org/10.1186/1471-2105-9-270
    Date
    2008-06-06
    Author
    Lin, Jimmy
    Citation
    Lin, J. PageRank without hyperlinks: Reranking with PubMed related article networks for biomedical text retrieval. BMC Bioinformatics 9, 270 (2008).
    DRUM DOI
    https://doi.org/10.13016/eh1g-07n0
    Metadata
    Show full item record
    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. We conducted a number of reranking experiments using the TREC 2005 genomics track test collection in which scores extracted from PageRank and HITS analysis were combined with scores returned by an off-the-shelf retrieval engine. Experiments demonstrate that incorporating PageRank scores yields significant improvements in terms of standard ranked-retrieval metrics. The link structure of content-similarity networks can be exploited to improve the effectiveness of information retrieval systems. These results generalize the applicability of graph analysis algorithms to text retrieval in the biomedical domain.
    URI
    http://hdl.handle.net/1903/28195
    Collections
    • Information Studies Research Works

    DRUM is brought to you by the University of Maryland Libraries
    University of Maryland, College Park, MD 20742-7011 (301)314-1328.
    Please send us your comments.
    Web Accessibility
     

     

    Browse

    All of DRUMCommunities & CollectionsBy Issue DateAuthorsTitlesSubjectsThis CollectionBy Issue DateAuthorsTitlesSubjects

    My Account

    LoginRegister
    Pages
    About DRUMAbout Download Statistics

    DRUM is brought to you by the University of Maryland Libraries
    University of Maryland, College Park, MD 20742-7011 (301)314-1328.
    Please send us your comments.
    Web Accessibility