A PC algorithm variation for ordinal variables

DOI10.1007/s00180-013-0426-5zbMath1306.65113OpenAlexW1986807275MaRDI QIDQ2259347

Flaminia Musella

Publication date: 3 March 2015

Published in: Computational Statistics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00180-013-0426-5

zbMATH Keywords

directed acyclic graphnonparametric methodsstructural learningmonotone association

Mathematics Subject Classification ID

Computational methods for problems pertaining to statistics (62-08)

Related Items (2)

The dual PC algorithm and the role of Gaussianity for structure learning of Bayesian networks ⋮ Unnamed Item

Uses Software

• TETRAD
• MIM

Cites Work

• The max-min hill-climbing Bayesian network structure learning algorithm
• Mining and visualising ordinal data with non-parametric continuous BBNs
• Causation, prediction, and search
• A Bayesian method for the induction of probabilistic networks from data
• Probabilistic Networks and Expert Systems
• 10.1162/153244302760200696
• A DISTRIBUTION-FREE k-SAMPLE TEST AGAINST ORDERED ALTERNATIVES
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A PC algorithm variation for ordinal variables