KMedoidsOnTheFly.hh File Reference

Clustering algorithm used in multistage_rosetta_scripts. More...

#include <protocols/multistage_rosetta_scripts/cluster/ClusterMetric.hh>
#include <utility/vector1.hh>
#include <core/types.hh>

Namespaces
	protocols
	The instance of Loops contained by AbrelaxApplication should be replaced by a LoopsOP.
	protocols::multistage_rosetta_scripts
	protocols::multistage_rosetta_scripts::cluster

Functions
void	protocols::multistage_rosetta_scripts::cluster::k_medoids_on_the_fly (utility::vector1< ClusterMetricCOP > const &points, unsigned short int const num_medoids, utility::vector1< bool > &best_medoids)
	Finds "num_medoids" number of clusters from within the "points" vector. If a point becomes the center of a cluster, it's index in "medoid_positions" is set to true. False otherwise. medoid_positions.size() will equal points.size() More...
utility::vector1< bool >	protocols::multistage_rosetta_scripts::cluster::k_medoids_on_the_fly (utility::vector1< ClusterMetricCOP > const &points, unsigned short int const num_medoids)
	This overload provides you with the vector of results. It is mildly more convenient but mildly less efficient. Differences are mild all around. More...

Detailed Description

Clustering algorithm used in multistage_rosetta_scripts.

This algorithm is stochastic but usually pretty good at finding good clusters quickly. The methods in this file do not precalculate any distances. Instead, all distances are measured "on the fly". In practice, this does not appear to be a measurable slowdown.

Author

Jack Maguire, jackm.nosp@m.agui.nosp@m.re144.nosp@m.4@gm.nosp@m.ail.c.nosp@m.om