Skip to Main content Skip to Navigation
Conference papers

A hybrid approach for probabilistic relational models structure learning

Abstract : Probabilistic relational models (PRMs) extend Bayesian networks (BNs) to a relational data mining context. Just like BNs, the structure and parameters of a PRM must be either set by an expert or learned from data. Learning the structure remains the most complicated issue as it is a NP-hard problem. Existing approaches for PRM structure learning are inspired from classical methods of learning the BN structure. Extensions for the constraint-based and score-based methods have been proposed. However, hybrid methods are not yet adapted to relational domains, although some of them show better experimental performance, in the classical context, than constraint-based and score-based methods, such as the Max-Min Hill Climbing (MMHC) algorithm. In this paper, we present an adaptation of this latter to relational domains and we made an empirical evaluation of our algorithm. We provide an experimental study where we compare our new approach to the state-of-the art relational structure learning algorithms.
Document type :
Conference papers
Complete list of metadata

Cited literature [17 references]  Display  Hide  Download
Contributor : Philippe Leray <>
Submitted on : Wednesday, April 15, 2020 - 10:46:00 AM
Last modification on : Wednesday, October 28, 2020 - 10:04:02 AM


Files produced by the author(s)




Mouna Ben Ishak, Philippe Leray, Nahla Ben Amor. A hybrid approach for probabilistic relational models structure learning. 15th International Symposium on Intelligent Data Analysis (IDA 2016), 2016, Stockholm, Sweden. ⟨10.1007/978-3-319-46349-0_4⟩. ⟨hal-01347798⟩



Record views


Files downloads