François Bérenger
François Bérenger
done in molenc_UHD
``` val test_distance: int -> P.t array -> (P.t, P.t, P.t) option ``` [test_distance nb_tests points] return None if no violation was found, Some (x, y, z) else
maybe we should read from a pipe to get the semaphore
Ester, Martin, et al. "A density-based algorithm for discovering clusters in large spatial databases with noise." Kdd. Vol. 96. No. 34. 1996.
unless -v was passed on the CLI
maybe we need to extend the current interface in order to support that
There is a discussion about such tricks there: https://discuss.ocaml.org/t/format-kprintf-usage/1396/18
also compute the silhouette metric for a given k
https://doi.org/10.1016/0377-0427(87)90125-7
will need to functorize and extract some code from somewhere else