-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathk_nearest_neighbors.py
More file actions
54 lines (43 loc) · 1.41 KB
/
k_nearest_neighbors.py
File metadata and controls
54 lines (43 loc) · 1.41 KB
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
import numpy as np
import warnings
from collections import Counter
import pandas as pd
import random
def k_nearest_neighbor(data, predict, k=3):
if len(data) > k:
warnings.warn('k is to small')
distances = []
for group in data:
for features in data[group]:
euclidean_distance = np.linalg.norm(np.array(features)- np.array(predict))
distances.append([euclidean_distance, group])
votes = [i[1] for i in sorted(distances)[:k]]
vote_results = Counter(votes).most_common(1)[0][0]
confidence = Counter(votes).most_common(1)[0][1] / k
return vote_results, confidence
df = pd.read_csv('breast-cancer-wisconsin.data.txt')
df.replace('?', -99999, inplace=True)
df.drop(['id'], 1, inplace=True)
full_data = df.astype(float).values.tolist()
random.shuffle(full_data)
test_size = 0.2
train_set = {2:[], 4:[]}
test_set = {2:[], 4:[]}
train_data = full_data[:-int(test_size * len(full_data))]
test_data = full_data[-int(test_size * len(full_data)):]
for i in train_data:
train_set[i[-1]].append(i[:-1])
for i in test_data:
test_set[i[-1]].append(i[:-1])
correct = 0
total = 0
for group in test_set:
for data in test_set[group]:
vote, confidence = k_nearest_neighbor(train_set, data, k=5)
if vote == group:
correct += 1
else:
print(confidence)
total += 1
accuracy = correct / total
print('Accuracy:' , accuracy)