Hi alaa,
In the KMeans example, in each iteration the new centers is computed in a
map-reduce pattern. Each task maintains a part of points and it first choose
the new center for each point, and then the new center of the sum(point) and
num(point) is computed in the CentroidAccumulator, an
Hallo
I have used this k means code on Flink
https://github.com/apache/flink/blob/master/flink-examples/flink-examples-batch/src/main/java/org/apache/flink/examples/java/clustering/KMeans.java
and I would to add noise that follows Laplace distribution to the sum of
data item and to the number
