• Login
    View Item 
    •   DSpace@RPI Home
    • Rensselaer Libraries
    • RPI Theses Online (Complete)
    • View Item
    •   DSpace@RPI Home
    • Rensselaer Libraries
    • RPI Theses Online (Complete)
    • View Item
    JavaScript is disabled for your browser. Some features of this site may not work without it.

    Search algorithms for promotion of novel biomedical research

    Author
    Mukherjee, Partha Sarathi
    View/Open
    178187_Mukherjee_rpi_0185N_11042.pdf (243.5Kb)
    Other Contributors
    Szymanśki, Bolesław; Magdon-Ismail, Malik; Krishnamoorthy, M. S.;
    Date Issued
    2017-05
    Subject
    Computer science
    Degree
    MS;
    Terms of Use
    This electronic version is a licensed copy owned by Rensselaer Polytechnic Institute, Troy, NY. Copyright of original work retained by author.;
    Metadata
    Show full item record
    URI
    https://hdl.handle.net/20.500.13015/1945
    Abstract
    A major problem plaguing the field of biomedical research is the tendency to perform safe, incremental research.This implies that biomedical researchers tend to collaborate with other researchers who are already "close" to them in their co-authorship networks or citation networks. We propose a novel method to find new potential collaborators in the Synergy research project. The idea is to include information from molecular networks and propose researchers working on "nearby" molecules as potential collaborators. Based on this idea, we have built a software application where a biomedical researcher could input a list of molecules of her choice and find several ranked lists of potential collaborators as output. The underlying network is the Synergy network - a multilayer network formed from data in the PubMed database. This Master's thesis describes the algorithms to find and sort these potential collaborators. These have been implemented in Java in the Synergy software application. The algorithms output the results within minutes even with tens of millions of author nodes and publication nodes in the network. Several potential collaborators are identified with sample lists of molecules in this thesis. Finally, this thesis validates the results found by comparing the probability of molecules which serve as research topics of two co-authors as being neighbors to the probability of molecules chosen at random being neighbors. It is found that the former is considerably higher than the latter.;
    Description
    May 2017; School of Science
    Department
    Dept. of Computer Science;
    Publisher
    Rensselaer Polytechnic Institute, Troy, NY
    Relationships
    Rensselaer Theses and Dissertations Online Collection;
    Access
    Restricted to current Rensselaer faculty, staff and students. Access inquiries may be directed to the Rensselaer Libraries.;
    Collections
    • RPI Theses Online (Complete)

    Browse

    All of DSpace@RPICommunities & CollectionsBy Issue DateAuthorsTitlesSubjectsThis CollectionBy Issue DateAuthorsTitlesSubjects

    My Account

    Login

    DSpace software copyright © 2002-2022  DuraSpace
    Contact Us | Send Feedback
    DSpace Express is a service operated by 
    Atmire NV