Learning a bayesian network from ordinal data
Bayesian networks are graphical models that represent the joint distributionof a set of variables using directed acyclic graphs. When the dependence structure is unknown (or partially known) the network can be learnt from data. In this paper, we propose a constraint-based method to perform Bayesian networks structural learning in presence of ordinal variables. The new procedure, called OPC, represents a variation of the PC algorithm. A nonparametric test, appropriate for ordinal variables, has been used. It will be shown that, in some situation, the OPC algorithm is a solution more efficient than the PC algorithm.
|Date of creation:||Oct 2011|
|Contact details of provider:|| Postal: Via Silvio d'Amico 77, - 00145 Rome Italy|
Phone: +39 06 57114612
Fax: +39 06 57114771
Web page: http://host.uniroma3.it/dipartimenti/economia/it/
More information through EDIRC
When requesting a correction, please mention this item's handle: RePEc:rtr:wpaper:0139. See general information about how to correct material in RePEc.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Telephone for information)
If references are entirely missing, you can add them using this form.