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 LAUtil modules.

Here are a few observations:

• The code looks pretty similar to the original Python
• I had to write a few helper modules to make vectors and matrices easier to deal with
• Most notably, my argSort function is very inefficient

Related posts

Tags