<?xml version="1.0" encoding="UTF-8" ?>
<?xml-stylesheet type="text/xsl" href="http://blogs.msdn.com/utility/FeedStylesheets/rss.xsl" media="screen"?><rss version="2.0" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:slash="http://purl.org/rss/1.0/modules/slash/" xmlns:wfw="http://wellformedweb.org/CommentAPI/"><channel><title>Awesome F# - Decision Trees – Part II</title><link>http://blogs.msdn.com/b/chrsmith/archive/2009/11/02/awesome-f-decision-trees-part-ii.aspx</link><description>In my previous post I went over the theory behind the ID3 algorithm . Now that we got all that painful math out of the way, let’s write some code! Here is an implementation of the algorithm in F#. (It is also attached to this blog post, download it via</description><dc:language>en-US</dc:language><generator>Telligent Evolution Platform Developer Build (Build: 5.6.50428.7875)</generator><item><title>re: Awesome F# - Decision Trees – Part II</title><link>http://blogs.msdn.com/b/chrsmith/archive/2009/11/02/awesome-f-decision-trees-part-ii.aspx#9926708</link><pubDate>Sat, 21 Nov 2009 10:34:00 GMT</pubDate><guid isPermaLink="false">91d46819-8472-40ad-a661-2c78acb4018c:9926708</guid><dc:creator>Tim Martin</dc:creator><description>&lt;p&gt;Thanks for taking the time to write an informative post. Unfortunately, the link to the previous article appears not to point to the right place - I found the right article in the end, but it's a little confusing.&lt;/p&gt;
&lt;div style="clear:both;"&gt;&lt;/div&gt;&lt;img src="http://blogs.msdn.com/aggbug.aspx?PostID=9926708" width="1" height="1"&gt;</description></item><item><title>re: Awesome F# - Decision Trees – Part II</title><link>http://blogs.msdn.com/b/chrsmith/archive/2009/11/02/awesome-f-decision-trees-part-ii.aspx#9916872</link><pubDate>Tue, 03 Nov 2009 18:00:49 GMT</pubDate><guid isPermaLink="false">91d46819-8472-40ad-a661-2c78acb4018c:9916872</guid><dc:creator>ChrSmith</dc:creator><description>&lt;p&gt;Thanks for the tip, I'll try to update the image late tonight. I know there enough options in GraphViz to make it prettier, I just didn't spend the time to learn them.&lt;/p&gt;
&lt;div style="clear:both;"&gt;&lt;/div&gt;&lt;img src="http://blogs.msdn.com/aggbug.aspx?PostID=9916872" width="1" height="1"&gt;</description></item><item><title>re: Awesome F# - Decision Trees – Part II</title><link>http://blogs.msdn.com/b/chrsmith/archive/2009/11/02/awesome-f-decision-trees-part-ii.aspx#9916726</link><pubDate>Tue, 03 Nov 2009 12:49:29 GMT</pubDate><guid isPermaLink="false">91d46819-8472-40ad-a661-2c78acb4018c:9916726</guid><dc:creator>Martin</dc:creator><description>&lt;p&gt;If you explicitly set the fontsize to say 12, you won't get that annoying clipping of the bottom of the text of the &amp;quot;Outlook&amp;quot;-node.&lt;/p&gt;
&lt;p&gt;For example like so:&lt;/p&gt;
&lt;p&gt; &amp;nbsp; &amp;nbsp;printfn &amp;quot;digraph g {&amp;quot;&lt;/p&gt;
&lt;p&gt; &amp;nbsp; &amp;nbsp;printfn &amp;quot; graph [fontsize=12]&amp;quot;&lt;/p&gt;
&lt;p&gt; &amp;nbsp; &amp;nbsp;printfn &amp;quot; node [fontsize=12]&amp;quot;&lt;/p&gt;
&lt;p&gt; &amp;nbsp; &amp;nbsp;printfn &amp;quot; edge [fontsize=12]&amp;quot;&lt;/p&gt;
&lt;p&gt; &amp;nbsp; &amp;nbsp;printNode &amp;quot;&amp;quot; &amp;quot;root&amp;quot; node&lt;/p&gt;
&lt;p&gt; &amp;nbsp; &amp;nbsp;printfn &amp;quot;}&amp;quot;&lt;/p&gt;
&lt;div style="clear:both;"&gt;&lt;/div&gt;&lt;img src="http://blogs.msdn.com/aggbug.aspx?PostID=9916726" width="1" height="1"&gt;</description></item></channel></rss>