A brute force implementation of the basic 1-NNR (Nearest neighbor) algorithm in ocaml. The implementation is very unsophisticated and the uses the Euclidean distance measure.
OCamlGPL-2.0
arome
A brute force implementation of the basic 1-NNR (Nearest neighbor) algorithm in ocaml. The implementation is very unsphisticated and the uses the Euclidean distance measure.