<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Bayesian Online Changepoint Detection · HackerPapers discussions</title><link>https://hackerpaper.kaipfister.de/p/0710.3742/</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/0710.3742/feed.xml" rel="self" type="application/rss+xml" /><item><title>Bayesian Online Changepoint Detection — mentioned by GFK_of_xmaspast</title><link>https://news.ycombinator.com/item?id=12510929</link><guid isPermaLink="false">urn:hackerpapers:mention:0710.3742:12510929</guid><pubDate>Fri, 16 Sep 2016 00:03:47 GMT</pubDate><description>&lt;p&gt;The only &amp;quot;Bayes&amp;quot; I can see is the author starts with a uniform prior and applies Bayes rule in one of the examples, and in fact the whole thing is kind of all over the place. His approach of dragging a cut point across the data and asking &amp;quot;is it significant here? how about here?&amp;quot; is going to be prone to all sorts of false positives: if you set your threshold to 0.05, you&amp;#x27;ll expect one positive every 20 looks at the data. (He&amp;#x27;s looking for overlaps of credible intervals; this is going to work out to be the same thing). Here are a couple useful links for doing this kind of problem…&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/0710.3742/"&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>
