Nalaganje...

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...

Popoln opis

Shranjeno v:
Bibliografske podrobnosti
izdano v:J Mach Learn Res
Main Authors: Tan, Kean Ming, London, Palma, Mohan, Karthik, Lee, Su-In, Fazel, Maryam, Witten, Daniela
Format: Artigo
Jezik:Inglês
Izdano: 2014
Teme:
Online dostop:https://ncbi.nlm.nih.gov/pmc/articles/PMC4302963/
https://ncbi.nlm.nih.gov/pubmed/25620891
Oznake: Označite
Brez oznak, prvi označite!