Trees for non-Metrics? about nearestneighbors.jl

[davidbp]

This would come in handy for Clustering.jl, what do you think @KristofferC ? Currently cluster assigment is performed computing and storing all pairwise distances, which is quite bad in terms of memory (and it ends up beeing slower as well), it would be nice to use a BruteTree to get cluster assigments. Something similar to

using NearestNeighbors

function get_cluster_assignments_nearest_neighbors(
   X::Matrix{T}, 
   centers::Matrix{T}, 
   distance::SemiMetric=SqEuclidean(),       # in: function to calculate distance with
   ) where {F<:Function,T}

   brutetree = BruteTree(centers, distance)
   idx, distances = knn(brutetree, X, 1) 
   
   return idx
end

I asked for this in this PR JuliaStats/Clustering.jl#238 but the idea was to leverage something like Distances.jl or NearestNeighbors and not implement this within the package.