<?xml version="1.0" encoding="utf-8" standalone="yes"?><rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom" xmlns:content="http://purl.org/rss/1.0/modules/content/"><channel><title>Unsupervised-Learning on The Standard Error</title><link>https://jongha-jeon-dev.github.io/standarderror/tags/unsupervised-learning/</link><description>Recent content in Unsupervised-Learning on The Standard Error</description><generator>Hugo -- 0.123.7</generator><language>en-gb</language><lastBuildDate>Wed, 14 Oct 2026 00:00:00 +0000</lastBuildDate><atom:link href="https://jongha-jeon-dev.github.io/standarderror/tags/unsupervised-learning/index.xml" rel="self" type="application/rss+xml"/><item><title>ML 32: k-Means Finds k Pieces Whether or Not There Are Clusters</title><link>https://jongha-jeon-dev.github.io/standarderror/lectures/ml-32-kmeans/</link><pubDate>Tue, 13 Oct 2026 00:00:00 +0000</pubDate><guid>https://jongha-jeon-dev.github.io/standarderror/lectures/ml-32-kmeans/</guid><description>k-means always returns k convex pieces of similar spread, and the silhouette score rates the pieces. On uniform noise it rates them higher than it rates the digits.</description></item><item><title>ML 56: A t-SNE Picture Keeps the Neighbours and Loses the Map</title><link>https://jongha-jeon-dev.github.io/standarderror/lectures/ml-56-tsne/</link><pubDate>Wed, 14 Oct 2026 00:00:00 +0000</pubDate><guid>https://jongha-jeon-dev.github.io/standarderror/lectures/ml-56-tsne/</guid><description>A cluster ten times wider than another came out the same size, and a gap ten times wider came out about the same width. What survives the picture is who sits next to whom.</description></item><item><title>ML 57: The BIC Counts Gaussians, Not Clusters</title><link>https://jongha-jeon-dev.github.io/standarderror/lectures/ml-57-bic/</link><pubDate>Wed, 14 Oct 2026 00:00:00 +0000</pubDate><guid>https://jongha-jeon-dev.github.io/standarderror/lectures/ml-57-bic/</guid><description>Given one cluster shaped like a square, the BIC asked for more Gaussian components the more data it saw, 18 at 20,000 points. It was answering a question about shape and sample size, not about clusters.</description></item><item><title>ML 58: DBSCAN's Radius Is a Density, and It Gets Only One</title><link>https://jongha-jeon-dev.github.io/standarderror/lectures/ml-58-dbscan/</link><pubDate>Wed, 14 Oct 2026 00:00:00 +0000</pubDate><guid>https://jongha-jeon-dev.github.io/standarderror/lectures/ml-58-dbscan/</guid><description>DBSCAN found two interlocking half-moons that k-means could not, at the right radius. When clusters differ in density, no radius is right for all of them, and the usual way of choosing it missed even the moons.</description></item><item><title>ML 59: An Anomaly Score Ranks; the Contamination Setting Only Cuts</title><link>https://jongha-jeon-dev.github.io/standarderror/lectures/ml-59-anomaly/</link><pubDate>Wed, 14 Oct 2026 00:00:00 +0000</pubDate><guid>https://jongha-jeon-dev.github.io/standarderror/lectures/ml-59-anomaly/</guid><description>An isolation forest ranked planted anomalies almost perfectly and then flagged whatever share it was told to. Grouped anomalies and irrelevant features changed the ranking itself.</description></item><item><title>ML 60: The Most Stable k Is Not the Number of Clusters</title><link>https://jongha-jeon-dev.github.io/standarderror/lectures/ml-60-stability/</link><pubDate>Wed, 14 Oct 2026 00:00:00 +0000</pubDate><guid>https://jongha-jeon-dev.github.io/standarderror/lectures/ml-60-stability/</guid><description>Resampling found k-means&amp;#39; two-way split of a single Gaussian as reproducible as three real clusters. Stability measures whether the method has one best answer, and cannot say that there are no clusters.</description></item></channel></rss>