-
Notifications
You must be signed in to change notification settings - Fork 1
/
Kmeans.java
248 lines (220 loc) · 4.74 KB
/
Kmeans.java
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
import java.io.BufferedReader;
import java.io.FileReader;
import java.io.IOException;
import java.util.ArrayList;
import java.util.*;
import java.util.Collections;
import java.util.HashMap;
class Element{
double x,y;
public Element(double x, double y) {
super();
this.x = x;
this.y = y;
}
}
class Data{
double x;
public Data(double x) {
super();
this.x = x;
}
}
class Cluster1D{
double xc;
static int s=1;
List<Data>cdata;
public Cluster1D() {
// TODO Auto-generated constructor stub
cdata=new ArrayList<>();
}
public boolean computecentre()
{
double xm=0;
for(int i=0;i<cdata.size();i++)
{
xm=xm+cdata.get(i).x;
}
xm=xm/cdata.size();
if(Math.abs(xm-xc)>0.1)
{
xc=xm;
return true;
}
else return false;
}
public void insert(Data data)
{
cdata.add(data);
}
public void remove(Data data)
{
cdata.remove(data);
}
public void print()
{
System.out.println("Cluster:"+s);
s++;
System.out.println("Center = "+xc);
System.out.println("DataPoints :"+cdata.size());
for(Data p:cdata)
{
System.out.println("Value : "+p.x);
}
}
}
class Cluster{
double xc,yc;
static int s=1;
List<Element>celements;
public Cluster() {
celements=new ArrayList<>();
}
public boolean computecentre()
{
double xm=0,ym=0;
for(int i=0;i<celements.size();i++)
{
xm=xm+celements.get(i).x;
ym=ym+celements.get(i).y;
}
xm=xm/celements.size();
ym=ym/celements.size();
if(Math.abs(xm-xc)>1||Math.abs(ym-yc)>1)
{
xc=xm;
yc=ym;
return true;
}
else return false;
}
public void insert(Element element)
{
celements.add(element);
}
public void remove(Element element)
{
celements.remove(element);
}
public void print()
{
System.out.println("Cluster:"+s);
s++;
System.out.println("Attribute1 center = "+xc+"\nAttribute2 center = "+yc);
System.out.println("DataPoints :"+celements.size());
for(Element p:celements)
{
System.out.println("Attr1:"+p.x+"\t\t\tAttr2:"+p.y);
}
}
}
public class Kmeans {
static ArrayList<Element>elements=new ArrayList<>();
static ArrayList<Data>data=new ArrayList<>();
static ArrayList<Double>dist;
static ArrayList<Double>dist1;
static HashMap<Cluster, Integer>Map=new HashMap<>();
static HashMap<Cluster1D, Integer>Map1=new HashMap<>();
public static void main(String args[]) throws IOException
{
BufferedReader br=new BufferedReader(new FileReader("C:\\Users\\Admin\\Desktop\\initialDataset.csv"));
String line="";
int f=0;
while((line=br.readLine())!=null)
{
if(f==0)
{
f=1;
continue;
}
line=line.trim();
String d[]=line.split(",");
Element e=new Element(Double.parseDouble(d[2]), Double.parseDouble(d[3]));
Data dt=new Data(Double.parseDouble(d[2]));
elements.add(e);
data.add(dt);
}
int nc;
System.out.println("Enter number of clusters");
Scanner sc=new Scanner(System.in);
nc=sc.nextInt();
Cluster c[]=new Cluster[nc];
Cluster1D c1[]=new Cluster1D[nc];
for(int i=0;i<nc;i++)
{
c[i]=new Cluster();
c1[i]=new Cluster1D();
int t=5*i;
c[i].xc=elements.get(i).x;
c[i].yc=elements.get(i).y;
c1[i].xc=data.get(i).x;
Map.put(c[i], 1);
Map1.put(c1[i], 1);
}
double d1,d2;
boolean a=true,b=true;
while(!Map1.containsValue(0))
{
for(Data d:data)
{
dist1 = new ArrayList<>();
for(int i=0;i<nc;i++)
{
dist1.add(Math.abs(c1[i].xc-d.x));
}
int mn=dist1.indexOf(Collections.min(dist1));
if(!c1[mn].cdata.contains(d))
c1[mn].insert(d);
int k=0;
for(k=0;k<nc;k++)
{ if(k==mn)
continue;
c1[k].remove(d);
}
}
for(int i=0;i<nc;i++)
{
a=c1[i].computecentre();
if(!a)
{Map1.remove(c[i]);
Map1.put(c1[i], 0);
}
}
}
while(!Map.containsValue(0))
{
for(Element e:elements)
{dist = new ArrayList<>();
for(int i=0;i<nc;i++)
{
dist.add(Math.pow(Math.pow(Math.abs(c[i].xc-e.x), 2)+Math.pow(Math.abs(c[i].yc-e.y), 2), 0.5));
}
int mn=dist.indexOf(Collections.min(dist));
if(!c[mn].celements.contains(e))
c[mn].insert(e);
int k=0;
for(k=0;k<nc;k++)
{
if(k==mn)
continue;
c[k].remove(e);
}
}
for(int i=0;i<nc;i++)
{
a=c[i].computecentre();
if(!a)
{
Map.remove(c[i]);
Map.put(c[i], 0);
}
}
}
System.out.println("Kmeans on 1 Dimension");
for(int i=0;i<nc;i++)
c1[i].print();
System.out.println("Kmeans on 2 Dimension");
for(int i=0;i<nc;i++)
c[i].print();
}
}