mglasso
Multiscale Graphical Lasso
Inference of Multiscale graphical models with neighborhood selection approach. The method is based on solving a convex optimization problem combining a Lasso and fused-group Lasso penalties. This allows to infer simultaneously a conditional independence graph and a clustering partition. The optimization is based on the Continuation with Nesterov smoothing in a Shrinkage-Thresholding Algorithm solver (Hadj-Selem et al. 2018) <doi:10.1109/TMI.2018.2829802> implemented in python.
- Version0.1.2
- R versionunknown
- LicenseMIT
- Needs compilation?No
- Last release09/08/2022
Documentation
Team
Edmond Sanou
Christophe Ambroise
Show author detailsRolesThesis advisorTung Le
Show author detailsRolesContributorGeneviève Robin
Show author detailsRolesThesis advisor
Insights
Last 30 days
This package has been downloaded 160 times in the last 30 days. Enough downloads to make a small wave in the niche community. The curiosity is spreading! The following heatmap shows the distribution of downloads per day. Yesterday, it was downloaded 1 times.
The following line graph shows the downloads per day. You can hover over the graph to see the exact number of downloads per day.
Last 365 days
This package has been downloaded 3,024 times in the last 365 days. Now we’re talking! This work is officially 'heard of in academic circles', just like those wild research papers on synthetic bananas. The day with the most downloads was Jul 21, 2024 with 146 downloads.
The following line graph shows the downloads per day. You can hover over the graph to see the exact number of downloads per day.
Data provided by CRAN
Binaries
Dependencies
- Imports8 packages
- Suggests4 packages