Skip to content
University of Maryland LibrariesDigital Repository at the University of Maryland
    • Login
    View Item 
    •   DRUM
    • College of Computer, Mathematical & Natural Sciences
    • Biology
    • Biology Research Works
    • View Item
    •   DRUM
    • College of Computer, Mathematical & Natural Sciences
    • Biology
    • Biology Research Works
    • View Item
    JavaScript is disabled for your browser. Some features of this site may not work without it.

    The partitioned LASSO-patternsearch algorithm with application to gene expression data

    Thumbnail
    View/Open
    1471-2105-13-98.pdf (640.0Kb)
    No. of downloads: 16

    External Link(s)
    https://doi.org/10.1186/1471-2105-13-98
    Date
    2012-05-15
    Author
    Shi, Weiliang
    Wahba, Grace
    Irizarry, Rafael A
    Corrada Bravo, Hector
    Wright, Stephen J
    Citation
    Shi, W., Wahba, G., Irizarry, R.A. et al. The partitioned LASSO-patternsearch algorithm with application to gene expression data. BMC Bioinformatics 13, 98 (2012).
    DRUM DOI
    https://doi.org/10.13016/glwy-155v
    Metadata
    Show full item record
    Abstract
    In systems biology, the task of reverse engineering gene pathways from data has been limited not just by the curse of dimensionality (the interaction space is huge) but also by systematic error in the data. The gene expression barcode reduces spurious association driven by batch effects and probe effects. The binary nature of the resulting expression calls lends itself perfectly to modern regularization approaches that thrive in high-dimensional settings. The Partitioned LASSO-Patternsearch algorithm is proposed to identify patterns of multiple dichotomous risk factors for outcomes of interest in genomic studies. A partitioning scheme is used to identify promising patterns by solving many LASSO-Patternsearch subproblems in parallel. All variables that survive this stage proceed to an aggregation stage where the most significant patterns are identified by solving a reduced LASSO-Patternsearch problem in just these variables. This approach was applied to genetic data sets with expression levels dichotomized by gene expression bar code. Most of the genes and second-order interactions thus selected and are known to be related to the outcomes. We demonstrate with simulations and data analyses that the proposed method not only selects variables and patterns more accurately, but also provides smaller models with better prediction accuracy, in comparison to several alternative methodologies.
    URI
    http://hdl.handle.net/1903/28065
    Collections
    • Biology 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