The association structure of a Bayesian network can be known in advance by subject matter knowledge or have to be learned from a database. In case of data driven learning, one of the most known procedures is the PC algorithm where the structure is inferred carrying out several independence tests under the assumption of independent and identically distributed observations. In practice, sample selection in surveys involves more complex sampling designs. In this paper, a modified version of the PC algorithm is proposed for inferring casual structure from complex survey data.
PC algorithm from complex sample data / Marella, D.; Vicard, P.. - (2016). (Intervento presentato al convegno 48th SIS Scientific Meeting of the Italian Statistical Society tenutosi a Salerno).
PC algorithm from complex sample data
Marella D.;Vicard P.
2016
Abstract
The association structure of a Bayesian network can be known in advance by subject matter knowledge or have to be learned from a database. In case of data driven learning, one of the most known procedures is the PC algorithm where the structure is inferred carrying out several independence tests under the assumption of independent and identically distributed observations. In practice, sample selection in surveys involves more complex sampling designs. In this paper, a modified version of the PC algorithm is proposed for inferring casual structure from complex survey data.| File | Dimensione | Formato | |
|---|---|---|---|
|
MV_SIS_2016.pdf
solo gestori archivio
Tipologia:
Versione editoriale (versione pubblicata con il layout dell'editore)
Licenza:
Tutti i diritti riservati (All rights reserved)
Dimensione
81.81 kB
Formato
Adobe PDF
|
81.81 kB | Adobe PDF | Contatta l'autore |
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
