期刊文献+
共找到1篇文章
< 1 >
每页显示 20 50 100
PREDICTIVE MODELS AND GENERATIVE COMPLEXITY
1
作者 wolfgang lhr 《Journal of Systems Science & Complexity》 SCIE EI CSCD 2012年第1期30-45,共16页
The causal states of computational mechanics define the minimal sufficient memory for a given discrete stationary stochastic process. Their entropy is an important complexity measure called statistical complexity (or... The causal states of computational mechanics define the minimal sufficient memory for a given discrete stationary stochastic process. Their entropy is an important complexity measure called statistical complexity (or true measure complexity). They induce the s-machine, which is a hidden Markov model (HMM) generating the process. But it is not the minimal one, although generative HMMs also have a natural predictive interpretation. This paper gives a mathematical proof of the idea that the s-machine is the minimal HMM with an additional (partial) determinism condition. Minimal internal state entropy of a generative HMM is in analogy to statistical complexity called generative complexity. This paper also shows that generative complexity depends on the process in a nice way. It is, as a function of the process, lower semi-continuous (w.r.t. weak-, topology), concave, and behaves nice under ergodic decomposition of the process. 展开更多
关键词 Causal states COMPLEXITY s-machine generative complexity HMM partially deterministicHMM predictive model statistical.
原文传递
上一页 1 下一页 到第
使用帮助 返回顶部