- Keras Reinforcement Learning Projects
- Giuseppe Ciaburro
- 127字
- 2021-08-13 15:26:06
Markov chains
A Markov chain is a mathematical model of a random phenomenon that evolves over time in such a way that the past influences the future only through the present. The time can be discrete (a whole variable), continuous (a real variable), or, more generally, a totally ordered whole. In this discussion, only discrete chains are considered. Markov chains were introduced in 1906 by Andrei Andreyevich Markov (1856–1922), from whom the name derives.
The example of a one-dimensional random walk seen in the previous section is a Markov chain; the next value in the chain is a unit that is more or less than the current value with the same probability of occurrence, regardless of the way in which the current value was reached.
推薦閱讀
- Big Data Analytics with Hadoop 3
- 大數(shù)據(jù)技術(shù)與應(yīng)用基礎(chǔ)
- Circos Data Visualization How-to
- 計算機(jī)圖形學(xué)
- IoT Penetration Testing Cookbook
- 嵌入式操作系統(tǒng)
- 內(nèi)模控制及其應(yīng)用
- 嵌入式操作系統(tǒng)原理及應(yīng)用
- 網(wǎng)絡(luò)安全概論
- 從祖先到算法:加速進(jìn)化的人類文化
- 系統(tǒng)安裝、維護(hù)與數(shù)據(jù)備份技巧
- 歐姆龍PLC應(yīng)用系統(tǒng)設(shè)計實例精解
- 人工智能:重塑個人、商業(yè)與社會
- Pentaho Data Integration Beginner's Guide(Second Edition)
- 嵌入式系統(tǒng)原理與接口技術(shù)