spark-issues mailing list archives

Site index · List index
Message view « Date » · « Thread »
Top « Date » · « Thread »
From "Joseph K. Bradley (JIRA)" <>
Subject [jira] [Commented] (SPARK-6137) G-Means clustering algorithm implementation
Date Tue, 03 Mar 2015 17:56:05 GMT


Joseph K. Bradley commented on SPARK-6137:

There is a method for splitting clusters in StreamingKMeans.  It isn't really documented,
but it's visible in the code: [].
 Do you know how that method relates to GMeans?  

> G-Means clustering algorithm implementation
> -------------------------------------------
>                 Key: SPARK-6137
>                 URL:
>             Project: Spark
>          Issue Type: New Feature
>          Components: MLlib
>            Reporter: Denis Dus
>            Priority: Minor
> Will it be useful to implement G-Means clustering algorithm based on K-Means?
> G-means is a powerful extension of k-means, which uses test of cluster data normality
to decide if it necessary to split current cluster into new two. It's relative complexity
(compared to k-Means) is O(K), where K is maximum number of clusters. 
> The original paper is by Greg Hamerly and Charles Elkan from University of California:
> []
> I also have a small prototype of this algorithm written in R (if anyone is interested
in it).

This message was sent by Atlassian JIRA

To unsubscribe, e-mail:
For additional commands, e-mail:

View raw message