TE
科技回声
首页24小时热榜最新最佳问答展示工作
GitHubTwitter
首页

科技回声

基于 Next.js 构建的科技新闻平台,提供全球科技新闻和讨论内容。

GitHubTwitter

首页

首页最新最佳问答展示工作

资源链接

HackerNews API原版 HackerNewsNext.js

© 2025 科技回声. 版权所有。

Small Introduction to Markov Chains

106 点作者 tantalum大约 10 年前

4 条评论

mts_大约 10 年前
I like the visualization vicapow did on Markov chains a while ago as well.<p>&quot;Markov chains explained visually&quot;: <a href="http://setosa.io/blog/2014/07/26/markov-chains/" rel="nofollow">http:&#x2F;&#x2F;setosa.io&#x2F;blog&#x2F;2014&#x2F;07&#x2F;26&#x2F;markov-chains&#x2F;</a>
sswaner大约 10 年前
That is a great intro. Thanks for putting it together. If you were to continue this to a Part #2, I would be interested in seeing the approach for determining if something was &quot;abnormal&quot;. Is it considered abnormal to add a node to the chain, or to add a transition? Is detecting abnormal behavior more complicated than detecting new nodes or transitions?
评论 #9113429 未加载
taterbase大约 10 年前
Awesome intro! I&#x27;ve used Markov Chain libraries before but never took the time to try and understand them. This makes a lot of sense.<p>Are there different or more efficient probability calculations that can be done other than the provided algorithm? It seems somewhat simple.
评论 #9113471 未加载
jszymborski大约 10 年前
damn, that&#x27;s some tiny &lt;pre&gt; font-size.
评论 #9110384 未加载
评论 #9113491 未加载
评论 #9110309 未加载