<instructions>Your goal is to analyze the following comment and estimate how highly it will be upvoted by the Hacker News community.</instructions><comment><author>nwenzel</author><text>Random Forests are interesting because they are designed to make many, many bad decisions that cancel each other out leaving only the good decisions behind.&lt;p&gt;To oversimplify, each of the many, many decision trees is going to do a poor job building a classifier. Each tree only uses a subset of the data and a subset of the features. So, the results of each tree won&apos;t generalize well (and may not even do well classifying the data it was trained on). But, for each tree that misclassifies in one direction, another tree will misclassify in the other direction. The theory (which appears to be validated in practice) is that poor decisions cancel each other out but good decisions don&apos;t get canceled out.&lt;p&gt;Although, it isn&apos;t quite a simple as a &quot;good&quot; tree and a &quot;bad&quot; tree. All decision trees are bad but there should randomly be good parts in the bad trees. Each tree is going to be &quot;mostly crap&quot; (as Jeremy Howard puts it). But &quot;mostly crap&quot; means &quot;a little good.&quot; The crap in one tree cancels out the crap in another tree. The good parts are left behind... and... like magic... you have a good classifier that is fast although somewhat of a black box.&lt;p&gt;Jeremy Howard from Kaggle is a big believer and where most of my knowledge of Decision Tree Ensemble algorithms come from: &lt;a href=&quot;https://www.kaggle.com/wiki/RandomForests&quot; rel=&quot;nofollow&quot;&gt;https://www.kaggle.com/wiki/RandomForests&lt;/a&gt;</text><parent_chain><item><author>tocomment</author><text>What&apos;s so good about random forests?  I seem to be hearing it mentioned a lot lately.</text></item><item><author>larrydag</author><text>Oldie paper but still a goodie.  Some other algorithms to consider...   Random Forests, Gradient Boosted Machines (similar to AdaBoost), Logistic Regression, Neurel Networks.</text></item></parent_chain></comment><story><title>Top ten algorithms in data mining (2007) [pdf]</title><url>http://some-docs.googlecode.com/files/Top%2010%20algorithms%20in%20data%20mining.pdf</url></story>
<instructions>Your goal is to analyze the following comment and estimate how highly it will be upvoted by the Hacker News community.</instructions><comment><author>mturmon</author><text>Crudely: combine the speed of classification trees with the generally low error rates (flexibility) of the SVM.</text><parent_chain><item><author>tocomment</author><text>What&apos;s so good about random forests?  I seem to be hearing it mentioned a lot lately.</text></item><item><author>larrydag</author><text>Oldie paper but still a goodie.  Some other algorithms to consider...   Random Forests, Gradient Boosted Machines (similar to AdaBoost), Logistic Regression, Neurel Networks.</text></item></parent_chain></comment><story><title>Top ten algorithms in data mining (2007) [pdf]</title><url>http://some-docs.googlecode.com/files/Top%2010%20algorithms%20in%20data%20mining.pdf</url></story>