-
-
Notifications
You must be signed in to change notification settings - Fork 321
New issue
Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.
By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.
Already on GitHub? Sign in to your account
How can I cluster data using a distance matrix with the ELKI library? #60
Comments
There are already different implementations of a distance function for precomputed distances, for example See also: https://elki-project.github.io/howto/precomputed_distances |
Does this support asymmetric matrices? |
A distance is supposed to be symmetric; it may or may not work with asymmetric distances. But it even more depends on the algorithm. Many will assume distances are symmetric, and asymmetric distances can likely cause infinite loops etc. Some parts of the code may be switching x and y if they have reason to assume that one is faster than the other because of caches etc. |
Alright. Thanks a lot! |
I have a distance matrix and I want to use that distance matrix when clustering my data.
I've read the ELKI documentation and it states that I can overwrite the
distance
method when extending theAbstractNumberVectorDistanceFunction
class.The
distance
class however, returns the coordinates. So from coordinate x to coordinate y. This is troublesome because the distance matrix is filled only with distance values and we use the indexes to find the distance value fromindex x
toindex y
. Here's the code from the documentation:My question is how to correctly use the distance matrix when clustering with ELKI.
The text was updated successfully, but these errors were encountered: