Hi, Are there any plans to implement the "Top K Parallel FPGrowth" algorithm in Spark, that aggregates the frequent items together (similar to the mahout implementation).
Thanks John -- View this message in context: http://apache-spark-user-list.1001560.n3.nabble.com/Top-K-Parallel-FPGrowth-Implementation-tp25945.html Sent from the Apache Spark User List mailing list archive at Nabble.com. --------------------------------------------------------------------- To unsubscribe, e-mail: user-unsubscr...@spark.apache.org For additional commands, e-mail: user-h...@spark.apache.org