You are viewing a plain text version of this content. The canonical link for it is here.

Posted to issues@spark.apache.org by "Burak KÖSE (JIRA)" <ji...@apache.org> on 2016/03/25 21:39:25 UTC

[jira] [Issue Comment Deleted] (SPARK-11666) Find the best `k` by cutting bisecting k-means cluster tree without recomputation

     [ https://issues.apache.org/jira/browse/SPARK-11666?page=com.atlassian.jira.plugin.system.issuetabpanels:all-tabpanel ]

Burak KÖSE updated SPARK-11666:
-------------------------------
    Comment: was deleted

(was: Hi, can you share links for references about that?)

> Find the best `k` by cutting bisecting k-means cluster tree without recomputation
> ---------------------------------------------------------------------------------
>
>                 Key: SPARK-11666
>                 URL: https://issues.apache.org/jira/browse/SPARK-11666
>             Project: Spark
>          Issue Type: Sub-task
>          Components: MLlib
>            Reporter: Yu Ishikawa
>            Priority: Minor
>
> For example, scikit-learn's hierarchical clustering support a feature to extract partial tree from the result. We should support a feature like that in order to reduce compute cost.



--
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