[SPARK-11666] Find the best `k` by cutting bisecting k-means cluster tree without recomputation

• Type: Sub-task
• Status: Resolved
• Priority: Minor
• Resolution: Incomplete
• Component/s: MLlib
• Labels: bulk-closed
• Assignee: Unassigned
• Reporter: Yu Ishikawa
• Created: 11/Nov/15 19:59
• Updated: 21/May/19 04:33
• Resolved: 21/May/19 04:33

Description

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.