<?xml version="1.0" encoding="utf-8" standalone="yes"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom">
    <channel>
        <title>Kmeans on 南国遗梦的小站</title>
        <link>https://entars.github.io/tags/kmeans/</link>
        <description>Recent content in Kmeans on 南国遗梦的小站</description>
        <generator>Hugo -- gohugo.io</generator>
        <language>zh-cn</language>
        <copyright>Haibo Huang</copyright>
        <lastBuildDate>Sun, 09 Aug 2026 22:37:33 +0800</lastBuildDate><atom:link href="https://entars.github.io/tags/kmeans/index.xml" rel="self" type="application/rss+xml" /><item>
        <title>Kmeans算法</title>
        <link>https://entars.github.io/p/kmeans%E7%AE%97%E6%B3%95/</link>
        <pubDate>Sun, 09 Aug 2026 22:37:33 +0800</pubDate>
        
        <guid>https://entars.github.io/p/kmeans%E7%AE%97%E6%B3%95/</guid>
        <description>&lt;img src="https://entars.github.io/p/kmeans%E7%AE%97%E6%B3%95/wallpaper.jpg" alt="Featured image of post Kmeans算法" /&gt;&lt;h2 id=&#34;一算法概述&#34;&gt;一、算法概述
&lt;/h2&gt;&lt;p&gt;K-Means（K 均值聚类）是一种基于&lt;strong&gt;划分&lt;/strong&gt;的无监督学习算法，用于把 $n$ 个样本划分为 $K$ 个簇（cluster），使得簇内的样本尽可能相似（紧凑），簇间的样本尽可能不同（分离）。&lt;/p&gt;</description>
        </item>
        
    </channel>
</rss>
