<?xml version="1.0" encoding="UTF-8"?><rss version="2.0"
	xmlns:content="http://purl.org/rss/1.0/modules/content/"
	xmlns:dc="http://purl.org/dc/elements/1.1/"
	xmlns:atom="http://www.w3.org/2005/Atom"
	xmlns:sy="http://purl.org/rss/1.0/modules/syndication/"
		>
<channel>
	<title>Comments on: Markov Chain (Model) Builder&#8230;</title>
	<atom:link href="http://eng.kulanov.org.ua/archives/73/feed" rel="self" type="application/rss+xml" />
	<link>http://eng.kulanov.org.ua/archives/73</link>
	<description>GRID Compiting, Grid in Ukraine, Workload performance, modelling and prediction</description>
	<lastBuildDate>Fri, 29 Jul 2011 12:32:45 +0000</lastBuildDate>
	<sy:updatePeriod>hourly</sy:updatePeriod>
	<sy:updateFrequency>1</sy:updateFrequency>
	<generator>http://wordpress.org/?v=3.3.1</generator>
	<item>
		<title>By: Sergey Kulanov</title>
		<link>http://eng.kulanov.org.ua/archives/73/comment-page-1#comment-11</link>
		<dc:creator>Sergey Kulanov</dc:creator>
		<pubDate>Thu, 21 Apr 2011 11:44:41 +0000</pubDate>
		<guid isPermaLink="false">http://eng.kulanov.org.ua/?p=73#comment-11</guid>
		<description>How to get P(observation&#124;MakrovModel)
this is what we have 
&lt;code&gt;result=prod(reshape(A.^o,1,[]))&lt;/code&gt;
where 
A - transition matrix;
o - is the transition matrix of the &lt;strong&gt;observation &lt;/strong&gt; sequence (which can be produced by
&lt;code&gt;o=full(sparse(observation(1:end-1),observation(2:end),1));)&lt;/code&gt;
Of course we have to add initial State o(1) probability:
&lt;code&gt;result*InitProb(o(1))&lt;/code&gt;

But the best way is to use logarithm scale
A more elegant way to count Probability P(Observation&#124;model)was found in PMTK by Kevin Murphy:
see 
&lt;code&gt;log=markovLogprob(model,data)&lt;/code&gt;</description>
		<content:encoded><![CDATA[<p>How to get P(observation|MakrovModel)<br />
this is what we have<br />
<code>result=prod(reshape(A.^o,1,[]))</code><br />
where<br />
A &#8211; transition matrix;<br />
o &#8211; is the transition matrix of the <strong>observation </strong> sequence (which can be produced by<br />
<code>o=full(sparse(observation(1:end-1),observation(2:end),1));)</code><br />
Of course we have to add initial State o(1) probability:<br />
<code>result*InitProb(o(1))</code></p>
<p>But the best way is to use logarithm scale<br />
A more elegant way to count Probability P(Observation|model)was found in PMTK by Kevin Murphy:<br />
see<br />
<code>log=markovLogprob(model,data)</code></p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Sergey Kulanov</title>
		<link>http://eng.kulanov.org.ua/archives/73/comment-page-1#comment-5</link>
		<dc:creator>Sergey Kulanov</dc:creator>
		<pubDate>Tue, 25 May 2010 06:05:04 +0000</pubDate>
		<guid isPermaLink="false">http://eng.kulanov.org.ua/?p=73#comment-5</guid>
		<description>Yet another approach:
A=full(sparse(sequence(1:end-1),sequence(2:end),1));
T=normalize(A,2);</description>
		<content:encoded><![CDATA[<p>Yet another approach:<br />
A=full(sparse(sequence(1:end-1),sequence(2:end),1));<br />
T=normalize(A,2);</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: admin</title>
		<link>http://eng.kulanov.org.ua/archives/73/comment-page-1#comment-4</link>
		<dc:creator>admin</dc:creator>
		<pubDate>Tue, 25 May 2010 05:28:39 +0000</pubDate>
		<guid isPermaLink="false">http://eng.kulanov.org.ua/?p=73#comment-4</guid>
		<description>A new approach was found in markovFit() function from PMTK toolkit, please refer http://pmtk3.googlecode.com/svn/trunk/docs/synopsis/Markov_models.html</description>
		<content:encoded><![CDATA[<p>A new approach was found in markovFit() function from PMTK toolkit, please refer <a href="http://pmtk3.googlecode.com/svn/trunk/docs/synopsis/Markov_models.html" rel="nofollow">http://pmtk3.googlecode.com/svn/trunk/docs/synopsis/Markov_models.html</a></p>
]]></content:encoded>
	</item>
	<item>
		<title>By: admin</title>
		<link>http://eng.kulanov.org.ua/archives/73/comment-page-1#comment-3</link>
		<dc:creator>admin</dc:creator>
		<pubDate>Mon, 19 Apr 2010 06:33:21 +0000</pubDate>
		<guid isPermaLink="false">http://eng.kulanov.org.ua/?p=73#comment-3</guid>
		<description>More elegant way was found from mk_stochastic function of BNT toolbox (Written by Kevin Murphy)

A=full(sparse(sequence(1:end-1),sequence(2:end),1));
Z = sum(A,2); 
S = Z + (Z==0);
norm = repmat(S, 1, size(A,2));
A = A ./ norm;</description>
		<content:encoded><![CDATA[<p>More elegant way was found from mk_stochastic function of BNT toolbox (Written by Kevin Murphy)</p>
<p>A=full(sparse(sequence(1:end-1),sequence(2:end),1));<br />
Z = sum(A,2);<br />
S = Z + (Z==0);<br />
norm = repmat(S, 1, size(A,2));<br />
A = A ./ norm;</p>
]]></content:encoded>
	</item>
</channel>
</rss>

