You are viewing a plain text version of this content. The canonical link for it is here.
Posted to issues@spark.apache.org by "Tomislav Milinovic (JIRA)" <ji...@apache.org> on 2015/01/02 10:52:13 UTC
[jira] [Created] (SPARK-5056) Implementing Clara k-medoids
clustering algorithm for large datasets
Tomislav Milinovic created SPARK-5056:
-----------------------------------------
Summary: Implementing Clara k-medoids clustering algorithm for large datasets
Key: SPARK-5056
URL: https://issues.apache.org/jira/browse/SPARK-5056
Project: Spark
Issue Type: Improvement
Components: MLlib
Reporter: Tomislav Milinovic
Priority: Minor
There is a specific k-medoids clustering algorithm for large datasets. The algorithm is called Clara in R, and is fully described in chapter 3 of Finding Groups in Data: An Introduction to Cluster Analysis. by Kaufman, L and Rousseeuw, PJ (1990).
The algorithm considers sub-datasets of fixed size (sampsize) such that the time and storage requirements become linear in n rather than quadratic. Each sub-dataset is partitioned into k clusters using the same algorithm as in Partinioning around Medoids (PAM).
--
This message was sent by Atlassian JIRA
(v6.3.4#6332)
---------------------------------------------------------------------
To unsubscribe, e-mail: issues-unsubscribe@spark.apache.org
For additional commands, e-mail: issues-help@spark.apache.org