K-means Clustering

package KJ;
public class Point {
    int x;
    int y;
    Point(){}
    Point(int x,int y)
    {
    this.x=x;
    this.y=y;
    }

}
public class Particle {
        double x;
        double y;
        Particle(){}
        Particle(double x,double y){
        this.x=x;
        this.y=y;
        }
}
public class K {
static Point a[]=new Point[10];
static Point k[][]=new Point[2][10];
static Particle e0[]=new Particle[2];
static Particle e1[]=new Particle[2];
static double d0,d1;
static int n;
static int m[]=new int[2];
public static void main(String[] args)
{
   K result=newK();
   result.random();
   System.out.println("随机生成的十个点：");
   for(int i=0;i<a.length;i++)
   {
    System.out.print("("+a[i].x+","+a[i].y+")");
   }
   result.k();//将随机生成的10个点分到二维数组中

   for(int i=0;i<2;i++)
   {
    e0[i]=new Particle(0.0,0.0);
    e1[i]=new Particle(0.0,0.0);
   }
   m[0]=a.length/2;
   m[1]=a.length/2;
        for(int i=0;i<a.length/2;i++)
        {
        e0[0].x+=a[i].x;
        e0[0].y+=a[i].y;
        e0[1].x+=a[i+a.length/2].x;
        e0[1].y+=a[i+a.length/2].y;
        }
        e0[0].x/=m[0];
        e0[0].y/=m[0];
        e0[1].x/=m[1];
        e0[1].y/=m[1];
       System.out.println(e0[0].x+","+e0[0].y);
       System.out.println(e0[1].x+","+e0[1].y);
       do{
        System.out.println("经过第"+(++n)+"次循环，得到结果如下：");
           for(int i=0;i<2;i++)
           {
               System.out.print("\n    第"+i+"类：");
               for(int j=0;j<k[0].length;j++)
               {
                System.out.print("("+k[i][j].x+","+k[i][j].y+")");
               }
               System.out.println("点的个数："+m[i]+"聚类中心为："+"("+e0[i].x+","+e0[i].y+")");
           }
   e1[0]=new Particle(0.0,0.0);
   e1[1]=new Particle(0.0,0.0);
        result.run();
      for(int i=0;i<2;i++)
   {
    for(int j=0;j<10;j++)
    {
     e1[i].x+=k[i][j].x;
     e1[i].y+=k[i][j].y;
    }
   }
   e1[0].x/=m[0];
   e1[0].y/=m[0];
   e1[1].x/=m[1];
   e1[1].y/=m[1];
   //result.run();
   if(e1[0].x==e0[0].x&&e1[1].x==e0[1].x&&e1[0].y==e0[0].y&&e1[1].y==e0[1].y)
   {
    System.out.println("\n聚类结束，前后两次聚类中心重合！\n");
    break;
   }

   e0[0]=e1[0];
   e0[1]=e1[1];
       }while(true);
    System.out.println("经过第"+(++n)+"次循环，得到结果如下：");
       for(int i=0;i<2;i++)
       {
           System.out.print("\n    第"+i+"类：");
           for(int j=0;j<k[0].length;j++)
           {
            System.out.print("("+k[i][j].x+","+k[i][j].y+")");
           }
           System.out.println("点的个数："+m[i]+"聚类中心为："+"("+e0[i].x+","+e0[i].y+")");
       }
}
public void random()
{
   for(int i=0;i<a.length;i++)
   {
    a[i]=new Point();
    a[i].x=(int)(Math.random()*100+1);
    a[i].y=(int)(Math.random()*100+1);
    for(int j=0;j<i;j++)
     if(a[j]==a[i])
      i--;
   }
}
private void k()
{
   for(int i=0;i<2;i++)
    for(int j=0;j<k[i].length;j++)
    {
     k[i][j]=new Point(0,0);
    }
   for(int j=0;j<a.length;j++)
   {
    if(j<a.length/2)
    {
     k[0][j]=a[j];
    }
    else
    {
     k[1][j]=a[j];
    }
   }
}
    public void run()
    {
      for(int i=0;i<2;i++)
           for(int j=0;j<k[i].length;j++)
           {
            if(k[i][j].x==0&&k[i][j].y==0)
             continue;
             d0=Math.sqrt((k[i][j].x-e0[0].x)*(k[i][j].x-e0[0].x)+(k[i][j].y-e0[0].y)*(k[i][j].y-e0[0].y));
             d1=Math.sqrt((k[i][j].x-e0[1].x)*(k[i][j].x-e0[1].x)+(k[i][j].y-e0[1].y)*(k[i][j].y-e0[1].y));
               if(d0>d1&&(i==0))
               {
                      k[1][j]=k[i][j];
                      k[i][j]=new Point(0,0);
                      m[1]++;
                      m[0]--;
               }
               if(d0<d1&&(i==1))
           {
                   k[0][j]=k[i][j];
                  k[i][j]=new Point(0,0);
                  m[0]++;
                  m[1]--;
            }
           }
    }
}