I'm trying to find out if these algorithm still work if i replace the Euclidean space with metric space defined on the input point set. But i'm having some trouble figuring it out for some of them. I have:
- k-means clustering using Lloyd algorithm, with random initialization
- DBSCAN using the graph-approach
- DBSCAN using the Box-Graph
- Single-link agglomerative clustering
I think only DBSCAN using the Box-Graph still works if we replace it with metric space, but I'm not quite sure if that's correct, what assumptions are made do no longer hold for the other algorithms?