Learning accurate cutset networks by exploiting decomposability

DOI10.1007/978-3-319-24309-2_17MaRDI QIDQ2294082zbMATH OpenOpenAlexWikidataFDO

Authors Nicola Di Mauro, Antonio Vergari, Floriana Esposito

Publication date 10 February 2020

Full work available at URL https://doi.org/10.1007/978-3-319-24309-2_17

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05)

Recommendations

• MaxSAT-based cutting planes for learning graphical models
• Cut pursuit: fast algorithms to learn piecewise constant functions on general weighted graphs
• scientific article; zbMATH DE number 3856823
• Approximate normalized cuts without eigen-decomposition
• A Quasipolynomial Cut-Elimination Procedure in Deep Inference via Atomic Flows and Threshold Formulae
• scientific article; zbMATH DE number 5547867

Cited in

(1)

• \textsc{Strudel}: A fast and accurate learner of structured-decomposable probabilistic circuits

This page was built for publication: Learning accurate cutset networks by exploiting decomposability

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2294082)