You are viewing a plain text version of this content. The canonical link for it is here.
Posted to user@mahout.apache.org by Raviv Pavel <ra...@gigya-inc.com> on 2012/01/25 14:39:11 UTC
Finding max/min distance
Given a list of vectors and a distance measure, what's the fastest way to
find the maximum & minimum distances in the list ?
Thanks.
*--*Raviv
Re: Finding max/min distance
Posted by Raviv Pavel <ra...@gigya-inc.com>.
Great idea. Thanks .
*
*
*--*Raviv
On Wed, Jan 25, 2012 at 6:11 PM, Paritosh Ranjan <pr...@xebia.com> wrote:
> In case of larger lists, you can find the clusters after clustering. There
> won't be many.
> Then do a brute force and find "farthest" and "nearest" clusters.
> Then compare the vectors of farthest and nearest "clusters" to find the
> farthest and nearest "vector pairs".
>
> ________________________________________
> From: Raviv Pavel [raviv@gigya-inc.com]
> Sent: Wednesday, January 25, 2012 4:44 PM
> To: user@mahout.apache.org
> Subject: Re: Finding max/min distance
>
> Since my list is fairly short (~2000 vectors) i sued the brute-force way
> and did exactly that.
> I was hoping mahout had something smarter, in case I'll have to handle much
> larger lists.
>
> *
> *
> *--*Raviv
>
>
>
> On Wed, Jan 25, 2012 at 5:22 PM, Paritosh Ranjan <pr...@xebia.com>
> wrote:
>
> > Do you want to find the pair of vectors which are "farthest" and
> "nearest"
> > ?
> > If yes, I think you will have to compare all pairs using
> >
> > double distance(Vector v1, Vector v2);
> >
> > of DistanceMeasure.
> >
> > I don't think Mahout has something in built for this.
> > ________________________________________
> > From: Raviv Pavel [raviv@gigya-inc.com]
> > Sent: Wednesday, January 25, 2012 2:39 PM
> > To: user@mahout.apache.org
> > Subject: Finding max/min distance
> >
> > Given a list of vectors and a distance measure, what's the fastest way to
> > find the maximum & minimum distances in the list ?
> >
> > Thanks.
> > *--*Raviv
> >
>
RE: Finding max/min distance
Posted by Paritosh Ranjan <pr...@xebia.com>.
In case of larger lists, you can find the clusters after clustering. There won't be many.
Then do a brute force and find "farthest" and "nearest" clusters.
Then compare the vectors of farthest and nearest "clusters" to find the farthest and nearest "vector pairs".
________________________________________
From: Raviv Pavel [raviv@gigya-inc.com]
Sent: Wednesday, January 25, 2012 4:44 PM
To: user@mahout.apache.org
Subject: Re: Finding max/min distance
Since my list is fairly short (~2000 vectors) i sued the brute-force way
and did exactly that.
I was hoping mahout had something smarter, in case I'll have to handle much
larger lists.
*
*
*--*Raviv
On Wed, Jan 25, 2012 at 5:22 PM, Paritosh Ranjan <pr...@xebia.com> wrote:
> Do you want to find the pair of vectors which are "farthest" and "nearest"
> ?
> If yes, I think you will have to compare all pairs using
>
> double distance(Vector v1, Vector v2);
>
> of DistanceMeasure.
>
> I don't think Mahout has something in built for this.
> ________________________________________
> From: Raviv Pavel [raviv@gigya-inc.com]
> Sent: Wednesday, January 25, 2012 2:39 PM
> To: user@mahout.apache.org
> Subject: Finding max/min distance
>
> Given a list of vectors and a distance measure, what's the fastest way to
> find the maximum & minimum distances in the list ?
>
> Thanks.
> *--*Raviv
>
Re: Finding max/min distance
Posted by Raviv Pavel <ra...@gigya-inc.com>.
Since my list is fairly short (~2000 vectors) i sued the brute-force way
and did exactly that.
I was hoping mahout had something smarter, in case I'll have to handle much
larger lists.
*
*
*--*Raviv
On Wed, Jan 25, 2012 at 5:22 PM, Paritosh Ranjan <pr...@xebia.com> wrote:
> Do you want to find the pair of vectors which are "farthest" and "nearest"
> ?
> If yes, I think you will have to compare all pairs using
>
> double distance(Vector v1, Vector v2);
>
> of DistanceMeasure.
>
> I don't think Mahout has something in built for this.
> ________________________________________
> From: Raviv Pavel [raviv@gigya-inc.com]
> Sent: Wednesday, January 25, 2012 2:39 PM
> To: user@mahout.apache.org
> Subject: Finding max/min distance
>
> Given a list of vectors and a distance measure, what's the fastest way to
> find the maximum & minimum distances in the list ?
>
> Thanks.
> *--*Raviv
>
RE: Finding max/min distance
Posted by Paritosh Ranjan <pr...@xebia.com>.
Do you want to find the pair of vectors which are "farthest" and "nearest" ?
If yes, I think you will have to compare all pairs using
double distance(Vector v1, Vector v2);
of DistanceMeasure.
I don't think Mahout has something in built for this.
________________________________________
From: Raviv Pavel [raviv@gigya-inc.com]
Sent: Wednesday, January 25, 2012 2:39 PM
To: user@mahout.apache.org
Subject: Finding max/min distance
Given a list of vectors and a distance measure, what's the fastest way to
find the maximum & minimum distances in the list ?
Thanks.
*--*Raviv