Estimating High-Dimensional Directed Acyclic Graphs with the PC-Algorithm (Q6482960): Difference between revisions
From MaRDI portal
Zadorozhnyi (talk | contribs) Created claim: author (P16): Kalisch Markus (Q6482961) |
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... |
||||||||||||||
| (19 intermediate revisions by 2 users not shown) | |||||||||||||||
| Property / author | Property / author | ||||||||||||||
| Property / author: Markus Kalisch / qualifier | |||||||||||||||
| Property / author | |||||||||||||||
| Property / author: Bühlmann Peter / rank | |||||||||||||||
Normal rank | |||||||||||||||
| Property / author: Bühlmann Peter / qualifier | |||||||||||||||
| Property / published in | |||||||||||||||
| Property / published in: Journal of Machine Learning Research / rank | |||||||||||||||
Normal rank | |||||||||||||||
| Property / publication date | |||||||||||||||
March 2007
| |||||||||||||||
| Property / publication date: March 2007 / rank | |||||||||||||||
Normal rank | |||||||||||||||
| Property / full work available at URL | |||||||||||||||
| Property / full work available at URL: https://jmlr.org/papers/volume8/kalisch07a/kalisch07a.pdf / rank | |||||||||||||||
Normal rank | |||||||||||||||
| Property / Mathematics Subject Classification ID | |||||||||||||||
| Property / Mathematics Subject Classification ID: 68T05 / rank | |||||||||||||||
Normal rank | |||||||||||||||
| Property / Mathematics Subject Classification ID | |||||||||||||||
| Property / Mathematics Subject Classification ID: 68R10 / rank | |||||||||||||||
Normal rank | |||||||||||||||
| Property / zbMATH DE Number | |||||||||||||||
| Property / zbMATH DE Number: 1222.68229 / rank | |||||||||||||||
Normal rank | |||||||||||||||
| Property / zbMATH Keywords | |||||||||||||||
asymptotic consistency | |||||||||||||||
| Property / zbMATH Keywords: asymptotic consistency / rank | |||||||||||||||
Normal rank | |||||||||||||||
| Property / zbMATH Keywords | |||||||||||||||
DAG | |||||||||||||||
| Property / zbMATH Keywords: DAG / rank | |||||||||||||||
Normal rank | |||||||||||||||
| Property / zbMATH Keywords | |||||||||||||||
graphical model | |||||||||||||||
| Property / zbMATH Keywords: graphical model / rank | |||||||||||||||
Normal rank | |||||||||||||||
| Property / zbMATH Keywords | |||||||||||||||
skeleton | |||||||||||||||
| Property / zbMATH Keywords: skeleton / rank | |||||||||||||||
Normal rank | |||||||||||||||
| Property / zbMATH Keywords | |||||||||||||||
PC-Algorithm | |||||||||||||||
| Property / zbMATH Keywords: PC-Algorithm / rank | |||||||||||||||
Normal rank | |||||||||||||||
| Property / MaRDI profile type | |||||||||||||||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||||||||||||||
Normal rank | |||||||||||||||
| 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
