Structural Learning about Directed Acyclic Graphs from Multiple Databases

Qiang Zhao
January 2012
Abstract & Applied Analysis;2012, p1
Academic Journal
We propose an approach for structural learning of directed acyclic graphs from multiple databases. We first learn a local structure from each database separately, and then we combine these local structures together to construct a global graph over all variables. In our approach, we do not require conditional independence, which is a basic assumption in most methods.


Related Articles

  • Global Transversal sets and Global transversal Irredundant Sets. Jayapraksah, P.; Swaminathan, V. // Global Journal of Pure & Applied Mathematics;2013, Vol. 9 Issue 2, p125 

    Let G be a simple graph. Let Åž be a collection of subsets of V(G) with a common property. A subset T of V(G) is called an Åž transversal if T meets every element of Åž. Many types of transversals like independent transversal, clique transversal etc have been studied. In what follows, a...

  • 4-TRANSITIVE DIGRAPHS I: THE STRUCTURE OF STRONG 4-TRANSITIVE DIGRAPHS. HERNÁNDEZ-CRUZ, CÉSAR // Discussiones Mathematicae: Graph Theory;2013, Vol. 33 Issue 2, p247 

    Let D be a digraph, V (D) and A(D) will denote the sets of vertices and arcs of D, respectively. A digraph D is transitive if for every three distinct vertices u, v, w ∈ V (D), (u, v), (v, w) ∈ A(D) implies that (u, w) ∈ A(D). This concept can be generalized as follows: A digraph...

  • A Structural Approach for Independent Domination of Regular Graphs. Lyle, Jeremy // Graphs & Combinatorics;Sep2015, Vol. 31 Issue 5, p1567 

    We consider bounds on the minimum cardinality of an independent dominating set in regular graphs with large degree (linear in the number of vertices). Better bounds are obtained for various ranges of the degree. This is done by working with a variant of the clique graph of the complement.

  • Perfect matchings in random polyomino chain graphs. Wei, Shouliu; Ke, Xiaoling; Lin, Fenggen // Journal of Mathematical Chemistry;Mar2016, Vol. 54 Issue 3, p690 

    Let G be a (molecule) graph. A perfect matching, or Kekulé structure of G is a set of independent edges covering every vertex exactly once. Enumeration of Kekulé structures of a graph is interest in chemistry, physics and mathematics. In this paper, we focus on the number of perfect...

  • ON THE EXISTENCE OF (k,l)-KERNELS IN INFINITE DIGRAPHS: A SURVEY. GALEANA-SÁNCHEZ, H.; HERNÁNDEZ-CRUZ, C. // Discussiones Mathematicae: Graph Theory;2014, Vol. 34 Issue 3, p431 

    Let D be a digraph, V (D) and A(D) will denote the sets of vertices and arcs of D, respectively. A (k, l)-kernel N of D is a k-independent (if u, v ∈ N, u ≠ v, then d(u, v), d(v, u) ≥ k) and l-absorbent (if u ∈ V (D) - N then there exists v ∈ N such that d(u, v)...

  • A sufficient condition for kernel perfectness of a digraph in terms of semikernels modulo F. Balbuena, Camino; Galeana-Sánchez, Hortensia; Guevara, Mucuy-kak // Acta Mathematica Sinica;Feb2012, Vol. 28 Issue 2, p349 

    A kernel of a directed graph is a set of vertices which is both independent and absorbent. And a digraph is said to be kernel perfect if and only if any induced subdigraph has a kernel. Given a set of arcs F, a semikernel S modulo F is an independent set such that if some Sz-arc is not in F,...

  • Structure of independent sets in direct products of some vertex-transitive graphs. Geng, Xing; Wang, Jun; Zhang, Hua // Acta Mathematica Sinica;Apr2012, Vol. 28 Issue 4, p697 

    Let Circ( r, n) be a circular graph. It is well known that its independence number α(Circ( r, n)) = r. In this paper we prove that for every vertex transitive graph H, and describe the structure of maximum independent sets in Circ( r, n) × H. As consequences, we prove for G being Kneser...

  • Integer Functions on the Cycle Space and Edges of a Graph. Slilaty, Daniel C. // Graphs & Combinatorics;Mar2010, Vol. 26 Issue 2, p293 

    A directed graph has a natural Z-module homomorphism from the underlying graph's cycle space to Z where the image of an oriented cycle is the number of forward edges minus the number of backward edges. Such a homomorphism preserves the parity of the length of a cycle and the image of a cycle is...

  • On the Domination Number of Cartesian Product of Two Directed Cycles. Zehui Shao; Enqiang Zhu; Fangnian Lang // Journal of Applied Mathematics;2013, p1 

    Denote by ɣ(G) the domination number of a digraph G and CmCn the Cartesian product of Cm and Cn, the directed cycles of length m, n = 2. In 2010, Liu et al. determined the exact values of ɣ(CmCn) for m = 2, 3, 4, 5, 6. In 2013, Mollard determined the exact values of ɣ(CmCn)...


Read the Article


Sorry, but this item is not currently available from your library.

Try another library?
Sign out of this library

Other Topics