In this paper, we extend the result on the probability of (falsely) connecting two distinct components when learning a GGM (Gaussian Graphical Model) by the joint regression based technique. While the classical method of regression based technique learns the neighbours of each node one at a time through a Lasso penalized regression, its joint modification, considered here, learns the neighbours of each node simultaneously through a group Lasso penalized regression.
On the probability of (falsely) connecting two distinct components when learning a GGM
De Canditiis Daniela
;
2023
Abstract
In this paper, we extend the result on the probability of (falsely) connecting two distinct components when learning a GGM (Gaussian Graphical Model) by the joint regression based technique. While the classical method of regression based technique learns the neighbours of each node one at a time through a Lasso penalized regression, its joint modification, considered here, learns the neighbours of each node simultaneously through a group Lasso penalized regression.File in questo prodotto:
| File | Dimensione | Formato | |
|---|---|---|---|
|
paper_global_MB_foCS_T&M.pdf
solo utenti autorizzati
Tipologia:
Documento in Post-print
Licenza:
NON PUBBLICO - Accesso privato/ristretto
Dimensione
84.97 kB
Formato
Adobe PDF
|
84.97 kB | Adobe PDF | Visualizza/Apri Richiedi una copia |
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
