You are viewing a plain text version of this content. The canonical link for it is here.
Posted to dev@hama.apache.org by "Renil J (JIRA)" <ji...@apache.org> on 2013/04/09 21:08:17 UTC
[jira] [Comment Edited] (HAMA-594) Implementation of a
Semi-Clustering algorithm, described in Pregel paper.
[ https://issues.apache.org/jira/browse/HAMA-594?page=com.atlassian.jira.plugin.system.issuetabpanels:comment-tabpanel&focusedCommentId=13626961#comment-13626961 ]
Renil J edited comment on HAMA-594 at 4/9/13 7:07 PM:
------------------------------------------------------
Hi ,
I am also interested in working on this issue as a part of Google Summer of Code 2013.
Can I join the team.
Thanks
was (Author: renil.joseph):
Hi ,
I am also interested in working on this issue as a part of Google Summer of Code 2013.
Can you share more details about the same.
Thanks
> Implementation of a Semi-Clustering algorithm, described in Pregel paper.
> -------------------------------------------------------------------------
>
> Key: HAMA-594
> URL: https://issues.apache.org/jira/browse/HAMA-594
> Project: Hama
> Issue Type: New Feature
> Components: examples, graph
> Reporter: Edward J. Yoon
> Labels: gsoc, gsoc2013, mentor
>
> {quote}
> 5.4 Semi-Clustering
> Pregel has been used for several different versions of clus-tering. One version, semi-clustering, arises in social graphs. Vertices in a social graph typically represent people, and edges represent connections between them.
> ....
> {quote}
> This issue implements Semi-Clustering algorithm, described in Pregel paper, using Hama graph APIs.
--
This message is automatically generated by JIRA.
If you think it was sent incorrectly, please contact your JIRA administrators
For more information on JIRA, see: http://www.atlassian.com/software/jira