article · 1998

Complexity Of Structural Models

Milan Studeny

Cited by 3Abstract and details only

Abstract

Complexity of a model of conditional independence structure is introduced as the least cardinality of a generating set. Four basic types of complexity are distinguished which depend on the type of generating. A method of calculation of complexity of a given conditional independence model is proposed. The method is based on a more effective way of representation of the model by means of a list of dominant conditional independence statements. Prospects of the proposed approach are discussed in the end. AMS classification: 68T30, 62H05. Keywords: probabilistic model, semi-graphoid, complexity, dominant triplet. 1 INTRODUCTION The most of structured models used in probabilistic reasoning and in multivariate statistics, especially graphical models, are models of probabilistic conditional independence structure. Verification of validity of such a stuctural model is based on statistical conditional independence tests. This leads to natural questions. Which conditional independence tests sh...

Cite this paper

APA 7

Studeny, M. (1998). Complexity Of Structural Models.

MLA 9

Studeny, Milan. “Complexity Of Structural Models.” 1998.

Chicago

Studeny, Milan. 1998. “Complexity Of Structural Models.”

Harvard

Studeny, M. (1998) ‘Complexity Of Structural Models’.

BibTeX

@article{studeny1998complexity,
  title = {{Complexity Of Structural Models}},
  author = {Studeny, Milan},
  year = {1998}
}

Made from the index record. Check names, capitalisation and page numbers against the paper. Need another style? AI for Research has over 10,000.