Kmeans++算法C++代码

最新推荐文章于 2024-08-14 00:10:28 发布

丘丰寿

最新推荐文章于 2024-08-14 00:10:28 发布

阅读量1.9k

点赞数 1

分类专栏： C++，机器学习文章标签： C++ 机器学习

本文链接：https://blog.csdn.net/u010364639/article/details/78048674

版权

本文介绍了K-means++算法的C++实现，包括详细代码和步骤解释。通过随机选择初始质心，然后迭代更新质心和分配类别，直至达到预设的迭代次数或质心不再显著变化。代码中包含了K-means算法的主流程和初始化过程。

摘要由CSDN通过智能技术生成

原理见网站http://blog.csdn.net/loadstar_kun/article/details/39450615。C++代码如下

#include<math.h>
#include<stdio.h>
#include<cstdlib>
#include<ctime>
#include<vector>
#include<iostream>
using namespace std;

struct Result_Sort{
int minlocation;
double result;
};
//排序，对所有点分簇，返回分簇的簇，和距离的大小
Result_Sort Sort(vector<double> tmp, Result_Sort Result_Sort1);
Result_Sort Sort(vector<double> tmp, Result_Sort Result_Sort1){
Result_Sort1.result = tmp[0];
for (int i = 1; i < tmp.size(); i++){
  if (Result_Sort1.result>tmp[i])
  {
   Result_Sort1.result = tmp[i];
   Result_Sort1.minlocation = i;
  }
}
return Result_Sort1;
}

struct K_Means_Result{
vector<int>Label;
vector<double>CentralPoint;
};
//一维的标准的k-means算法
K_Means_Result K_Means(vector<double>Input, K_Means_Result K_Means_Result1);
K_Means_Result K_Means(vector<double>Input, K_Means_Result K_Means_Result1){
int M, N;
M = Input.size();
N = K_Means_Result1.CentralPoint.size();
vector<vector<double>> Dist(M, vector<double>(N));
vector<double> mindist(M);
vector<double>tmpCen(N);
vector<int> Count(N);
for (int i = 0; i < M; i++){ mindist[i] = 0.0;}
for (int i = 0; i < N; i++){ tmpCen[i] = 0.0; Count[i] = 0; }

//迭代次数
int iteration = 30;
for (int iter = 0; iter<iteration; iter++){
  for (int len = 0; len < M ; len++){
   for (int kk = 0; kk < N; kk++){
    //计算所有点和所有质心的距离
    Dist[len][kk] = sqrt(