A Simple Method for Identifying Compelled Edges in DAGs
نویسندگان
چکیده
Identifying compelled edges is important in learning the structure (i.e., the DAG) of a Bayesian network. A graphical method (Chickering 1995) was proposed to solve this problem. In this paper, we show that a joint probability distribution defined by a Bayesian network can be uniquely characterized by its intrinsic factorization. Based on such an algebraic characterization, we suggest a simple algorithm to identify the compelled edges of a Bayesian network structure.
منابع مشابه
The marginal factorization of Bayesian networks and its application
A Bayesian network consists of a directed acyclic graph (DAG) and a set of conditional probability distributions (CPDs); they together define a joint probability distribution (jpd). The structure of the DAG dictates how a jpd can be factorized as a product of CPDs. This CPD factorization view of Bayesian networks has been well recognized and studied in the uncertainty community. In this article...
متن کاملAn Algebraic Characterization of Equivalent Bayesian Networks
In this paper, we propose an algebraic characterization for equivalent classes of Bayesian networks. Unlike the other characterizations, which are based on the graphical structure of Bayesian networks, our algebraic characterization is derived from the intrinsic algebraic structure of Bayesian networks, i.e., joint probability distribution factorization. The new proposed algebraic characterizat...
متن کاملA Transformational Characterization of Equivalent Bayesian Network Structures
We present a simple characterization of equivalent Bayesian network structures based on local transformations. The sig nificance of the characterization is twofold. First, we are able to easily prove several new invariant properties of theoretical in terest for equivalent structures. Second, we use the characterization to derive an ef ficient algorithm that identifies all of the compelled ed...
متن کاملReducing bias through directed acyclic graphs
BACKGROUND The objective of most biomedical research is to determine an unbiased estimate of effect for an exposure on an outcome, i.e. to make causal inferences about the exposure. Recent developments in epidemiology have shown that traditional methods of identifying confounding and adjusting for confounding may be inadequate. DISCUSSION The traditional methods of adjusting for "potential co...
متن کاملA Fast Algorithm for Covering Rectangular Orthogonal Polygons with a Minimum Number of r-Stars
Introduction This paper presents an algorithm for covering orthogonal polygons with minimal number of guards. This idea examines the minimum number of guards for orthogonal simple polygons (without holes) for all scenarios and can also find a rectangular area for each guards. We consider the problem of covering orthogonal polygons with a minimum number of r-stars. In each orthogonal polygon P,...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2003