My Project
|
Set of cluster comparisons. More...
#include <compare.h>
Public Member Functions | |
virtual double | operator() (vector< set< string > > *Cl1, vector< set< string > > *Cl2) |
Compare * | Produce (string s) |
void | setDist (string s) |
Compare () | |
Compare (int size) | |
int | getNodes (vector< set< string > > *Cl1, vector< set< string > > *Cl2) |
Public Attributes | |
double | graphSize |
dist * | d |
Set of cluster comparisons.
Classes to compare sets of clusters
Compare::Compare | ( | ) | [inline] |
Empty Constructor
Compare::Compare | ( | int | size | ) | [inline] |
Alternate Constructor
size | network size |
int Compare::getNodes | ( | vector< set< string > > * | Cl1, |
vector< set< string > > * | Cl2 | ||
) | [inline] |
Get the set of nodes in the union of the two sets of clusters
Cl1 | Cluster set 1 |
Cl2 | Cluster set 2 |
virtual double Compare::operator() | ( | vector< set< string > > * | Cl1, |
vector< set< string > > * | Cl2 | ||
) | [inline, virtual] |
Compute Comparison
Cl1 | Cluster set 1 |
Cl2 | Cluster set 2 |
d | Distance measure between two single clusters to use |
Reimplemented in NMI, FScore, Interaction, KCenter, and BestMatch.
Compare * Compare::Produce | ( | string | s | ) |
Factory function
s | Which comparison procedure to use |
Factory function for overall list similarity
s | Type of comparison class to produce |
void Compare::setDist | ( | string | s | ) | [inline] |
double Compare::graphSize |
Size of network in vertices