Learning possibilistic graphical models from data

Abstract : This work fits within the framework of learning possibilistic networks, the possibilistic counterpart of Bayesian networks, which represent an interesting combination between possibility theory and graphical models. This thesis presents two major contributions. The first one consists on proposing a validation strategy for possibilistic networks learning algorithms. This strategy proposes a sampling process to generate imprecise datasets from theses models and two new evaluation measures. Our second contribution consists on proposing a global approach to learn the structure and the parameters of possibilistic networks. We propose a possibilistic likelihood function to learn possibilistic networks parameters and to define a new score function used to learn the structure of these models. A detailed experimental study showing the feasibility and the efficiency of the proposed methods has been also proposed.
Document type :
Theses
Complete list of metadatas

https://tel.archives-ouvertes.fr/tel-01442642
Contributor : Philippe Leray <>
Submitted on : Friday, January 20, 2017 - 5:55:29 PM
Last modification on : Thursday, April 5, 2018 - 10:36:49 AM
Long-term archiving on : Friday, April 21, 2017 - 4:33:16 PM

Licence


Copyright

Identifiers

  • HAL Id : tel-01442642, version 1

Collections

Citation

Maroua Haddad. Learning possibilistic graphical models from data. Machine Learning [cs.LG]. Université de Nantes, Ecole Polytechnique; Institut Supérieur de Gestion de Tunis, 2016. English. ⟨tel-01442642⟩

Share

Metrics

Record views

425

Files downloads

653