The grouping of information for clustering follows a common pattern for all techniques. Basically, we have an initialization stage, followed by the iterative insertion of new elements, after which the new group relationships are updated. This process continues until the stop criteria is met, where the group characterization is finished. The following flow diagram illustrates this process:
General scheme for a clustering algorithm
After we get a clear sense of the overall process, let's start working with several cases where this scheme is applied, starting with K-means.
