mahout-user mailing list archives

Site index · List index
Message view « Date » · « Thread »
Top « Date » · « Thread »
From Ted Dunning <ted.dunn...@gmail.com>
Subject Re: Question about distributed density based clustering algorithm
Date Sun, 20 Mar 2011 16:39:04 GMT
Take a look at the Dirichlet process clustering in Mahout.  I think it is
very close to what you want.

On Sat, Mar 19, 2011 at 10:59 PM, Bae, Jae Hyeon <metacret@gmail.com> wrote:

> Hi
>
> I am considering to publish the implementation of density based clustering
> algorithm using MapReduce.
>
> If you have seen a similar implementation or publication, could you let me
> know in detail?
>
> I can find several papers regarding distributed density based clustering
> algorithm but all of these were handling 3-D data like astronomical data.
> With low dimensional data, we can use spatial index such as R* tree or
> KD-tree, but my goal is implementation for very high dimensional data, text
> document without dimensional reduction.
>
> Actually, density based clustering have several limits to implement using
> MapReduce. The goal is overcoming its defects efficiently to the best.
>
> I appreciate so much if you give any kinds of comments.
>
> Best, Jay
>

Mime
  • Unnamed multipart/alternative (inline, None, 0 bytes)
View raw message