A PC algorithm variation for ordinal variables

  • Authors:
  • Flaminia Musella

  • Affiliations:
  • Dipartimento di Metodi e modelli per l'economia, il territorio e la finanza, Sapienza University of Rome, Rome, Italy 00161

  • Venue:
  • Computational Statistics
  • Year:
  • 2013

Quantified Score

Hi-index 0.00

Visualization

Abstract

Bayesian networks are graphical models that represent the joint distribution of a set of variables using directed acyclic graphs. The graph can be manually built by domain experts according to their knowledge. However, when the dependence structure is unknown (or partially known) the network has to be estimated from data by using suitable learning algorithms. In this paper, we deal with a constraint-based method to perform Bayesian networks structural learning in the presence of ordinal variables. We propose an alternative version of the PC algorithm, which is one of the most known procedures, with the aim to infer the network by accounting for additional information inherent to ordinal data. The proposal is based on a nonparametric test, appropriate for ordinal variables. A comparative study shows that, in some situations, the proposal discussed here is a slightly more efficient solution than the PC algorithm.