<?xml version="1.0" encoding="utf-8" standalone="yes"?><rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>random forests on DataScience.LA</title><link>https://datasciencela.github.io/tag/random-forests/</link><description>Recent content in random forests on DataScience.LA</description><generator>Hugo -- gohugo.io</generator><language>en-us</language><copyright>DataScience.LA, 2014–2021 · Read-only archive: comments are closed.</copyright><lastBuildDate>Sat, 21 Nov 2015 18:33:50 -0800</lastBuildDate><atom:link href="https://datasciencela.github.io/tag/random-forests/index.xml" rel="self" type="application/rss+xml"/><item><title>Benchmarking Random Forest Implementations</title><link>https://datasciencela.github.io/benchmarking-random-forest-implementations/</link><pubDate>Tue, 19 May 2015 08:30:44 -0700</pubDate><guid>https://datasciencela.github.io/benchmarking-random-forest-implementations/</guid><description>&lt;p&gt;I currently have the need for machine learning tools that can deal with observations of the order of 10 millions in the context of binary classification. That kind of data is a few GBs in size and it fits comfortably nowadays in the RAM of a decent single machine. It is a trivial task for linear models, as there are plenty of open source tools that can train a logistic regression with this amount of data on a single machine in a few seconds, even while using only 1 processor core (many of these tools are single-threaded). Linear models are also the &lt;a href="http://arxiv.org/abs/1110.4198"&gt;gold standard&lt;/a&gt; of large-scale machine learning that can run on clusters, processing very large distributed datasets.&lt;/p&gt;</description><media:content xmlns:media="http://search.yahoo.com/mrss/" url="https://datasciencela.github.io/benchmarking-random-forest-implementations/feature.png"/></item></channel></rss>