Finding MAPs using strongly equivalent high order recurrent symmetric connectionist networks.

Emad A. M. Andrews Anthony J. Bonner

Published in: Cogn. Syst. Res. (2012)

Keyphrases

high order
connectionist networks
higher order
low order
pairwise
lower order
markov random field
low rank
tensor analysis
fourth order
arithmetic coding
zernike moments
partial differential equations
multi task learning
data compression
dynamical systems
monte carlo
dynamic programming