-
Notifications
You must be signed in to change notification settings - Fork 0
/
day_4_dhruvdhayal_ai_ml.py
606 lines (516 loc) · 20.2 KB
/
day_4_dhruvdhayal_ai_ml.py
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
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
# -*- coding: utf-8 -*-
"""Day-4_DHRUVDHAYAL_AI/ML.ipynb
Automatically generated by Colab.
Original file is located at
https://colab.research.google.com/drive/1NxtSVhqaCr_RM8Gb88mLkzoRae9jMfvY
#Day-4 Solving the Real-Life Problem Statements.
"""
#Now, we need to develop the Valued Project-2 in Day-4.
#Problem Statement is: We, need to install the random number of sensors at different location randomly.
# -> Task2: Now, we need to give an seperate ID's to each sensors such, that it is quite easy for the identifications.
# -> Task3: Now, we need to find the neighbouring nodes of the main central Node.
# -> Task4: Now, plot the graph and then show the neighbouring node connect it with the main central node.(Distance Formula).
# -> Task5: Make Proper Visualization and also plot it with the help of subgraph , previous graph and then show the plotted graph.
# NOTE: You, can also take the help of chatGPT.
#-------------------------------------------------------- TASK-1 -----------------------------------------------------------
#Task-1 Show all the sensors and plot to show it in the main graph.
#Initializing the Values of the Graph before Plotting.
import numpy as np;
import matplotlib.pyplot as plt;
import seaborn as sns;
import pandas as pd;
#Putting Important formulas to indicate the sensors.
no_of_sensors=10;
np.random.seed(7);
#data=np.random.randint((no_of_sensors,2)); we, use this but 'randint' shows quite discrete value, which removes randomness might be inconvenient,
data=0+(100-0)*np.random.random((no_of_sensors,2));
plt.figure(1);
plt.title("Raw Data about the Sensors");
#Plotting the Main Graph.
plt.plot(data[:,0],data[:,1],'ro'); # - for line, s-star, d-diamond, o-circle(dot), *-star.
plt.grid(True);
#plt.show();
#--------------------------------------------------------- TASK-2 -------------------------------------------------------
#Task-2: Now, we need to show the Identificaton number of the Sensors.
for i in range(data.shape[0]):
dx=data[i,0];
dy=data[i,1];
plt.text(dx-1,dy+2,str(i+1));
#Showing the Valued Graph.
plt.show();
#Now, we need to use the distance formula.
d=10+(20-10)*np.random.random((4,2));
print("\n Matrix of d is: \n\n",d);
print("\n Now, total size of the d: ",d.shape);
print(d[0,:]);
#Print the 0th row of the Matrix.
#Printd the 0th and 1st row of the Matrix only just for the Demonsterations.
print("\n 0th Row of the Matrix : ",d[0,:]);
print("\n 1st Row of the Matrix : ",d[1,:]);
#Performing both the values of the Task-1 & Task-2.
import numpy as np
import matplotlib.pyplot as plt;
import seaborn as sns;
import pandas as pd;
#Putting the Values inside the values of the data;
no_of_sensors=10;
np.random.seed(7);
# data=np.random.randint((no_of_sensors,2)); We, use this but it remove the randomness values might be inconvenient.
data=0+(100-0)*np.random.random((no_of_sensors,2));
#Plotting the Graph Chart by showing the Valued Sensors.
plt.figure(1);
plt.title("Raw Data about the Sensors");
plt.plot(data[:,0],data[:,1],'ro'); #o-circle, d-diamond, *-star,- straight_line, s-square.
plt.grid(True);
#Now, by performing the valued task-3 , we have to find the Identification No, ID's to Identify like: 1,2,3,4,5,....,10.
for i in range(data.shape[0]):
dx=data[i,0];
dy=data[i,1];
plt.text(dx-1,dy+2,str(i+1))
#For, Demonsterations: Calculating and Genrating the Random Matrix.
d=10+(20-10)*np.random.random((4,2));
print("\n 1. Values of the Matrix are: \n\n",d);
print("\n 2. Total Size of the Matrix are: ",d.shape);
# We, can also extract the row data from the given Particular Matrix.
print("\n 1. Showing the 0th Row are: ",d[0,: ]);
print("\n 2. Showing the 1st Row are: ",d[1,: ]);
#Now, We also find the distance between the two-nodes.
#By, using the Distance Formula.
# dist=((x2**2-x1**2)**2 + (y2**2-y1**2)**2);
dist=np.sqrt((data[1,0]-data[0,0])**2 + (data[1,1]-data[0,1])**2);
print("\n --> Total Distance between the two nodes are: ",dist);
#As, of now we need to show the zeros of the main matrix.
dist_matrix=np.zeros((no_of_sensors,no_of_sensors));
print("\n Given Particular Matrix are: \n\n",dist_matrix);
"""#Task-3 Finding the Distance of one w.r.t to others."""
#Task-3: finding the distance for each node w.r.t to another to find thier neigbouring nodes.
dist=0+(100-0)*np.random.random((no_of_sensors,2));
dist_matrix=np.zeros((data.shape[0],data.shape[0]));
#Showing the dIstance from one node to another.
#NOTE: one node compare by own it'self get value 0 because by comparing himself distance is found to be 0. Then all diagonal of the Matrix is found to be 0 again!
for i in range(data.shape[0]):
for j in range(data.shape[0]):
dist=np.sqrt((data[i,0]-data[j,0])**2+(data[i,1]-data[j,1])**2);
dist_matrix[i,j]=dist;
#Now, show the distance of node w.r.t to other's nodes.
print("\n Distance of Node with respect to other: \n\n",dist_matrix.astype(int));
print(dist_matrix.astype(int));
"""#Now, we have the given Sensing Range = 60.
#We, need to find the node, if any node having distance <=60, then replace the value it with '1', unless/untill remains same 0.
"""
#Now, we compare the values to find the dist_matrix it with the sensing range.
neighbour_matrix=np.zeros((data.shape[0],data.shape[0]));
sensing_range=60;
for i in range(data.shape[0]):
for j in range(data.shape[0]):
if(i!=j):
if(dist_matrix[i,j]<=sensing_range):
neighbour_matrix[i,j]=1;
else:
neighbour_matrix[i,j]=0;
#Showing the Neighbour Matrix Values.
print("\n --> Given Values of the Neighbour Matrix: \n\n",neighbour_matrix);
"""#Now, we need take the user as input from the user as node no.
#Then we need to show all the neighbouring nodes of the main_Node searched by the User.
"""
#Now, we need to take user_input as name of node in 'int' forms and then we have the responsibility to show it's neighbouring nodes.
count=0;
node=int(input("\n 1. Enter the Node user want to search for: "));
node=node-1;
temp_neigh=[];
temp_neighbouring_matrix=neighbour_matrix[node,:];
for i in range(temp_neighbouring_matrix.shape[0]):
if(temp_neighbouring_matrix[i]==1):
temp_neigh.append(i+1);
count=count+1;
print("\n Node: ",i+1);
#Printing all the collection of Data & Informations.
print("\n--------------------------------- OUTPUT ! ---------------------------------------")
print("\n --> Node choosen by the User are: ",node," Neighbouring Nodes: ",temp_neigh);
print("\n --> Neighbouring Nodes: ",temp_neigh);
print("\n --> Total No. of Neighbouring Nodes are: ",count);
"""#Task-4 Now, we knoe the current_node as node entered by the user as well it's neigbouring nodes. Now in this we have to plot the Graph, and join all neighbouring nodes with it's central axis of main current user node."""
# Plotting the graph
plt.figure(figsize=(10, 8));
#Plotting the graph to indicate and show the main node connect it with the Neighbouring node with line and special shape character designs.
for i in range(data.shape[0]):
dx=data[i,0];
dy=data[i,1];
plt.text(dx-1,dy+2,str(i+1), fontsize=12);
plt.plot(data[node,0],data[node,1],'rd');
#Showing the neighbouring nodes.
for i in range(len(temp_neigh)):
Xtemp=[data[node,0],data[temp_neigh[i],0]];
Ytemp=[data[node,1],data[temp_neigh[i],1]];
plt.plot(Xtemp,Ytemp,'go-',linewidth=2);
plt.plot(data[temp_neigh[i],0],data[temp_neigh[i],1],'ko');
#Showing the Valued Graphs.
plt.figure(1,(10,8));
plt.title("Raw Data about the Sensors");
plt.xlabel("Sensors");
plt.ylabel("Data Points");
plt.grid(True);
# Setting the axis limits to ensure all nodes appear properly
plt.xlim(np.min(data[:, 0]) - 5, np.max(data[:, 0]) + 5);
plt.ylim(np.min(data[:, 1]) - 5, np.max(data[:, 1]) + 5);
#Showing the Graph as Given Below!
plt.show();
# Plotting the graph
plt.figure(figsize=(10, 8)) # Adjust the figure size if needed
# Plotting the main node and its index
for i in range(data.shape[0]):
dx = data[i, 0]
dy = data[i, 1]
plt.text(dx - 1, dy + 2, str(i + 1), fontsize=12)
plt.plot(data[node, 0], data[node, 1], 'kd') # 'bo' for blue circle marker
# Plotting the neighboring nodes
for i in range(len(temp_neigh)):
Xtemp = [data[node, 0], data[temp_neigh[i], 0]]
Ytemp = [data[node, 1], data[temp_neigh[i], 1]]
plt.plot(Xtemp, Ytemp, 'bo-', linewidth=2) # 'rd-' for red diamond marker and line
plt.plot(data[temp_neigh[i], 0], data[temp_neigh[i], 1], 'ko') # 'rs' for red square marker
# Showing the valued graphs
plt.title("Raw Data about the Sensors")
plt.xlabel("Sensors")
plt.ylabel("Data Points")
plt.grid(True)
# Setting the axis limits to ensure all nodes appear properly
plt.xlim(np.min(data[:, 0]) - 5, np.max(data[:, 0]) + 5)
plt.ylim(np.min(data[:, 1]) - 5, np.max(data[:, 1]) + 5)
# Show the plot
plt.show()
"""#Now, We are Implementing the Values of K-Means.
# 1. Manually.
"""
#Create the 50 Nodes Data-Points visualise it in a 2-D Plane, and divide the data it into the 2-Clusters.
#Create the 50 Nodes Data-Points visualise it in a 2-D Plane, and divide the data it into the 4-Clusters.
#Firstly , we create the nodes and plot the graph for proper visualizations.
import numpy as np;
import matplotlib.pyplot as plt;
import seaborn as sns;
import pandas as pd;
#Putting all the Important values in the Graphs.
num=500;
np.random.seed(7);
data=0+(100-0)*np.random.random((num,2));
plt.figure(4,(4,4));
plt.title("Raw Data of K-Map Manually!");
plt.plot(data[ :,0],data[ :,1],'ro');
plt.grid(True);
plt.show();
#Color them half of the cluster of two differrent Shaded Colored!
for i in range(data.shape[0]):
dxi=data[i,0];
dyi=data[i,1];
if(dxi<50):
plt.plot(dxi,dyi,'ro');
else:
plt.plot(dxi,dyi,'bo');
#Show the Valued Graph!
plt.show();
#Now, we have to show the Values of 4-Clusters but of differrent colors.
for i in range(data.shape[0]):
dxi=data[i,0];
dyi=data[i,1];
if(dxi<50):
if(dyi<50):
plt.plot(dxi,dyi,'ro');
else:
plt.plot(dxi,dyi,'bo');
else:
if(dyi<50):
plt.plot(dxi,dyi,'go');
else:
plt.plot(dxi,dyi,'ko');
#Show the Valued Graph!
plt.title("4-Clusters K-Mean (Manually)");
plt.figure(1,figsize=(12,6));
plt.xlabel("Clusters");
plt.ylabel("Data Points");
plt.grid(False);
plt.show();
"""#Now, we are Implementing the Automatic Version of K-Means.
#Clustering with respect to its central centroid.
# 2. Automtic.
"""
#Making the Values of the Automatic Clusters.
num=400;
data=0+(100-0)*np.random.random((num,2));
#Consider data-point 0 at centroid 1.
c1x=data[0,0]; c1y=data[0,1];
c2x=data[1,0]; c2y=data[1,1];
# step 2 find the distances of centroid and 1 and centroid 2 with respect to
# all the datapoints
for it in range(10):
plt.figure(1);
plt.plot(data[ :,0],data[:,1],'rs');
#Making of the Clusters.
Cluster1x=[]; Cluster1y=[];
Cluster2x=[]; Cluster2y=[];
for i in range(data.shape[0]):
d1=np.sqrt((data[i,0]-c1x)**2+(data[i,1]-c1y)**2);
d2=np.sqrt((data[i,0]-c2x)**2+(data[i,1]-c2y)**2);
if(d1<d2):
Cluster1x.append(data[i,0]);
Cluster1y.append(data[i,1]);
plt.plot(data[i,0],data[i,1],'bs');
else:
Cluster2x.append(data[i,0]);
Cluster2y.append(data[i,1]);
plt.plot(data[i,0],data[i,1],'gs');
plt.plot(c1x,c1y,'kd');
plt.plot(c2x,c2y,'kd');
#Now, we need to show it with automatic repeatitions.
#Implementing the Actual Values.
num=400;
data=0+(100-0)*np.random.random((num,2));
#Consider Data-Point '0' up with the Centroid Cluster-1.
c1x=data[0,0]; c1y=data[0,1];
#Consider Data-Point '1' up with the Centroid Cluster-2.
c2x=data[1,0]; c2y=data[1,1];
# step 2 find the distances of centroid and 1 and centroid 2 with respect to
# All the Data-Points.
for it in range(10):
plt.figure(1,(10,5));
plt.plot(data[ :,0],data[ :,1],'rs');
#Making of the Clusters.
Cluster1x=[]; Cluster1y=[];
Cluster2x=[]; Cluster2y=[];
for i in range(data.shape[0]):
d1=np.sqrt((c1x-data[i,0])**2 + (c1y-data[i,1])**2);
d2=np.sqrt((c2x-data[i,0])**2 + (c1y-data[i,1])**2);
if(d1<d2):
Cluster1x.append(data[i,0]);
Cluster1y.append(data[i,1]);
plt.plot(data[i,0],data[i,1],'bs');
else:
Cluster2x.append(data[i,0]);
Cluster2y.append(data[i,1]);
plt.plot(data[i,0],data[i,1],'gs');
#Display the Final Graph!
plt.plot(c1x,c1y,'kd');
plt.plot(c2x,c2y,'kd');
#Now, Finding the Average of Each.
c1xavg=sum(Cluster1x)/len(Cluster1x);
c1yavg=sum(Cluster1y)/len(Cluster1y);
c2xavg=sum(Cluster2x)/len(Cluster2x);
c2yavg=sum(Cluster2y)/len(Cluster2y);
c1x=c1xavg; c1y=c1yavg;
c2x=c2xavg; c2y=c2yavg;
print(" Iterations: ",str(it));
plt.pause(0.5);
#Now, we need to show it with automatic repeatitions.
#Implementing the Actual Values.
num=400;
data=0+(100-0)*np.random.random((num,2));
#Consider Data-Point '0' up with the Centroid Cluster-1.
c1x=data[0,0]; c1y=data[0,1];
#Consider Data-Point '1' up with the Centroid Cluster-2.
c2x=data[1,0]; c2y=data[1,1];
# step 2 find the distances of centroid and 1 and centroid 2 with respect to
# All the Data-Points.
for it in range(10):
plt.figure(1,(10,5));
plt.plot(data[ :,0],data[ :,1],'rs');
#Making of the Clusters.
Cluster1x=[]; Cluster1y=[];
Cluster2x=[]; Cluster2y=[];
for i in range(data.shape[0]):
d1=np.sqrt((c1x-data[i,0])**2 + (c1y-data[i,1])**2);
d2=np.sqrt((c2x-data[i,0])**2 + (c1y-data[i,1])**2);
if(d1<d2):
Cluster1x.append(data[i,0]);
Cluster1y.append(data[i,1]);
plt.plot(data[i,0],data[i,1],'bs');
else:
Cluster2x.append(data[i,0]);
Cluster2y.append(data[i,1]);
plt.plot(data[i,0],data[i,1],'gs');
#Display the Final Graph!
plt.plot(c1x,c1y,'kd');
plt.plot(c2x,c2y,'kd');
#Now, Finding the Average of Each.
C1xavg=sum(Cluster1x)/len(Cluster1x); # Dedent this line and subsequent lines
C1yavg=sum(Cluster1y)/len(Cluster1y);
C2xavg=sum(Cluster2x)/len(Cluster2x);
C2yavg=sum(Cluster2y)/len(Cluster2y);
c1x=C1xavg; c1y=C1yavg;
c2x=C2xavg; c2y=C2yavg;
print(" Iterations: ",str(it));
plt.pause(0.5);
#Now, we need to show it with automatic repeatitions.
#Implementing the Actual Values.
num=400;
data=0+(100-0)*np.random.random((num,2));
#Consider Data-Point '0' up with the Centroid Cluster-1.
c1x=data[0,0]; c1y=data[0,1];
#Consider Data-Point '1' up with the Centroid Cluster-2.
c2x=data[1,0]; c2y=data[1,1];
#Consider Data-Point '1' up with the Centroid Cluster-2.
c3x=data[2,0]; c3y=data[2,1];
#Consider Data-Point '1' up with the Centroid Cluster-2.
c4x=data[3,0]; c4y=data[3,1];
# step 2 find the distances of centroid and 1 and centroid 2 with respect to
# All the Data-Points.
for it in range(10):
plt.figure(1,(10,5));
plt.plot(data[ :,0],data[ :,1],'rs');
#Making of the Clusters.
Cluster1x=[]; Cluster1y=[];
Cluster2x=[]; Cluster2y=[];
Cluster3x=[]; Cluster3y=[];
Cluster4x=[]; Cluster4y=[];
for i in range(data.shape[0]):
d1=np.sqrt((c1x-data[i,0])**2 + (c1y-data[i,1])**2);
d2=np.sqrt((c2x-data[i,0])**2 + (c1y-data[i,1])**2);
d3=np.sqrt((c3x-data[i,0])**2 + (c3y-data[i,1])**2);
d4=np.sqrt((c4x-data[i,0])**2 + (c4y-data[i,1])**2);
if(d1<d2 and d1<d3 and d1<d4):
Cluster1x.append(data[i,0]);
Cluster1y.append(data[i,1]);
plt.plot(data[i,0],data[i,1],'bs');
elif(d2<d1 and d2<d3 and d2<d4):
Cluster2x.append(data[i,0]);
Cluster2y.append(data[i,1]);
plt.plot(data[i,0],data[i,1],'gs');
elif(d3<d1 and d3<d2 and d3<d4):
Cluster3x.append(data[i,0]);
Cluster3y.append(data[i,1]);
plt.plot(data[i,0],data[i,1],'rs');
else:
Cluster4x.append(data[i,0]);
Cluster4y.append(data[i,1]);
plt.plot(data[i,0],data[i,1],'cs');
#Display the Final Graph!
plt.plot(c1x,c1y,'kd');
plt.plot(c2x,c2y,'kd');
plt.plot(c3x,c3y,'kd');
plt.plot(c4x,c4y,'kd');
#Now, Finding the Average of Each.
C1xavg=sum(Cluster1x)/len(Cluster1x); # Dedent this line and subsequent lines
C1yavg=sum(Cluster1y)/len(Cluster1y);
C2xavg=sum(Cluster2x)/len(Cluster2x);
C2yavg=sum(Cluster2y)/len(Cluster2y);
C3xavg=sum(Cluster3x)/len(Cluster3x); # Dedent this line and subsequent lines
C3yavg=sum(Cluster3y)/len(Cluster3y);
C4xavg=sum(Cluster4x)/len(Cluster4x);
C4yavg=sum(Cluster4y)/len(Cluster4y);
c1x=C1xavg; c1y=C1yavg;
c2x=C2xavg; c2y=C2yavg;
c3x=C3xavg; c3y=C3yavg;
c4x=C4xavg; c4y=C4yavg;
print(" Iterations: ",str(it));
plt.pause(0.5);
# auto clustering (2 cluster algorithm )
num=400
data = 0+(100-0)*np.random.random((num,2))
# consider datapoint0 as centroid 1
c1x = data[0,0];c1y = data[0,1]
# consider datapoint1 as centroid 2
c2x = data[1,0];c2y = data[1,1]
# step 2 find the distances of centroid and 1 and centroid 2 with respect to
# all the datapoints
for it in range(10):
plt.figure(1,(10,2))
plt.subplot(1,2,1)
#plt.title('Raw data')
plt.plot(data[:,0],data[:,1],'rs')
Cluster1x=[];Cluster1y=[]
Cluster2x=[];Cluster2y=[]
for i in range(data.shape[0]):
d1 = np.sqrt((c1x-data[i,0])**2 + (c1y-data[i,1])**2)
d2 = np.sqrt((c2x-data[i,0])**2 + (c2y-data[i,1])**2)
if(d1<d2):
Cluster1x.append(data[i,0])
Cluster1y.append(data[i,1])
plt.plot(data[i,0],data[i,1],'bs')
else:
Cluster2x.append(data[i,0])
Cluster2y.append(data[i,1])
plt.plot(data[i,0],data[i,1],'gs')
plt.plot(c1x,c1y,'kd') # to plot the centroid1
plt.plot(c2x,c2y,'kd') # to display the centroid 2
#print("datapoints in cluster1",len(Cluster1x))
#print("datapoints in cluster2",len(Cluster2x))
#step 3
# now take the average of all the x coord and y coord of both
# cluster 1 and cluster2
C1xavg = sum(Cluster1x)/len(Cluster1x)
C1yavg = sum(Cluster1y)/len(Cluster1y)
C2xavg = sum(Cluster2x)/len(Cluster2x)
C2yavg = sum(Cluster2y)/len(Cluster2y)
# step4
# update the centroids of cluster 1 and cluster 2 as per their averages
c1x = C1xavg;c1y = C1yavg
c2x = C2xavg;c2y = C2yavg
plt.title(["Iteration number: "+str(it)])
plt.pause(0.5) # half second delay
# auto clustering (2 cluster algorithm )
num=400
data = 0+(100-0)*np.random.random((num,2))
# consider datapoint0 as centroid 1
c1x = data[0,0];c1y = data[0,1]
# consider datapoint1 as centroid 2
c2x = data[1,0];c2y = data[1,1]
# consider datapoint1 as centroid 2
c3x = data[2,0];c3y = data[2,1]
# consider datapoint1 as centroid 2
c4x = data[3,0];c4y = data[3,1]
# step 2 find the distances of centroid and 1 and centroid 2 with respect to
# all the datapoints
for it in range(10):
plt.figure(1,(10,2))
plt.subplot(1,2,1)
#plt.title('Raw data')
plt.plot(data[:,0],data[:,1],'rs')
Cluster1x=[];Cluster1y=[]
Cluster2x=[];Cluster2y=[]
Cluster3x=[];Cluster3y=[]
Cluster4x=[];Cluster4y=[]
for i in range(data.shape[0]):
d1 = np.sqrt((c1x-data[i,0])**2 + (c1y-data[i,1])**2)
d2 = np.sqrt((c2x-data[i,0])**2 + (c2y-data[i,1])**2)
d3 = np.sqrt((c3x-data[i,0])**2 + (c3y-data[i,1])**2)
d4 = np.sqrt((c4x-data[i,0])**2 + (c4y-data[i,1])**2)
if(d1<d2 and d1<d3 and d1<d4):
Cluster1x.append(data[i,0])
Cluster1y.append(data[i,1])
plt.plot(data[i,0],data[i,1],'bs');
elif(d2<d1 and d2<d3 and d2<d4):
Cluster2x.append(data[i,0])
Cluster2y.append(data[i,1])
plt.plot(data[i,0],data[i,1],'gs');
elif(d3<d1 and d3<d2 and d3<d4):
Cluster3x.append(data[i,0])
Cluster3y.append(data[i,1])
plt.plot(data[i,0],data[i,1],'ro');
else:
Cluster4x.append(data[i,0])
Cluster4y.append(data[i,1])
plt.plot(data[i,0],data[i,1],'co');
plt.plot(c1x,c1y,'kd') # to plot the centroid1
plt.plot(c2x,c2y,'kd') # to display the centroid 2
plt.plot(c3x,c3y,'kd') # to display the centroid 2
plt.plot(c4x,c4y,'kd') # to display the centroid 2
#print("datapoints in cluster1",len(Cluster1x))
#print("datapoints in cluster2",len(Cluster2x))
#step 3
# now take the average of all the x coord and y coord of both
# cluster 1 and cluster2
C1xavg = sum(Cluster1x)/len(Cluster1x)
C1yavg = sum(Cluster1y)/len(Cluster1y)
C2xavg = sum(Cluster2x)/len(Cluster2x)
C2yavg = sum(Cluster2y)/len(Cluster2y)
C3xavg = sum(Cluster3x)/len(Cluster3x)
C3yavg = sum(Cluster3y)/len(Cluster3y)
C4xavg = sum(Cluster4x)/len(Cluster4x)
C4yavg = sum(Cluster4y)/len(Cluster4y)
# step4
# update the centroids of cluster 1 and cluster 2 as per their averages
c1x = C1xavg;c1y = C1yavg
c2x = C2xavg;c2y = C2yavg
c3x = C3xavg;c3y = C3yavg
c4x = C4xavg;c4y = C4yavg
plt.title(["Iteration number: "+str(it)])
plt.pause(0.5) # half second delay
"""#Hence, we have Completed Day-4 at Summer_Internship_With_METAFISER."""