Skip to Main content Skip to Navigation

Probabilistic Relational Model Benchmark Generation

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), which extend Bayesian Networks (BNs) to a relational data mining context and enable effective and robust reasoning over relational data. Even though a panoply of works have focused, separately , on the generation of random Bayesian networks and relational databases, no work has been identified for PRMs on that track. This paper provides an algorithmic approach for generating random PRMs from scratch to fill this gap. 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 not only for machine learning researchers to evaluate their proposals in a common framework, but also for databases designers to evaluate the effectiveness of the components of a database management system.
Document type :
Complete list of metadata
Contributor : Mouna Ben Ishak Connect in order to contact the contributor
Submitted on : Sunday, February 14, 2016 - 9:56:43 PM
Last modification on : Wednesday, April 27, 2022 - 4:41:21 AM
Long-term archiving on: : Saturday, November 12, 2016 - 7:11:20 PM


Files produced by the author(s)


  • HAL Id : hal-01273307, version 1
  • ARXIV : 1603.00709


Mouna Ben Ishak, Rajani Chulyadyo, Philippe Leray. Probabilistic Relational Model Benchmark Generation. [Technical Report] LARODEC Laboratory, ISG, Université de Tunis, Tunisia; DUKe research group, LINA Laboratory UMR 6241, University of Nantes, France; DataForPeople, Nantes, France. 2016. ⟨hal-01273307⟩



Record views


Files downloads