main.java

KMeans Algrorithm for search engine

import java.io.*;
import java.util.*;
import java.lang.*;
 
public class main {
   public static void main (String args[]) throws IOException {
      Centroid cent = new Centroid();
      int ClustNumber, datasize, check;
      double[] Cordx, Cordy;
      ClustNumber = datasize = 0; check = 0;
      do {
         BufferedReader stdin = new BufferedReader(new InputStreamReader(System.in));
         System.out.println("Please Enter the Number of Clusters");
         String line = stdin.readLine();
         try{
            ClustNumber = Integer.parseInt(line);
            check = 1;
         }
         catch(NumberFormatException NFE1) {
            System.out.println("Error, not a Number");
            check = 0;
         }
         System.out.println("Please Enter the Number of Datasets");         
         line = stdin.readLine();
         try{
            datasize = Integer.parseInt(line);
            check = 1;
            System.out.println("*****************");
         }
         catch(NumberFormatException NFE2) {
            System.out.println("Error, not a Number");
            check = 0;
         }
         if(ClustNumber>datasize){
            ClustNumber = datasize;
            System.out.println("All Points Are Single Clusters");
         }
      } while(check == 0);
      
 
      Cordx = new double[datasize];
      Cordy = new double[datasize];
      for(int i = 0; i<datasize;i++) {
         Cordx[i] = cent.genRandom(datasize);
         Cordy[i] = cent.genRandom(datasize);
      }
      cent.Grouping(Cordx,Cordy,ClustNumber);
   }
}