Structure of the high-order Boltzmann machine from independence maps

In this paper we consider the determination of the structure of the high-order Boltzmann machine (HOBM), a stochastic recurrent network for approximating probability distributions. We obtain the structure of the HOBM, the hypergraph of connections, from conditional independences of the probability d...

Full description

Saved in:
Bibliographic Details
Published in:IEEE transactions on neural networks 1997-11, Vol.8 (6), p.1351-1358
Main Authors: Albizuri, F.X., d'Anjou, A., Grana, M., Larranaga, P.
Format: Article
Language:English
Subjects:
Applied sciences
Approximation algorithms
Artificial intelligence
Bayesian methods
Computer science education
Computer science
control theory
systems
Connectionism. Neural networks
Exact sciences and technology
Graphical models
Markov random fields
Neural networks
Probability distribution
Random variables
Stochastic processes
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:In this paper we consider the determination of the structure of the high-order Boltzmann machine (HOBM), a stochastic recurrent network for approximating probability distributions. We obtain the structure of the HOBM, the hypergraph of connections, from conditional independences of the probability distribution to model. We assume that an expert provides these conditional independences and from them we build independence maps, Markov and Bayesian networks, which represent conditional independences through undirected graphs and directed acyclic graphs respectively. From these independence maps we construct the HOBM hypergraph. The central aim of this paper is to obtain a minimal hypergraph. Given that different orderings of the variables provide in general different Bayesian networks, we define their intersection hypergraph. We prove that the intersection hypergraph of all the Bayesian networks (N!) of the distribution is contained by the hypergraph of the Markov network, it is more simple, and we give a procedure to determine a subset of the Bayesian networks that verifies this property. We also prove that the Markov network graph establishes a minimum connectivity for the hypergraphs from Bayesian networks.
ISSN:1045-9227
1941-0093
DOI:10.1109/72.641458