Peter-Clark algorithm (Q6032835): Difference between revisions
From MaRDI portal
Created claim: instance of (P31): algorithm (Q127020) |
Added link to [mardi]: Algorithm:6032835 |
||
| (6 intermediate revisions by 2 users not shown) | |||
| description / en | description / en | ||
algorithm | algorithm for learning equivalence class of DAGs in graphical modelling | ||
| Property / computes solution to | |||
| Property / computes solution to: Find all equivalent descriptions of the relationships between the components of a high-dimensional Gaussian vector / rank | |||
Normal rank | |||
| Property / computes solution to | |||
| Property / computes solution to: Graphical model / rank | |||
Normal rank | |||
| Property / described by source | |||
| Property / described by source: Estimating High-Dimensional Directed Acyclic Graphs with the PC-Algorithm / rank | |||
Normal rank | |||
| Property / described by source | |||
| Property / described by source: Bayesian Networks in R / rank | |||
Normal rank | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI algorithm profile / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 12:42, 20 November 2024
algorithm for learning equivalence class of DAGs in graphical modelling
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Peter-Clark algorithm |
algorithm for learning equivalence class of DAGs in graphical modelling |
