问题描述
我想实现一篇论文，标题为"K-Means聚类算法的优化版本".本文在此链接中: https://fedcsis.org/proceedings/2014/pliks /258.pdf .本文不明显.我在stackoverflow中看到@Vpp Man在问这个问题(优化K-means算法 )，但由于对此我还有其他疑问，因此我创建了新的问题页面.
I want to implement a paper with "An Optimized Version of the K-Means Clustering Algorithm" title. This paper is in this link : https://fedcsis.org/proceedings/2014/pliks/258.pdf.This paper is not obvious. I see in stackoverflow that @Vpp Man was ask some question about that (Optimizing K-means algorithm) but because i have extra question about that, i create new question page.
我的问题:
1)算法2是否充满算法，或者我必须将其放入算法1的一部分(在算法1的步骤2中)?
1) Is algorithm2 full of algorithm or I must put it in part of algorithm1 (in step2 of algorithm1)?
2)在算法2的步骤2中:"i"索引的含义是什么?它是迭代次数吗?还是整数?
2) In step 2 of algorithm2: What is mean of 'i' index? is it iteration number? or is a integer number?
3)在算法2的步骤8中:我们必须更新间隔的标记"吗?我们是否也不应更新该间隔内的点的"e"?
3) In step8 of algorithm2: we must update 'tag' of intervals? we don't should update 'e' of points that are in that intervals too?
非常感谢.
推荐答案
您可以在以下网址中看到此算法的代码: https://github.com/cozu/Optimized-K-Means
you can see code of this algorithm in : https://github.com/cozu/Optimized-K-Means
这篇关于关于“优化K-均值算法"的更多问题得到解决.的文章就介绍到这了，希望我们推荐的答案对大家有所帮助，也希望大家多多支持！