<?xml version="1.0" encoding="utf-8" standalone="yes"?><rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>TAN on Chen Kai Blog</title><link>https://www.chenk.top/en/tags/tan/</link><description>Recent content in TAN on Chen Kai Blog</description><generator>Hugo</generator><language>en</language><lastBuildDate>Thu, 29 Jan 2026 09:00:00 +0000</lastBuildDate><atom:link href="https://www.chenk.top/en/tags/tan/index.xml" rel="self" type="application/rss+xml"/><item><title>ML Math Derivations (10): Semi-Naive Bayes and Bayesian Networks</title><link>https://www.chenk.top/en/ml-math-derivations/10-semi-naive-bayes-and-bayesian-networks/</link><pubDate>Thu, 29 Jan 2026 09:00:00 +0000</pubDate><guid>https://www.chenk.top/en/ml-math-derivations/10-semi-naive-bayes-and-bayesian-networks/</guid><description>&lt;blockquote>
&lt;p>&lt;strong>Hook.&lt;/strong> Naive Bayes assumes every feature is conditionally independent given the class. It is a convenient lie — one that lets us train in a single pass over the data, but one that classifiers based on tree structures and small graphs can systematically beat by a few accuracy points on virtually every UCI benchmark. This part walks the spectrum from &amp;ldquo;no dependencies&amp;rdquo; (Naive Bayes) to &amp;ldquo;all dependencies&amp;rdquo; (full joint), showing the three sweet spots that practitioners actually use: SPODE, TAN and AODE. The same factorisation idea, taken to its general form, is the Bayesian network.&lt;/p></description></item></channel></rss>