Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- public void cluster(ArrayList<Datenpunkt> dpListe, ArrayList<Datenpunkt> centroiden)
- {
- Datenpunkt min = new Datenpunkt();
- double dAbstand = 100;
- double dTemp = 0;
- ArrayList<Datenpunkt>[] clusterArray = new ArrayList[centroiden.size()];
- //init Clusterarray k cluster fuer k centroiden
- for(int c = 0; c < centroiden.size(); c++)
- {
- clusterArray[c] = new ArrayList<Datenpunkt>();
- }
- //for alle Punkte
- for (int i = 0; i < dpListe.size(); i++)
- {
- for(int j = 0; j < centroiden.size();j++)
- {
- //ArrayList<Double> dAbstaende= new ArrayList<Double>();
- dTemp = berechneDistanzEuk(centroiden.get(i),dpListe.get(j));
- if(dTemp!=0)
- {
- if(dTemp < dAbstand)
- {
- //dAbstaende.add(dTemp); // Centroidenabstaende
- min = dpListe.get(j);
- dAbstand = dTemp;
- }
- }
- }
- clusterArray[i].add(min); // minimum in die zugehoerige centroidenliste einfuegen
- }
- System.out.println(clusterArray[0].size()+ "" +clusterArray[1].size()+ "" +clusterArray[2].size()+ "");
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement