-
Notifications
You must be signed in to change notification settings - Fork 29k
[SPARK-6518][MLlib][Example][DOC] Add example code and user guide for bisecting k-means #9952
New issue
Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.
By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.
Already on GitHub? Sign in to your account
Changes from 6 commits
7c8005d
86f6085
24d0ac6
25c0a60
ea6c285
2f4c2a5
7c36c1d
5a360e9
3066696
File filter
Filter by extension
Conversations
Jump to
Diff view
Diff view
There are no files selected for viewing
| Original file line number | Diff line number | Diff line change |
|---|---|---|
|
|
@@ -718,6 +718,34 @@ sameModel = LDAModel.load(sc, "myModelPath") | |
|
|
||
| </div> | ||
|
|
||
| ## Bisecting k-means | ||
|
|
||
| Bisecting k-means is a kind of [hierarchical clustering](https://en.wikipedia.org/wiki/Hierarchical_clustering). | ||
| Hierarchical clustering is one of the most commonly used method of cluster analysis which seeks to build a hierarchy of clusters. | ||
| Strategies for hierarchical clustering generally fall into two types: | ||
|
|
||
| - Agglomerative: This is a "bottom up" approach: each observation starts in its own cluster, and pairs of clusters are merged as one moves up the hierarchy. | ||
| - Divisive: This is a "top down" approach: all observations start in one cluster, and splits are performed recursively as one moves down the hierarchy. | ||
|
|
||
| Bisecting k-means algorithm is a kind of divisive algorithms. | ||
| Because it is too difficult to implement a agglomerative algorithm as a distributed algorithm on Spark. | ||
|
Member
There was a problem hiding this comment. Choose a reason for hiding this commentThe reason will be displayed to describe this comment to others. Learn more. Remove this line please; it may not always be the case. |
||
| The implementation in MLlib has the following parameters: | ||
|
|
||
| * *k* the desired number of leaf clusters (default: 4). The actual number could be smaller if there are no divisible leaf clusters. | ||
|
Member
There was a problem hiding this comment. Choose a reason for hiding this commentThe reason will be displayed to describe this comment to others. Learn more. put colon between parameter name and the description |
||
| * *maxIterations* the max number of k-means iterations to split clusters (default: 20) | ||
| * *minDivisibleClusterSize* the minimum number of points (if >= 1.0) or the minimum proportion of points (if < 1.0) of a divisible cluster (default: 1) | ||
| * *seed* a random seed (default: hash value of the class name) | ||
|
|
||
| **Examples** | ||
|
|
||
| <div class="codetabs"> | ||
| <div data-lang="scala" markdown="1"> | ||
| Refer to the [`BisectingKMeans` Scala docs](api/scala/index.html#org.apache.spark.mllib.clustering.BisectingKMeans) and [`BisectingKMeansModel` Scala docs](api/scala/index.html#org.apache.spark.mllib.clustering.BisectingKMeansModel) for details on the API. | ||
|
|
||
| {% include_example scala/org/apache/spark/examples/mllib/BisectingKMeansExample.scala %} | ||
| </div> | ||
| </div> | ||
|
|
||
| ## Streaming k-means | ||
|
|
||
| When data arrive in a stream, we may want to estimate clusters dynamically, | ||
|
|
||
| Original file line number | Diff line number | Diff line change |
|---|---|---|
| @@ -0,0 +1,58 @@ | ||
| /* | ||
| * Licensed to the Apache Software Foundation (ASF) under one or more | ||
| * contributor license agreements. See the NOTICE file distributed with | ||
| * this work for additional information regarding copyright ownership. | ||
| * The ASF licenses this file to You under the Apache License, Version 2.0 | ||
| * (the "License"); you may not use this file except in compliance with | ||
| * the License. You may obtain a copy of the License at | ||
| * | ||
| * http://www.apache.org/licenses/LICENSE-2.0 | ||
| * | ||
| * Unless required by applicable law or agreed to in writing, software | ||
| * distributed under the License is distributed on an "AS IS" BASIS, | ||
| * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. | ||
| * See the License for the specific language governing permissions and | ||
| * limitations under the License. | ||
| */ | ||
|
|
||
| package org.apache.spark.examples.mllib | ||
|
|
||
| // scalastyle:off println | ||
| import org.apache.spark.mllib.clustering.BisectingKMeans | ||
|
Member
There was a problem hiding this comment. Choose a reason for hiding this commentThe reason will be displayed to describe this comment to others. Learn more. Can you please use example on/off here too to include the relevant imports? You can exclude SparkConf, SparkContext. |
||
| import org.apache.spark.mllib.linalg.{Vector, Vectors} | ||
| import org.apache.spark.{SparkConf, SparkContext} | ||
|
|
||
| /** | ||
| * An example demonstrating a bisecting k-means clustering in spark.mllib. | ||
| * | ||
| * Run with | ||
| * {{{ | ||
| * bin/run-example mllib.BisectingKMeansExample | ||
| * }}} | ||
| */ | ||
| object BisectingKMeansExample { | ||
|
|
||
| def main(args: Array[String]) { | ||
| val sparkConf = new SparkConf().setAppName("mllib.BisectingKMeansExample") | ||
| val sc = new SparkContext(sparkConf) | ||
|
|
||
| // $example on$ | ||
| // Loads and parses data | ||
| def parse(line: String): Vector = Vectors.dense(line.split(" ").map(_.toDouble)) | ||
| val data = sc.textFile("data/mllib/kmeans_data.txt").map(parse).cache() | ||
|
|
||
| // Clustering the data into 6 clusters by BisectingKMeans. | ||
| val bkm = new BisectingKMeans().setK(6) | ||
| val model = bkm.run(data) | ||
|
|
||
| // Show the compute cost and the cluster centers | ||
| println(s"Compute Cost: ${model.computeCost(data)}") | ||
| model.clusterCenters.zipWithIndex.foreach { case (center, idx) => | ||
| println(s"Cluster Center ${idx}: ${center}") | ||
| } | ||
| // $example off$ | ||
|
|
||
| sc.stop() | ||
| } | ||
| } | ||
| // scalastyle:on println | ||
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
Before this line (which is getting into details), it would be good to give a high-level description of the use of bisecting k-means. E.g., "Bisecting K-means can often be much faster than regular K-means, but it will generally produce a different clustering."