2014-09-21

Affinity Propagation，可以翻译为近邻传播

http://www.psi.toronto.edu/index.php?q=affinity%20propagation提供了相关的论文、数据集、源代码。

Algorithm description: The messages sent between points belong to one of two categories. The first is the responsibility $r(i, k)$, which is the accumulated evidence that sample k should be the exemplar for sample i. The second is the availability $a(i, k)$ which is the accumulated evidence that sample $i$ should choose sample $k$ to be its exemplar, and considers the values for all other samples that $k$ should be an exemplar. In this way, exemplars are chosen by samples if they are (1) similar enough to many samples and (2) chosen by many samples to be representative of themselves.

More formally, the responsibility of a sample $k$ to be the exemplar of sample $i$ is given by:

$r(i, k) \gets s(i,k) - max_{k’ \neq k}[a(i+k’) + s(i+k’)]$

Where $s(i, k)$ is the similarity between samples $i$ and $k$. The availability of sample $k$ to be the exemplar of sample $i$ is given by:

$a(i, k) \gets min[0, r(k,k)+\sum_{i’ \neq i, i’ \neq k} r(i’, k)]$

To begin with, all values for $r$ and $a$ are set to zero, and the calculation of each iterates until convergence.

Affinity Propagation (AP) identifies cluster centers, or exemplars, from the graph, which in some sense are a representative member of the cluster. Initially, all nodes are considered as exemplars, though each node is manually assigned a “preference” that it should be chosen as an exemplar. If no prior knowledge is available on which nodes should be favored as exemplars, then all nodes can be assigned the same preference value – where the magnitude can be used to control cluster granularity. For each node i and each candidate exemplar k, AP computes the “responsibility” $r(i, k)$, which indicates how well suited $k$ is as an exemplar for i, and the “availability” $a(i, k)$ reflecting the evidence that $i$ should choose $k$ as an exemplar.

$r(i, k) \gets s(i,k) - max_{k’ \neq k}[a(i+k’) + s(i+k’)]$

$a(i, k) \gets min[0, r(k,k)+\sum_{i’ \neq i, i’ \neq k} r(i’, k)]$

Where the matrix $s(i, k)$ denotes the similarity (eg. edge weight) between the two nodes $i$ and $k$, and the diagonal of this matrix contains the preferences for each node. The above two equations are iterated until a good set of exemplars emerges. Each node $i$ can then be assigned to the exemplar $k$ which maximizes the sum $a(i, k) + r(i, k)$, and if $i = k$, then $i$ is an exemplar. A damping factor between 0 and 1 is used to control for numerical oscillations.

$a(k,k) \gets \sum_{i’ \neq k} max(0, r(i’, k))$

( 完 )