<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Mondrian Forests: Efficient Online Random Forests · HackerPapers discussions</title><link>https://hackerpaper.kaipfister.de/p/1406.2673/</link><description>Collected HN comments and submissions linking this paper.</description><language>en</language><lastBuildDate>Mon, 02 Nov 2026 11:16:22 GMT</lastBuildDate><atom:link href="https://hackerpaper.kaipfister.de/p/1406.2673/feed.xml" rel="self" type="application/rss+xml" /><item><title>Mondrian Forests: Efficient Online Random Forests — mentioned by abhgh</title><link>https://news.ycombinator.com/item?id=40622753</link><guid isPermaLink="false">urn:hackerpapers:mention:1406.2673:40622753</guid><pubDate>Sun, 09 Jun 2024 07:58:20 GMT</pubDate><description>&lt;p&gt;Since we are discussing Mondrians in the context of trees, I thought I would mention &amp;quot;Mondrian Forest&amp;quot; [1]. Interesting but relatively unknown algorithm to construct random forests over online data. [1] https://arxiv.org/abs/1406.2673&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/1406.2673/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>stat.ML</category></item></channel></rss>
