-
-
Notifications
You must be signed in to change notification settings - Fork 26k
[MRG+1] AffinityPropagation damping factor not explained #9335
New issue
Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.
By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.
Already on GitHub? Sign in to your account
Changes from all commits
File filter
Filter by extension
Conversations
Jump to
Diff view
Diff view
There are no files selected for viewing
Original file line number | Diff line number | Diff line change |
---|---|---|
|
@@ -301,7 +301,9 @@ is given. | |
Affinity Propagation can be interesting as it chooses the number of | ||
clusters based on the data provided. For this purpose, the two important | ||
parameters are the *preference*, which controls how many exemplars are | ||
used, and the *damping factor*. | ||
used, and the *damping factor* which damps the responsibility and | ||
availability messages to avoid numerical oscillations when updating these | ||
messages. | ||
|
||
The main drawback of Affinity Propagation is its complexity. The | ||
algorithm has a time complexity of the order :math:`O(N^2 T)`, where :math:`N` | ||
|
@@ -350,6 +352,13 @@ to be the exemplar of sample :math:`i` is given by: | |
|
||
To begin with, all values for :math:`r` and :math:`a` are set to zero, | ||
and the calculation of each iterates until convergence. | ||
As discussed above, in order to avoid numerical oscillations when updating the | ||
messages, the damping factor :math:`\lambda` is introduced to iteration process: | ||
|
||
.. math:: r_{t+1}(i, k) = \lambda\cdot r_{t}(i, k) + (1-\lambda)\cdot r_{t+1}(i, k) | ||
There was a problem hiding this comment. Choose a reason for hiding this commentThe reason will be displayed to describe this comment to others. Learn more. So to be sure, this means the previous value has to contribute at least half of the new value relative to the incoming message, but can contribute more. Yes? There was a problem hiding this comment. Choose a reason for hiding this commentThe reason will be displayed to describe this comment to others. Learn more. Not sure about that. Paper just mentions that damping factor should be between 0 and 1. But, according to scikit's API documentation, yes. |
||
.. math:: a_{t+1}(i, k) = \lambda\cdot a_{t}(i, k) + (1-\lambda)\cdot a_{t+1}(i, k) | ||
|
||
where :math:`t` indicates the iteration times. | ||
|
||
.. _mean_shift: | ||
|
||
|
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
can it be included in the equations below?
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
Added.