A Generalization of the Tetrad Representation Theorem
Abstract
The tetrad representation theorem, due to Spirtes, Glymour, and Scheines (1993), gives a graphical condition necessary and sufficient for the vanishing of an individual tetrad difference in a linear structural equation model. In this paper, we generalize their result from individual tetrad differences to sets of tetrad differences of a certain form, and we simplify their proof. The generalization allows tighter constraints to be placed on the set of linear models compatible with given data and thereby facilitates the search for parsimonious models for large data sets.
Cite
Text
Shafer et al. "A Generalization of the Tetrad Representation Theorem." Pre-proceedings of the Fifth International Workshop on Artificial Intelligence and Statistics, 1995.Markdown
[Shafer et al. "A Generalization of the Tetrad Representation Theorem." Pre-proceedings of the Fifth International Workshop on Artificial Intelligence and Statistics, 1995.](https://mlanthology.org/aistats/1995/shafer1995aistats-generalization/)BibTeX
@inproceedings{shafer1995aistats-generalization,
title = {{A Generalization of the Tetrad Representation Theorem}},
author = {Shafer, Glenn and Kogan, Alexander and Spirtes, Peter},
booktitle = {Pre-proceedings of the Fifth International Workshop on Artificial Intelligence and Statistics},
year = {1995},
pages = {476-487},
volume = {R0},
url = {https://mlanthology.org/aistats/1995/shafer1995aistats-generalization/}
}