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.
emmanuj / arome Goto Github PK
View Code? Open in Web Editor NEWA 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.
License: GNU General Public License v2.0