@inproceedings{b565612ab5704cd2b79517804e022bc2,
title = "Fast and Accurate Density Estimation with Extremely Randomized Cutset Networks",
abstract = "Cutset Networks (CNets) are density estimators leveraging context-specific independencies recently introduced to provide exact inference in polynomial time. Learning a CNet is done by firstly building a weighted probabilistic OR tree and then estimating tractable distributions as its leaves. Specifically, selecting an optimal OR split node requires cubic time in the number of the data features, and even approximate heuristics still scale in quadratic time. We introduce Extremely Randomized Cutset Networks (XCNets), CNets whose OR tree is learned by performing random conditioning. This simple yet surprisingly effective approach reduces the complexity of OR node selection to constant time. While the likelihood of an XCNet is slightly worse than an optimally learned CNet, ensembles of XCNets outperform state-of-the-art density estimators on a series of standard benchmark datasets, yet employing only a fraction of the time needed to learn the competitors. Code and data related to this chapter are available at: https://github.com/nicoladimauro/cnet.",
keywords = "Tractable probabilistic models, Cutset Networks",
author = "{Di Mauro}, Nicola and Antonio Vergari and Basile, {Teresa M. A.} and Floriana Esposito",
year = "2017",
month = dec,
day = "30",
doi = "10.1007%2F978-3-319-71249-9_13",
language = "English",
isbn = "978-3-319-71248-2",
volume = "1",
series = "Lecture Notes in Computer Science",
publisher = "Springer",
pages = "203--219",
editor = "Michelangelo Ceci and Jaakko Hollm{\'e}n and Ljup{\v c}o Todorovski and Celine Vens and Sa{\v s}o D{\v z}eroski",
booktitle = "Machine Learning and Knowledge Discovery in Databases",
address = "United Kingdom",
edition = "1",
}