Publication:4915354

zbMath1262.05113MaRDI QIDQ4915354

Francesco Mario Malvestuto

Publication date: 10 April 2013

Full work available at URL: http://www.kybernetika.cz/content/2012/5/825

zbMATH Keywords

information divergence; acyclic hypergraph; decomposable model; backward selection; \(k\)-hypertree

Mathematics Subject Classification ID

68T05: Learning and adaptive systems in artificial intelligence

05C65: Hypergraphs

68R10: Graph theory (including graph drawing) in computer science

62A09: Graphical methods in statistics

Related Items

Efficient approximation of probability distributions with \(k\)-order decomposable models, Discovering a junction tree behind a Markov network by a greedy algorithm

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Discovering a junction tree behind a Markov network by a greedy algorithm
• A microscopic study of minimum entropy search in learning decomposable Markov networks
• Approximating probabilistic inference in Bayesian belief networks is NP- hard
• From conditional independences to factorization constraints with discrete random variables
• An implementation of the iterative proportional fitting procedure by propagation trees.
• On simple characterizations of k-trees
• Hypergraphs as a mean of discovering the dependence structure of a discrete multivariate probability distribution
• Simple algorithms for minimal triangulation of a graph and backward selection of a decomposable Markov network
• On the Desirability of Acyclic Database Schemes
• Approximating probability distributions to reduce storage requirements
• Simple Linear-Time Algorithms to Test Chordality of Graphs, Test Acyclicity of Hypergraphs, and Selectively Reduce Acyclic Hypergraphs
• Model Search among Multiplicative Models
• Analogies between Multiplicative Models in Contingency Tables and Covariance Selection
• Elements of Information Theory
• Approximating discrete probability distributions with dependence trees
• Approximating discrete probability distributions
• The number of labeled k-dimensional trees
• A note on approximations to discrete probability distributions
• Discrete Multivariate Analysis Theory and Practice