Inferring large graphs using $$\ell _1$$ ℓ 1 -penalized likelihood
Crossref DOI link: https://doi.org/10.1007/s11222-017-9769-z
Published Online: 2017-08-17
Published Print: 2018-07
Update policy: https://doi.org/10.1007/springer_crossmark_policy
Champion, Magali
Picheny, Victor
Vignes, Matthieu
License valid from 2017-08-17