There isn't a clever way to find the medoid in Mahout. Finding the n nearest elements can be done using a Searcher. The Brute implementation should suffice.
On Thu, Dec 6, 2012 at 10:16 AM, Stefan Kreuzer <stefankreuze...@aol.de>wrote: > Hello, > > when inspecting a cluster of sparse vectors, what is the right way to > get > a) the medoid > b) the n nearest elements to the medoid? > > Regards, > Stefan >
