An Axiomatization of Loglinear Models with an Application to the Model-Search Problem
Abstract
A good strategy to save computational time in a model-search problem consists in endowing the search procedure with a mechanism of logical inference, which sometimes allows an interaction model to be accepted or rejected without resorting to the numeric test. In principle, the best inferential mechanism should based on a sound and complete axiomatization of interaction models. We present a sound (and, probably incomplete) axiomatization which can be translated into a graphical inference procedure working with directed acyclic graphs.
Cite
Text
Malvestuto. "An Axiomatization of Loglinear Models with an Application to the Model-Search Problem." Pre-proceedings of the Fifth International Workshop on Artificial Intelligence and Statistics, 1995.Markdown
[Malvestuto. "An Axiomatization of Loglinear Models with an Application to the Model-Search Problem." Pre-proceedings of the Fifth International Workshop on Artificial Intelligence and Statistics, 1995.](https://mlanthology.org/aistats/1995/malvestuto1995aistats-axiomatization/)BibTeX
@inproceedings{malvestuto1995aistats-axiomatization,
title = {{An Axiomatization of Loglinear Models with an Application to the Model-Search Problem}},
author = {Malvestuto, Francesco M.},
booktitle = {Pre-proceedings of the Fifth International Workshop on Artificial Intelligence and Statistics},
year = {1995},
pages = {354-365},
volume = {R0},
url = {https://mlanthology.org/aistats/1995/malvestuto1995aistats-axiomatization/}
}