The Prague Texture Segmentation Datagenerator and Benchmark - Algorithms
optimized
for

The concise description of algorithms contains hyperlinks to further information (author, algorithms details, BIB entry, WWW external page).
The algorithm features are: f1 = classification (supervised segmentation), f2 = hiearchy result (manual selection), f3 = known number of regions, f4 = [reserved].
labanjak's
Affinity Propagation
version 1.1.0
SRC
f1: 0
f2: 0
f3: 0
f4: 0
Jakub Labant, Andrej Kudinov, Dausheyev Jorj-Mukhammed:   Clustering by passing messages between data points

List of uploaded results for 'Affinity Propagation' algorithm
   benchmark label version CS OS US ME NE O C CA CO CC I II EA MS RM CI GCE LCE BCE GBCE BGM SC SSC VD L AVI NVI NMI M ARI JC DC FMI WI WII NBDE
Colour [large] Affinity Propagation 1.1.0 0.00 95.00 95.00 100.00 100.00 96.52 95.95 2.98 3.52 4.36 96.48 95.39 3.69 -44.36 95.72 3.81 96.51 96.01 97.35 96.84 3.52 2.97 2.98 96.26 3.71 95.44 96.99 2.67 96.16 2.36 2.38 3.23 3.23 3.31 3.15 95.72