This is to let you know that a new version of SPMF
has been released on the website.
It introduces a Java implementation of DBScan
is a popular algorithm for density-based clustering.
This implementation of DBscan
is done using a KD-Tree to avoid the O(n^2) time complexity of a naive implementation.
If I have time, I will try to implement a few more clustering algorithms in the next few weeks.
Edited 1 time(s). Last edit at 03/07/2015 12:14PM by webmasterphilfv.