Efficient Principled Learning of Thin Junction Trees

No abstract is available for this paper.

• Publication year

  2007

• Venue

  Neural Information Processing Systems

• Publication date

  2007-12-03

• Fields of study

  Mathematics, Computer Science

• Identifiers

  No identifiers available.

• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• Learning Factor Graphs in Polynomial Time and Sample Complexity

  2006influential reference
• Ordering-Based Search: A Simple and Effective Algorithm for Learning Bayesian Networks

  2005cited by this paper
• On Bayesian Network Approximation by Edge Deletion

  2005cited by this paper
• Causation: A Unified Framework for the Social Sciences

  2005cited by this paper
• Near-optimal Nonmyopic Value of Information in Graphical Models

  2005cited by this paper
• Finding optimal Bayesian networks by dynamic programming

  2005cited by this paper
• Model-Driven Data Acquisition in Sensor Networks

  2004cited by this paper
• PAC-learning Bounded Tree-width Graphical Models

  2004influential reference
• Causation, Prediction, and Search

  2003cited by this paper
• Learning Markov networks: maximum bounded tree-width graphs

  2001influential reference
• Thin Junction Trees

  2001cited by this paper
• Probabilistic Networks and Expert Systems

  2001cited by this paper
• Learning with Mixtures of Trees

  2000cited by this paper
• Minimizing symmetric submodular functions

  1998cited by this paper
• Learning and robust learning of product distributions

  1993cited by this paper
• The ALARM Monitoring System: A Case Study with two Probabilistic Inference Techniques for Belief Networks

  1989cited by this paper
• Complexity of finding embeddings in a k -tree

  1987cited by this paper
• Approximating discrete probability distributions with dependence trees

  1968cited by this paper

• Structural perspective on constraint-based learning of Markov networks

  2024cites this paper
• Learning Chordal Markov Networks via Stochastic Local Search

  2020cites this paper
• Learning decomposable models by coarsening

  2020cites this paper
• Near-optimal learning of tree-structured distributions by Chow-Liu

  2020cites this paper
• FSPN: A New Class of Probabilistic Graphical Model

  2020cites this paper
• Residual Sum-Product Networks

  2020cites this paper
• Learning Bayesian Networks with Cops and Robbers

  2020cites this paper
• Random Sum-Product Forests with Residual Links

  2019cites this paper
• Exploring the Space of Probabilistic Sentential Decision Diagrams

  2019cites this paper
• Learning tractable Bayesian networks in the space of elimination orders

  2019cites this paper
• Learning Clique Forests

  2019cites this paper
• Predicting Loss of Inference Accuracy in Bounded Tree-Width Bayesian Networks

  2019cites this paper
• Tractability of most probable explanations in multidimensional Bayesian network classifiers

  2018cites this paper
• The Sum-Product Theorem and its Applications

  2018cites this paper
• Efficient learning of Bayesian networks with bounded tree-width

  2017cites this paper
• Towards Compact Interpretable Models: Shrinking of Learned Probabilistic Sentential Decision Diagrams

  2017cites this paper
• Learning the Structure of Probabilistic Sentential Decision Diagrams

  2017cites this paper
• Learning Robust Tractable Models for Vision

  2017cites this paper
• Towards Compact Interpretable Models : Shrinking of Learned Probabilistic Sentential Decision Diagrams

  2017cites this paper
• Efficient approximation of probability distributions with k-order decomposable models

  2016cites this paper
• On the Links between Probabilistic Graphical Models and Submodular Optimisation. (Liens entre modèles graphiques probabilistes et optimisation sous-modulaire)

  2016cites this paper
• The Sum-Product Theorem: A Foundation for Learning Tractable Models

  2016cites this paper
• Cyber Physical System based Proactive Collaborative Maintenance MANTIS D 1 . 2 Consolidated State-ofthe-Art of Sensor-based Proactive Maintenance Appendix 15 : Modelling techniques for high-frequency time-series data

  2016cites this paper
• Learning Bayesian networks with low inference complexity

  2016cites this paper
• Learning Tractable Multidimensional Bayesian Network Classifiers

  2016cites this paper
• Discriminative Structure Learning of Arithmetic Circuits

  2016cites this paper
• On the Links between Probabilistic Graphical Models and Submodular Optimisation. (Liens entre modèles graphiques probabilistes et optimisation sous-modulaire)

  2016cites this paper
• Lifted generative learning of Markov logic networks

  2015influential citation
• Learning low inference complexity Bayesian networks

  2015cites this paper
• Learning Bayesian networks from data by the incremental compilation of new network polynomials

  2015cites this paper
• Tractable Learning for Complex Probability Queries

  2015cites this paper
• Learning and Exploiting Relational Structure for Efficient Inference

  2015cites this paper
• Advances in Learning Bayesian Networks of Bounded Treewidth

  2014cites this paper
• Learning Bounded Tree-width Bayesian Networks using Integer Linear Programming

  2014cites this paper
• Learning Sum-Product Networks with Direct and Indirect Variable Interactions

  2014cites this paper
