Constructing the Bayesian network structure from dependencies implied in multiple relational schemas

  • Authors:
  • Wei-Yi Liu;Kun Yue;Wei-Hua Li

  • Affiliations:
  • Department of Computer Science and Engineering, School of Information Science and Engineering, Yunnan University, Kunming 650091, PR China;Department of Computer Science and Engineering, School of Information Science and Engineering, Yunnan University, Kunming 650091, PR China;Department of Computer Science and Engineering, School of Information Science and Engineering, Yunnan University, Kunming 650091, PR China

  • Venue:
  • Expert Systems with Applications: An International Journal
  • Year:
  • 2011

Quantified Score

Hi-index 12.05

Visualization

Abstract

Relational models are the most common representation of structured data, and acyclic database theory is important in relational databases. In this paper, we propose the method for constructing the Bayesian network structure from dependencies implied in multiple relational schemas. Based on the acyclic database theory and its relationships with probabilistic networks, we are to construct the Bayesian network structure starting from implied independence information instead of mining database instances. We first give the method to find the maximum harmoniousness subset for the multi-valued dependencies on an acyclic schema, and thus the most information of conditional independencies can be retained. Further, aiming at multi-relational environments, we discuss the properties of join graphs of multiple 3NF database schemas, and thus the dependencies between separate relational schemas can be obtained. In addition, on the given cyclic join dependency, the transformation from cyclic to acyclic database schemas is proposed by virtue of finding a minimal acyclic augmentation. An applied example shows that our proposed methods are feasible.