Learning directed acyclic graph SPNs in sub-quadratic time

DOI10.1016/J.IJAR.2020.01.005zbMATH Open1433.68342OpenAlexW3006484274MaRDI QIDQ2310290FDOQ2310290

Authors: Amur Ghose, Priyank Jaini, Pascal Poupart 

Publication date: 6 April 2020

Published in: International Journal of Approximate Reasoning (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ijar.2020.01.005

Recommendations

• Sum-product graphical models
• Visualizing and understanding sum-product networks
• Decomposition of structural learning about directed acyclic graphs
• A decomposition algorithm for learning Bayesian networks based on scoring function
• A recursive method for structural learning of directed acyclic graphs

zbMATH Keywords

Bayesian networksdirected acyclic graphstructure learningprobabilistic graphical modelssum-product networks

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Probabilistic graphical models (62H22)

Cites Work

• On the shortest spanning subtree of a graph and the traveling salesman problem
• Introduction to algorithms.
• A differential approach to inference in Bayesian networks
• A simple proof of the restricted isometry property for random matrices
• Exact Recovery in the Stochastic Block Model
• Correlation clustering
• The restricted isometry property and its implications for compressed sensing
• Certifying the Restricted Isometry Property is Hard
• A randomized linear-time algorithm to find minimum spanning trees
• An Effective Heuristic Algorithm for the Traveling-Salesman Problem
• Balanced partitions of trees and applications
• QUIC: quadratic approximation for sparse inverse covariance estimation
• Detecting the large entries of a sparse covariance matrix in sub-quadratic time

Cited In (3)

• Decomposition of structural learning about directed acyclic graphs
• Fast causal orientation learning in directed acyclic graphs
• Sum-product graphical models

Uses Software

• QUIC
• STL-10 dataset

This page was built for publication: Learning directed acyclic graph SPNs in sub-quadratic time

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