<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Probabilistic Random Forest: A machine learning algorithm for noisy datasets · HackerPapers discussions</title><link>https://hackerpaper.kaipfister.de/p/1811.05994/</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/1811.05994/feed.xml" rel="self" type="application/rss+xml" /><item><title>Probabilistic Random Forest: A machine learning algorithm for noisy datasets — mentioned by psandersen</title><link>https://news.ycombinator.com/item?id=23602824</link><guid isPermaLink="false">urn:hackerpapers:mention:1811.05994:23602824</guid><pubDate>Mon, 22 Jun 2020 17:17:42 GMT</pubDate><description>&lt;p&gt;This is really interesting, thanks for sharing! I&amp;#x27;ve been thinking about extensions to decision tree models that could get the benefits of NNs and it seems like there are a few ideas floating around. For example; Probabilistic Random Forests have some really interesting properties for noisy datasets, e.g. &amp;quot;The PRF accuracy decreased by less then 5% for a dataset with as many as 45% misclassified objects, compared to a clean dataset.&amp;quot; - https://arxiv.org/abs/1811.05994 PRF&amp;#x27;s might be a natural fit for RL, especially methods using monte carlo tree search. Speculating here as I&amp;#x27;m not adequately…&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/1811.05994/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>astro-ph.IM</category></item></channel></rss>
