| http://www.w3.org/ns/prov#value | - Our algorithm is a variation of the furthest-point-first (FPF) algorithm for k-center clustering =-=[5]-=- which attempts to minimize the radius of the widest cluster over all possible groupings into k clusters (k-clusterings) of a set of n documents in a metric space.
|
