Talk:Affinity propagation

About this similarity function
I just read in the linked source Article (Brendan J. Frey; Delbert Dueck (2007). "Clustering by passing messages between data points"), that those equations are valid if the similarity function s is the negative square distance of two vectors. I went with the definition in the article and it ended up messing up my script. It is rather important to correct this. I am now only mentioning this for more experienced and confident wikipedions to take a look at.

Similarity example mismatch?
Where it says, "... that is s(x_i, x_j) > s(x_i, x_k) iff x_j is more similar to x_i than x_k", it seems like the expression is literally saying that x_i is more similar to x_j than x_k. The expression doesn't match the English description of the expression's meaning. Is there a mistake here? Ecashin (talk) 13:16, 25 September 2014 (UTC)


 * What is meant is: "$s(x_{i}, x_{j}) > s(x_{i}, x_{k})$ iff the similarity between $x_{i}$ and $x_{j}$ is greater than that between $x_{i}$ than $x_{k}$", but that seemed rather repetitive. Any suggestions on how to clarify this? Q VVERTYVS (hm?) 18:30, 25 September 2014 (UTC)


 * I just updated the subscripts to match the definition, now that you've confirmed my reading of the text. Thanks! Ecashin (talk) 14:33, 26 September 2014 (UTC)

Quality and importance
This article is clearly just a stub. Among other details, it needs to explain how one actually determines the clusters bases on $a(i,k)$. Being an algorithm that doesn't require specifying the number of clusters, it's worth having a more thorough article about it. I assigned therefore an importance of Mid level.


 * There's also no mention of the two important parameters for this algorithm, the preference and the damping factor. The preference parameter directly influences the number of clusters found by the algorithm. However I only have a intuitionally understanding of how the preference works but don't know how exactly it influences the messages or initialisation. — Preceding unsigned comment added by Kugelbrot (talk • contribs) 09:42, 25 August 2016 (UTC)

Adding a Reference to a Ruby Implementation of Affinity Propagation
Folks, I'm new here so pardon my ignorance. I had made a change to the Affinity Propagation page earlier and included a reference to a Ruby implementation of Affinity Propagation which I wrote. Melcous kindly explained to me the proper process specially to avoid conflict of interest. I'd like, therefore, to propose adding a reference to my Ruby implementation of the algorithm to the Software section. Something like:

* A Ruby implementation is available as the affinity_propagation gem.

While looking at the other Software listed on the page, too, I noticed that that reference to the Java Apro library is not a valid link any more and, to boot, is also not in the form of a reference. I'd like to propose we remove that from the Software section as well.

Not sure what the course of action is from here but please let me know! Thanks! --Sjaveed (talk) 00:32, 15 November 2017 (UTC)