[
https://issues.apache.org/jira/browse/SPARK-11666?page=com.atlassian.jira.plugin.system.issuetabpanels:all-tabpanel
]
Sean Owen updated SPARK-11666:
------------------------------
Fix Version/s: (was: 1.6.0)
> 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-unsubscr...@spark.apache.org
For additional commands, e-mail: issues-h...@spark.apache.org
