onyx_online/grokking-algorithms
1
0
Fork 0
mirror of https://github.com/onyx-and-iris/grokking-algorithms.git synced 2024-11-15 17:30:52 +00:00
Code Issues Packages Projects Releases Wiki Activity

move average calculation out of knn()

Browse Source
This commit is contained in:
onyx-and-iris 2024-01-17 20:30:48 +00:00
parent c2dab280ac
commit f310eda779
1 changed files with 10 additions and 7 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

17
chapter12/loaves.py
View File

@ -30,10 +30,7 @@ def knn(point: Point, neighbours):
neighbour.distance = np.linalg.norm(point.array - neighbour.array)
logger.debug(f"{neighbour.identifier}: {neighbour.distance}")
total = 0
for n in sorted(neighbours, key=lambda x: x.distance)[:K]:
total += n.sold
return total / K
return sorted(neighbours, key=lambda x: x.distance)[:K]
neighbours = [
@ -47,7 +44,13 @@ neighbours = [
point = Point("T", 4, True, False)
K = 4
average_distance = knn(point, neighbours)
logger.debug(average_distance)
print(f"Number of loaves to make: {int(round(average_distance, 0))}")
k_nearest = knn(point, neighbours)
average_sold = 0
for n in k_nearest:
average_sold += n.sold
average_sold = average_sold / K
logger.debug(average_sold)
print(f"Number of loaves to make: {int(round(average_sold, 0))}")