I’m currently working through Machine Learning in Action with the goal of learning some machine learning and translating the code into Haskell.
Here’s my translation of the k-nearest-neighbour implementation from chapter 2:
Note that this depends on some of the helper functions in my
Here are a few observations:
argSortfunction is very inefficient
Content © 2023 Richard Cook. All rights reserved.