k-means算法（欧式距离）

无聊时写个k-means

采用欧式距离，进行分类，随机n个三维（a,b,c）点，聚类成k类

import java.util.*;

public class KMeans {
   

    public static void main(String[] args){
   
        //K-Means ，首先随机生成n个点
        int n = 20;
        int k = 3;
        if (args.length == 2){
   
            n = Integer.valueOf(args[0]);
            k = Integer.valueOf(args[1]);
        }
        Random random = new Random();
        Point[] points = new Point[n];
        for(int i=0; i<n; i++){
   
            points[i] = new Point();
            points[i].x = random.nextInt(100);
            points[i].y = random.nextInt(100);
            points[i].z = random.nextInt