PC algorithm from complex sample data

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