GVM Java Library 1.1

GVM Java Library - Fast Spatial Clustering Algorithm.

Fast Spatial Clustering Algorithm.

GVM, otherwise known as Greedy Variance Minimization was developed as a spatial clustering algorithm that can cope with extremely large data sets.

Now you can make use of this handy package to further improve your development process.

GVM Java Library features :

- The algorithm places no restrictions on the number of items (N), dimensions (D) and clusters (C).
- The algorithm scales linearly with the number items clustered. Specifically the worst case time complexity of the algorithm is N·D·C log C;
- Memory usage is constant and independent of the number of items clustered. Specifically, the space complexity is C2 + D·C.

Requirements:

- Java

GVM Java Library 1.1 is licensed as Freeware for the Windows operating system / platform. GVM Java Library is provided as a free download for all software users (Freeware).