# Euclidean distance between list of Vectors with different size of lists

Hello,
I have 2 lists
List1 = [ V1,V2,V3,...,Vn] and List2 = [V1,V2,V3,....,Vk]   ==> Where K != n
And Where all the vectors in both lists have same length of course.

How can i compute the distance between these 2 lists of vectors?
1. Shall i take the centrois of each lists?

Thank you.
###### Who is Participating?

Commented:
Ok, but many kinds of dissimilarity measures satisfy the triangle inequality.
one advantage of centroid over some others is that it is fast and easy to compute
0

Author Commented:
say i take the centroids or center of gravity how can i compute it?
0

Commented:
That's one way.
Other ways include
Minimum distance from a vector in one list to a vector in the other list
Maximum distance from a vector in one list to a vector in the other list
Average distance from a vector in one list to a vector in the other list
Sum of distances from the centroid of both lists to the vectors in each list
...
What properties do you want this distance to have?
0

Author Commented:
Actually i want to compute the dissimilarity between list1 and list2.
0

Author Commented:
if i want to compute the center of gravity or centroid for a list of elements it's easy:
L = [e1,e2,...,en] it's easy just the mean.
But what is confusing me a little is this i can't figure it out:
If L = [v1,v2,....,vn] with each vi = [ x1,...xk] now how can i do it?? ouf it's a little complicated.
0

Commented:
for the centroid, you can take the centroid of each component.
What properties do you want the dissimilarity to have?
What kinds of lists do you want to be dissimilar to other lists?
For example, one property of the centroid measure you propose is that changing the order of the elements of a list does not change its dissimilarity.
Another is that it satisfies the triangle inequality.
0

Author Commented:
Well actually it should satisfy the Triangle inequality.
0

Author Commented:
well i have a question for the centroid but i'll ask it later.
0

Author Commented:
Sorry Correction, Correction
Well actually it should satisfy the Triangle inequality. NOT TRIANGLE INEQUALITY!!!
I want to have a Diagonal Matrix. all entries on the diagonal should be 0.
So i should compute the euclidean distance.

SORRY !!!!!!!!!!!!!
0

Author Commented:
Ouf it's confusing now. Sorry for the mistake.
0

Author Commented:
yeah well maybe i can work on the hausdorff distance i just find something on google. It's not bad and it's close to what u said. MAx[Min[d1,....dn]]

0

Author Commented:
no follow up sorry. I got the answer from a free forum.
Thank you anyway.
take care....
0
Question has a verified solution.

Are you are experiencing a similar issue? Get a personalized answer when you ask a related question.

Have a better answer? Share it in a comment.