Carregant...
Learning Graphical Models With Hubs
We consider the problem of learning a high-dimensional graphical model in which there are a few hub nodes that are densely-connected to many other nodes. Many authors have studied the use of an ℓ(1) penalty in order to learn a sparse graph in the high-dimensional setting. However, the ℓ(1) penalty i...
Guardat en:
| Publicat a: | J Mach Learn Res |
|---|---|
| Autors principals: | , , , , , |
| Format: | Artigo |
| Idioma: | Inglês |
| Publicat: |
2014
|
| Matèries: | |
| Accés en línia: | https://ncbi.nlm.nih.gov/pmc/articles/PMC4302963/ https://ncbi.nlm.nih.gov/pubmed/25620891 |
| Etiquetes: |
Afegir etiqueta
Sense etiquetes, Sigues el primer a etiquetar aquest registre!
|