Machine Learning, Clustering, Affinity Propagation, Python, Unsupervised Learning.
candidate exemplar k reflects the accumulated evidence for how well-suited point k is to serve as the exemplar for point n, taking into account other potential exemplars for n. It is stored in N x K or N x N matrix: R = [ρ(n, k)]. It can be interpreted as log probabilities and initialized to 0. For