Services & Resources / Wolfram Forums / MathGroup Archive
-----

MathGroup Archive 2013

[Date Index] [Thread Index] [Author Index]

Search the Archive

Re: Euclidean distance of all pairwise combinations (redundants)

  • To: mathgroup at smc.vnet.net
  • Subject: [mg129637] Re: Euclidean distance of all pairwise combinations (redundants)
  • From: Francisco Gutierrez <fgutiers2002 at yahoo.com>
  • Date: Fri, 1 Feb 2013 01:16:14 -0500 (EST)
  • Delivered-to: l-mathgroup@mail-archive0.wolfram.com
  • Delivered-to: l-mathgroup@wolfram.com
  • Delivered-to: mathgroup-newout@smc.vnet.net
  • Delivered-to: mathgroup-newsend@smc.vnet.net
  • References: <k7ve05$s08$1@smc.vnet.net> <20130201014741.855936894@smc.vnet.net>
  • Reply-to: Francisco Gutierrez <fgutiers2002 at yahoo.com>

One way would be with Outer. Simply take care of plugging in the level at which you want the operation performed.lista1={{1,1,1},{1,3,1},{3,2,4}}
lista2={{1,2,1},{1,2,3}}

 Outer[EuclideanDistance,lista1,lista2,1]


Note the 1 at the end, for level 1.



Ouput: {{1,Sqrt[5]},{1,Sqrt[5]},{Sqrt[13],Sqrt[5]}}
Francisco



________________________________

From: "vasiliadesmixalis at gmail.com" <vasiliadesmixalis at gmail.com>
To: mathgroup at smc.vnet.net 
Sent: Thursday, January 31, 2013 8:47 PM
Subject: [mg129637] Re: Euclidean distance of all pairwise combinations (redundants)

Hi,

I am wondering on how to get the euclidean distance between all the point from two different list .

For example : list1=[{1,1,1},{1,3,1},{3,2,4}] , list2=[{1,2,1},{1,2,3}] etc.

how to find the euclidean comparing all the pairs ?? {1,1,1} with {1,2,1} and then {1,1,1} with {1,2,3} etc...



  • Prev by Date: Re: List manipulation question - 2013
  • Next by Date: Re: Euclidean distance of all pairwise combinations (redundants)
  • Previous by thread: Re: List manipulation question - 2013
  • Next by thread: Re: Euclidean distance of all pairwise combinations (redundants)