libcrn
3.9.5
A document image processing library
|
Gets the element with the lower distance to other elements in the cluster. More...
#include <CRNkMedoids.h>
Public Member Functions | |
void | operator() (std::vector< size_t > &medoids, const std::vector< std::multimap< double, size_t >> &clusters, const std::vector< std::vector< double >> &distmat) const |
Gets the element with the lower distance to other elements in the cluster.
Park H-S, Jun C-H, A simple and fast algorithm for K-medoids clustering, ESA #36-2-2, 2009
Definition at line 72 of file CRNkMedoids.h.
void update::Local::operator() | ( | std::vector< size_t > & | medoids, |
const std::vector< std::multimap< double, size_t >> & | clusters, | ||
const std::vector< std::vector< double >> & | distmat | ||
) | const |
Definition at line 98 of file CRNkMedoids.cpp.