mahout-user mailing list archives

Site index · List index
Message view « Date » · « Thread »
Top « Date » · « Thread »
From Paritosh Ranjan <pran...@xebia.com>
Subject RE: Finding max/min distance
Date Wed, 25 Jan 2012 16:11:36 GMT
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 <pranjan@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
>

Mime
View raw message