Search

The conditional independencies from a joint probability distribution constitute a model which is closed under the semi-graphoid properties of independency. These models typically are exponentially large in size and cannot be feasibly enumerated. For describing a semi-graphoid model therefore, researchers have proposed a more concise representation. This representation is composed of a representative subset of the independencies involved, called a basis, and lets all other independencies be implicitly defined by the semi-graphoid properties. An algorithm is available for computing such a basis for a semi-graphoid independency model. In this paper, we identify some new properties of a basis in general which can be exploited for arriving at an even more concise representation of a semi-graphoid model. Based upon these properties, we present an enhanced algorithm for basis construction which never returns a larger basis for a given independency model than currently existing algorithms. [ABSTRACT FROM AUTHOR]