Affiliations: [a] LARODEC Laboratory, ISG, Université de Tunis, Tunis, Tunisia | [b] DUKe Research Group, LINA Laboratory UMR, University of Nantes, Nantes, France
Correspondence:
[*]
Corresponding author: Mouna Ben Ishak, LARODEC Laboratory, ISG, Université de Tunis, Tunis, Tunisia. E-mail:[email protected]
Abstract: The validation of any database mining methodology goes through an evaluation process where benchmarks availability is essential. In this paper, we aim to randomly generate relational database benchmarks that allow to check probabilistic dependencies among the attributes.
We are particularly interested in Probabilistic relational models (PRMs). These latter extend Bayesian networks (BNs) to a relational data mining context that enable effective and robust reasoning about relational data structures. Even though a panoply of works have focused, separately, on Bayesian networks and relational databases random generation, no work has been identified for PRMs on that track. This paper provides an algorithmic approach allowing to generate random PRMs from scratch to cover the absence of generation process. The proposed method allows to generate PRMs as well as synthetic relational data from a randomly generated relational schema and a random set of probabilistic dependencies. This can be of interest for machine learning researchers to evaluate their proposals in a common framework, as for databases designers to evaluate the effectiveness of the components of a database management system.
Keywords: Probabilistic relational model, relational data representation, benchmark generation
