Description: Simple and effective means of clustering any data for which a similarity matrix can be constructed. Does not require similarity matrix meet the standards for a metric. The algorithm applies in cases where the similarity matrix is not symmetric (the distance from point i to j can be different from j to i). And it does not require triangular equalities (e.g. the hypoteneus can be less than the sum of the other sides)
File list (Check if you may need any files):
affinity_propagation
....................\affprop.m
....................\affprop_demo.m
....................\affprop_plot.m
Download