Estimating High-Dimensional Directed Acyclic Graphs with the PC-Algorithm (Q6482960): Difference between revisions
From MaRDI portal
Zadorozhnyi (talk | contribs) Created claim: MaRDI profile type (P1460): MaRDI publication profile (Q5976449) |
Created claim: description (P1459): We consider the PC-algorithm for estimating the skeleton of a very high-dimensional acyclic directed graph (DAG) with corresponding Gaussian distribution. The PC-algorithm is computationally feasible for sparse problems with many nodes, i.e. variables, and it has the attractive property to automatically achieve high computational efficiency as a function of sparseness of the true underlying DAG. We prove consistency of the algorithm for very hi... |
||
| (5 intermediate revisions by 2 users not shown) | |||
| Property / author | Property / author | ||
| Property / author | |||
| Property / author: Bühlmann Peter / rank | |||
| Property / author: Bühlmann Peter / qualifier | |||
| Property / author | |||
| Property / author: Bühlmann Peter / rank | |||
Normal rank | |||
| Property / author: Bühlmann Peter / qualifier | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: w2155573334 / rank | |||
Normal rank | |||
| Property / description | |||
We consider the PC-algorithm for estimating the skeleton of a very high-dimensional acyclic directed graph (DAG) with corresponding Gaussian distribution. The PC-algorithm is computationally feasible for sparse problems with many nodes, i.e. variables, and it has the attractive property to automatically achieve high computational efficiency as a function of sparseness of the true underlying DAG. We prove consistency of the algorithm for very high-dimensional, sparse DAGs where the number of nodes is allowed to quickly grow with sample size n, as fast as O(n^a) for any 0. | |||
| Property / description: We consider the PC-algorithm for estimating the skeleton of a very high-dimensional acyclic directed graph (DAG) with corresponding Gaussian distribution. The PC-algorithm is computationally feasible for sparse problems with many nodes, i.e. variables, and it has the attractive property to automatically achieve high computational efficiency as a function of sparseness of the true underlying DAG. We prove consistency of the algorithm for very high-dimensional, sparse DAGs where the number of nodes is allowed to quickly grow with sample size n, as fast as O(n^a) for any 0. / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 18:06, 4 February 2025
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Estimating High-Dimensional Directed Acyclic Graphs with the PC-Algorithm |
scientific article |
Statements
Estimating High-Dimensional Directed Acyclic Graphs with the PC-Algorithm (English)
0 references
March 2007
0 references
asymptotic consistency
0 references
DAG
0 references
graphical model
0 references
skeleton
0 references
PC-Algorithm
0 references
We consider the PC-algorithm for estimating the skeleton of a very high-dimensional acyclic directed graph (DAG) with corresponding Gaussian distribution. The PC-algorithm is computationally feasible for sparse problems with many nodes, i.e. variables, and it has the attractive property to automatically achieve high computational efficiency as a function of sparseness of the true underlying DAG. We prove consistency of the algorithm for very high-dimensional, sparse DAGs where the number of nodes is allowed to quickly grow with sample size n, as fast as O(n^a) for any 0.
0 references