• Tractable learning of liftable Markov logic networks

  2014cites this paper
• Efficient learning of decomposable models with a bounded clique size

  2014cites this paper
• Learning Chordal Markov Networks by Dynamic Programming

  2014cites this paper
• Cutset Networks: A Simple, Tractable, and Scalable Approach for Improving the Accuracy of Chow-Liu Trees

  2014cites this paper
• Learning Optimal Bounded Treewidth Bayesian Networks via Maximum Satisfiability

  2014cites this paper
• Learning Tractable Statistical Relational Models

  2014cites this paper
• Parameterized Complexity Results for Exact Bayesian Network Structure Learning

  2014cites this paper
• Learning Markov Networks With Arithmetic Circuits

  2013cites this paper
• Learning with sparsity: Structures, optimization and applications

  2013cites this paper
• Mobile context inference using two-layered Bayesian networks for smartphones

  2013cites this paper
• Maximizing submodular functions using probabilistic graphical models

  2013cites this paper
• Arrangement of Low-Dimensional Parallel Coordinate Plots for High-Dimensional Data Visualization

  2013cites this paper
• Learning the Structure of Sum-Product Networks

  2013cites this paper
• Nonparametric generalized belief propagation based on pseudo-junction tree for cooperative localization in wireless networks

  2013cites this paper
• Exact Learning of Bounded Tree-width Bayesian Networks

  2013cites this paper
• A junction tree framework for undirected graphical model selection

  2013cites this paper
• Learning Large-Scale Conditional Random Fields

  2013influential citation
• Learning Tractable Graphical Models Using Mixture of Arithmetic Circuits

  2013cites this paper
• DLOREAN: Dynamic Location-Aware Reconstruction of Multiway Networks

  2013cites this paper
• Convex Relaxations for Learning Bounded-Treewidth Decomposable Graphs

  2012influential citation
• Uncovering the riffled independence structure of ranked data

  2012cites this paper
• Mixtures of tree-structured probabilistic graphical models for density estimation in high dimensional spaces

  2012cites this paper
• Discriminative Learning of Sum-Product Networks

  2012cites this paper
• Probabilistic Graphical Models and Markov Networks

  2012cites this paper
• Sum-product networks: A new deep architecture

  2011cites this paper
• Query-Specific Learning and Inference for Probabilistic Graphical Models

  2011cites this paper
• Learning with Submodular Functions: A Convex Optimization Perspective

  2011cites this paper
• Large-deviation analysis and applications Of learning tree-structured graphical models

  2011cites this paper
• High-dimensional structure estimation in Ising models: Local separation criterion

  2011cites this paper
• Lineage processing over correlated probabilistic databases

  2010cites this paper
• High Dimensional Structure Learning of Ising Models on Sparse Random Graphs

  2010cites this paper
• Tree Density Estimation

  2010cites this paper
• Graphical model structure learning using L₁-regularization

  2010cites this paper
• Graphical Models and Overlay Networks for Reasoning about Large Distributed Systems

  2010cites this paper
• Algorithms and Complexity Results for Exact Bayesian Structure Learning

  2010cites this paper
• High-Dimensional Robust Structure Learning of Ising Models on Sparse Random Graphs

  2010cites this paper
• Scaling laws for learning high-dimensional Markov forest distributions

  2010cites this paper
• Uncovering the Riffled Independence Structure of Rankings

  2010cites this paper
• Learning Hierarchical Riffle Independent Groupings from Rankings

  2010cites this paper
• Forest Density Estimation

  2010influential citation
• Learning Efficient Markov Networks

  2010cites this paper
• Learning High-Dimensional Markov Forest Distributions: Analysis of Error Rates

  2010cites this paper
• Bottom-Up Learning of Markov Network Structure

  2010cites this paper
• Convex Structure Learning in Log-Linear Models: Beyond Pairwise Potentials

  2010cites this paper
• Proposal Algorithms for Answering Queries with Graphical Models

  2009influential citation
• A Large-Deviation Analysis of the Maximum-Likelihood Learning of Markov Tree Structures

  2009cites this paper
• Learning Thin Junction Trees via Graph Cuts

  2009cites this paper
• Probabilistic localization and mapping in appearance space

  2009cites this paper
• Learning Sparse Markov Network Structure via Ensemble-of-Trees Models

  2009cites this paper
• Fixing and Extending the Multiplicative Approximation Scheme

  2009cites this paper
• Learning Bounded Treewidth Bayesian Networks

  2008cites this paper
• Learning Arithmetic Circuits

  2008cites this paper
• Learning with Graphical Models

  2008cites this paper
• Convex relaxation methods for graphical models: Lagrangian and maximum entropy approaches

  2008cites this paper
• MIT Open Access Articles Scaling laws for learning high-dimensional Markov forest distributions

  year unknowncites this paper
• Ieee Transactions on Pattern Analysis and Machine Intelligence 1 Learning Multivariate Distributions by Competitive Assembly of Marginals

  year unknowncites this paper