Structure of the high-order Boltzmann machine from independence maps
暂无分享,去创建一个
[1] Frank Harary,et al. Graph Theory , 2016 .
[2] Catriel Beeri,et al. On the Desirability of Acyclic Database Schemes , 1983, JACM.
[3] V. Isham. An Introduction to Spatial Point Processes and Markov Random Fields , 1981 .
[4] Judea Pearl,et al. Probabilistic reasoning in intelligent systems - networks of plausible inference , 1991, Morgan Kaufmann series in representation and reasoning.
[5] Geoffrey E. Hinton,et al. Learning and relearning in Boltzmann machines , 1986 .
[6] Geoffrey E. Hinton,et al. A Learning Algorithm for Boltzmann Machines , 1985, Cogn. Sci..
[7] T. Sejnowski. Higher‐order Boltzmann machines , 1987 .
[8] Judea Pearl,et al. Causal networks: semantics and expressiveness , 2013, UAI.
[9] Manuel Graña,et al. The high-order Boltzmann machine: learned distribution and topology , 1995, IEEE Trans. Neural Networks.
[10] N. Wermuth,et al. Graphical and recursive models for contingency tables , 1983 .
[11] J. N. R. Jeffers,et al. Graphical Models in Applied Multivariate Statistics. , 1990 .
[12] Manuel Graña,et al. Convergence Properties of High-order Boltzmann Machines , 1996, Neural Networks.
[13] Robert E. Tarjan,et al. Simple Linear-Time Algorithms to Test Chordality of Graphs, Test Acyclicity of Hypergraphs, and Selectively Reduce Acyclic Hypergraphs , 1984, SIAM J. Comput..
[14] J. M. Hammersley,et al. Markov fields on finite graphs and lattices , 1971 .
[15] T. Speed,et al. Markov Fields and Log-Linear Interaction Models for Contingency Tables , 1980 .