Skip to Main content Skip to Navigation
Conference papers

Mixture of markov trees for bayesian network structure learning with small datasets in high dimensional space

Abstract : The recent explosion of high dimensionality in datasets for several domains has posed a serious challenge to existing Bayesian network structure learning algorithms. Local search methods represent a solution in such spaces but suffer with small datasets. MMHC (Max-Min Hill-Climbing) is one of these local search algorithms where a first phase aims at identifying a possible skeleton by using some statistical association measurements and a second phase performs a greedy search restricted by this skeleton. We propose to replace the first phase, imprecise when the number of data remains relatively very small, by an application of "Perturb and Combine" framework we have already studied in density estimation by using mixtures of bagged trees.
Document type :
Conference papers
Complete list of metadata

Cited literature [22 references]  Display  Hide  Download

https://hal.archives-ouvertes.fr/hal-00644991
Contributor : Philippe Leray Connect in order to contact the contributor
Submitted on : Friday, April 17, 2020 - 2:31:59 PM
Last modification on : Wednesday, April 27, 2022 - 3:49:19 AM

File

article.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-00644991, version 1

Citation

Sourour Ammar, Philippe Leray. Mixture of markov trees for bayesian network structure learning with small datasets in high dimensional space. ECSQARU 2011, 2011, Belfast, Ireland. pp.229-238. ⟨hal-00644991⟩

Share

Metrics

Record views

71

Files downloads

81