<?xml version="1.0" encoding="utf-8" standalone="yes"?><rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>K-Means on 111qqz's blog</title><link>https://111qqz.com/en/tags/k-means/</link><description>Recent content in K-Means on 111qqz's blog</description><generator>Hugo -- gohugo.io</generator><language>en</language><copyright>© 2015-2026 111qqz</copyright><lastBuildDate>Sun, 26 Nov 2017 11:05:50 +0000</lastBuildDate><atom:link href="https://111qqz.com/en/tags/k-means/index.xml" rel="self" type="application/rss+xml"/><item><title>PCA + kmeans</title><link>https://111qqz.com/en/post/%E6%B7%B1%E5%BA%A6%E5%AD%A6%E4%B9%A0/2017-11-26-pca-kmeans/</link><pubDate>Sun, 26 Nov 2017 11:05:50 +0000</pubDate><guid>https://111qqz.com/en/post/%E6%B7%B1%E5%BA%A6%E5%AD%A6%E4%B9%A0/2017-11-26-pca-kmeans/</guid><description>&lt;h3 class="relative group"&gt;先记录一下PCA实战需要用到的安装包(arch下,python2环境)
 &lt;div id="先记录一下pca实战需要用到的安装包arch下python2环境" class="anchor"&gt;&lt;/div&gt;
 
 &lt;span
 class="absolute top-0 w-6 transition-opacity opacity-0 -start-6 not-prose group-hover:opacity-100 select-none"&gt;
 &lt;a class="text-primary-300 dark:text-neutral-700 !no-underline" href="#%e5%85%88%e8%ae%b0%e5%bd%95%e4%b8%80%e4%b8%8bpca%e5%ae%9e%e6%88%98%e9%9c%80%e8%a6%81%e7%94%a8%e5%88%b0%e7%9a%84%e5%ae%89%e8%a3%85%e5%8c%85arch%e4%b8%8bpython2%e7%8e%af%e5%a2%83" aria-label="Anchor"&gt;#&lt;/a&gt;
 &lt;/span&gt;
 
&lt;/h3&gt;

&lt;h3 class="relative group"&gt;&lt;a href="https://www.archlinux.org/packages/community/x86_64/python-scikit-learn/" target="_blank" rel="noreferrer"&gt;python2-scikit-learn&lt;/a&gt;
 &lt;div id="python2-scikit-learn" class="anchor"&gt;&lt;/div&gt;
 
 &lt;span
 class="absolute top-0 w-6 transition-opacity opacity-0 -start-6 not-prose group-hover:opacity-100 select-none"&gt;
 &lt;a class="text-primary-300 dark:text-neutral-700 !no-underline" href="#python2-scikit-learn" aria-label="Anchor"&gt;#&lt;/a&gt;
 &lt;/span&gt;
 
&lt;/h3&gt;
&lt;p&gt;python2-numpy&lt;/p&gt;</description></item><item><title>k-means clustering 学习笔记</title><link>https://111qqz.com/en/post/acm-icpc/2017/2017-08-03-k-means-clustering-notes/</link><pubDate>Thu, 03 Aug 2017 13:09:17 +0000</pubDate><guid>https://111qqz.com/en/post/acm-icpc/2017/2017-08-03-k-means-clustering-notes/</guid><description>&lt;p&gt;其实这算法巨简单。。。。让我想到了均分纸牌（noip200?&lt;/p&gt;
&lt;p&gt;还是大致说一下：&lt;/p&gt;</description></item></channel></rss>