[go: up one dir, main page]
More Web Proxy on the site http://driver.im/
Skip to content
/ npdr Public

NPDR: Nearest-neighbor Projected-Distance Regression with the generalized linear model

License

Unknown, MIT licenses found

Licenses found

Unknown
LICENSE
MIT
LICENSE.md
Notifications You must be signed in to change notification settings

insilico/npdr

Repository files navigation

Nearest-neighbor Projected-Distance Regression (NPDR)

Trang T. Le, Bryan A. Dawkins, B. A. McKinney. “Nearest-neighbor Projected-Distance Regression (NPDR) for detecting network interactions with adjustments for multiple tests and confounding,” Bioinformatics, Volume 36, Issue 9, May 2020, Pages 2770–2777 free.

NPDR is a nearest-neighbor feature selection algorithm that fits a generalized linear model for projected distances of a given attribute over all pairs of instances in a neighborhood. In the NPDR model, the predictor is the attribute distance between neighbors projected onto the attribute dimension, and the outcome is the projected phenotype distance (for quantitative traits) or hit/miss (for case/control) between all pairs of nearest neighbor instances. NPDR can fit any combination of predictor data types (categorical or numeric) and outcome data types (case-control or quantitative) as well as adjust for covariates that may be confounding. As with STIR (STatistical Inference Relief), NDPR allows for the calculation of statistical significance of importance scores and adjustment for multiple testing.

Install

You can install the development version from GitHub with remotes:

# install.packages("remotes") # uncomment to install remotes
remotes::install_github("insilico/npdr")

library(npdr)
# data(package = "npdr")

Dependencies

To set fast.reg = TRUE or fast.dist = TRUE or use.glmnet = TRUE, please install the speedglm and glmnet packages:

install.packages(c("speedglm", "wordspace", "glmnet"))

If an issue arises with updating openssl, try updating it on your own system, e.g. for MacOS brew install openssl@1.1.

Details

Relief-based methods are nearest-neighbor machine learning feature selection algorithms that compute the importance of attributes that may involve interactions in high-dimensional data. Previously we introduced STIR, which extended Relief-based methods to compute statistical significance of attributes in case-control data by reformulating the Relief score as a pseudo t-test. Here we extend the statistical formalism of STIR to a generalized linear model (glm) formalism to handle quantitative and case-control outcome variables, any predictor data type (continuous or categorical), and adjust for covariates while computing statistical significance of attributes.

Contact

brett.mckinney@gmail.com

Websites

Related references