{"package":"sparsenet","ecosystem":"cran","latest_version":"1.7","description":"Fit Sparse Linear Regression Models via Nonconvex Optimization. Efficient procedure for fitting regularization paths between L1 and L0, using the MC+ penalty of Zhang, C.H. (2010). Implements the methodology described in Mazumder, Friedman and Hastie (2011) . Sparsenet computes the regularization surface ove","license":"GPL-2","license_risk":"strong_copyleft","commercial_use_notes":"GPL-2.0: derivative works must release source under GPL; static linking forces disclosure.","homepage":"https://hastie.su.domains/public/Papers/Sparsenet/Mazumder-SparseNetCoordinateDescent-2011.pdf","repository":"https://CRAN.R-project.org/package=sparsenet","downloads_weekly":128,"health":{"score":41,"risk":"high","breakdown":{"maintenance":5,"popularity":3,"security":25,"maturity":6,"community":2},"deprecated":false,"max_score":100},"vulnerabilities":{"count":0,"critical":0,"high":0,"medium":0,"low":0,"details":[]},"versions":{"latest":"1.7","total_count":0,"recent":[]},"metadata":{"deprecated":false,"deprecated_message":null,"maintainers_count":1,"first_published":"2024-11-16 22:46:15","last_published":"2024-11-16T21:30:02+00:00","dependencies_count":3,"dependencies":["Matrix","shape","methods"]},"github_stats":null,"bundle":null,"typescript":null,"known_issues":{"bugs_count":0,"bugs_severity":{},"status_breakdown":{},"link":null,"scope":"none"},"historical_compromise":null,"recommendation":{"action":"safe_to_use","issues":[],"use_version":"1.7","version_hint":null,"summary":"sparsenet@1.7 is safe to use (health: 41/100)"},"version_scoped":null,"requested_version":null,"_cache":"miss","_response_ms":346,"_powered_by":"depscope.dev — free package intelligence for AI agents","typosquat":{"is_suspected":false},"maintainer_trust":{"available":false},"malicious":{"is_malicious":false},"scorecard":{"available":false},"quality":{"available":false}}