concept overlapping in category algorithms

appears as: overlapping
Algorithms and Data Structures in Action

This is an excerpt from Manning's book Algorithms and Data Structures in Action.

#4 For each node, get its closest entry to targetNode. By default, closest can be meant as “with minimal Euclidean distance”.

Let’s start with canopy clustering as the initialization step for k-means: listing 13.3 summarizes a possible implementation for the MR job performing this task. At a first glance, we don’t need to do anything else than what we have shown in the previous section: we just return the output of the reducer, the list of centroids.