<?xml version="1.0" encoding="utf-8" standalone="yes"?><rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Naive Bayes on Chen Kai Blog</title><link>https://www.chenk.top/en/tags/naive-bayes/</link><description>Recent content in Naive Bayes on Chen Kai Blog</description><generator>Hugo</generator><language>en</language><lastBuildDate>Wed, 28 Jan 2026 09:00:00 +0000</lastBuildDate><atom:link href="https://www.chenk.top/en/tags/naive-bayes/index.xml" rel="self" type="application/rss+xml"/><item><title>ML Math Derivations (9): Naive Bayes</title><link>https://www.chenk.top/en/ml-math-derivations/09-naive-bayes/</link><pubDate>Wed, 28 Jan 2026 09:00:00 +0000</pubDate><guid>https://www.chenk.top/en/ml-math-derivations/09-naive-bayes/</guid><description>&lt;blockquote>
&lt;p>&lt;strong>Hook:&lt;/strong> A spam filter that trains in milliseconds, scales to a million features, has &lt;em>no hyperparameters worth tuning&lt;/em>, and still beats much fancier models on short-text problems. Naive Bayes pulls this off by making one outrageous assumption — every feature is independent given the class — and refusing to apologise for it. The assumption is wrong on essentially every real dataset, yet the classifier works. Understanding &lt;em>why&lt;/em> is a tour through generative modelling, MAP estimation, Dirichlet priors, and the bias–variance tradeoff. This article walks the entire path.&lt;/p></description></item></channel></rss>