FastStepGraph

FastStepGraph

https://github.com/juancolonna/faststepgraph

Science Score: 23.0%

This score indicates how likely this project is to be science-related based on various indicators:

  • CITATION.cff file
  • codemeta.json file
  • .zenodo.json file
  • DOI references
    Found 3 DOI reference(s) in README
  • Academic publication links
    Links to: zenodo.org
  • Academic email domains
  • Institutional organization owner
  • JOSS paper metadata
  • Scientific vocabulary similarity
    Low similarity (9.9%) to scientific vocabulary
Last synced: 10 months ago · JSON representation

Repository

FastStepGraph

Basic Info
  • Host: GitHub
  • Owner: juancolonna
  • License: other
  • Language: HTML
  • Default Branch: main
  • Size: 12.7 MB
Statistics
  • Stars: 1
  • Watchers: 1
  • Forks: 0
  • Open Issues: 0
  • Releases: 0
Created about 3 years ago · Last pushed almost 3 years ago
Metadata Files
Readme License

README.md

Fast Step Graph

image

Fast Step Graph is an optimized implementation in R of the Stepwise approach used for discovering high-dimensional Gaussian Graphical Models. It aims to accurately estimate the $\mathbf{\Omega}$ precision matrix when dealing with datasets where the number of features is significantly larger than the number of samples ($p >> n$), such as in genomics.

This implementation builds upon the original code available at link, which accompanies the associated research paper. Fast Step Graph enhances the computational efficiency of the original code to handle much larger graph structures than previously reported, while reducing the training time. Several improvements have been made, including the elimination of redundant code, utilization of column-wise data structures (better for R), avoid list creation, manipulation and expansion within loops, and the integration of a faster subroutine for regression. Additionally, this implementation addresses a bug introduced in the original code.

Despite these enhancements, the primary bottleneck of Fast Step Graph lies in the requirement of substantial memory resources $\text{Memory} \propto \Big(\frac{p(p-1)}{2}\Big)$ for storing the entire graph, particularly when $p$ grows.

Clone this repository or simply download the .zip file and follow the instructions in this link to see an example.

How to cite this repository?

DOI

Owner

  • Name: Dr. Juan Gabriel Colonna
  • Login: juancolonna
  • Kind: user
  • Location: Brazil
  • Company: @ufam, @icomp

GitHub Events

Total
  • Watch event: 1
Last Year
  • Watch event: 1

Packages

  • Total packages: 1
  • Total downloads:
    • cran 172 last-month
  • Total dependent packages: 0
  • Total dependent repositories: 0
  • Total versions: 2
  • Total maintainers: 1
cran.r-project.org: FastStepGraph

A Fast Algorithm for Sparse Precision Matrix Estimation

  • Versions: 2
  • Dependent Packages: 0
  • Dependent Repositories: 0
  • Downloads: 172 Last month
Rankings
Dependent packages count: 28.0%
Forks count: 28.0%
Stargazers count: 31.1%
Dependent repos count: 36.9%
Average: 42.0%
Downloads: 86.1%
Last synced: 11 months ago

Dependencies

DESCRIPTION cran
  • R >= 4.3 depends
  • MASS >= 7.3 imports
  • doParallel >= 1.0 imports
  • foreach >= 1.5 imports
  • devtools * suggests
  • knitr * suggests
  • rmarkdown * suggests