Java implementation of a cover tree for clustering on large data sets.

This class provides a Java version of the cover tree nearest neighbor algorithm. It is based on Thomas Kollar's version of "Cover Trees for Nearest Neighbor" by Langford, Kakade, Beygelzimer (2007). The original algorithm is extended towards selecting K centers which are maximally different from one another from an online sample.

Date of creation: 2013-02-08, Copyright (c) 2013, Nils Loehndorf.

The software is provided 'as-is', without any express or implied warranty. In no event will the authors be held liable for any damages arising from the use of this software. Permission is granted to anyone to use this software for any purpose, including commercial applications, and to alter it and redistribute it freely.