Hello, May you tell me how you applied the MapReduce on Bisecting K-Means? I know how the classical BKM works, but how did you parallelize the processing? All leaf nodes are divided at same time? If no, How? If yes, how do you handle the last nodes? Dividing every leaf node by iteration, you always have 2^it nodes. How do you do if k = 7?
Thank you -- View this message in context: http://apache-spark-user-list.1001560.n3.nabble.com/Prototype-Implementation-of-Hierarchical-Clustering-on-Spark-tp24467p27833.html Sent from the Apache Spark User List mailing list archive at Nabble.com. --------------------------------------------------------------------- To unsubscribe e-mail: user-unsubscr...@spark.apache.org
