GClasses
|
A transduction algorithm that uses a max-flow/min-cut graph-cut algorithm to partition the data until each class is in a separate cluster. Unlabeled points are then assigned the label of the cluster in which they fall. More...
#include <GCluster.h>
Public Member Functions | |
GGraphCutTransducer (GRand &rand) | |
virtual | ~GGraphCutTransducer () |
void | setNeighbors (size_t k) |
Sets the number of neighbors to use to form the graph. The default is 12. | |
size_t | neighbors () |
Returns the number of neighbors to which each point is connected. | |
void | autoTune (GMatrix &features, GMatrix &labels) |
Uses cross-validation to find a set of parameters that works well with the provided data. | |
Protected Member Functions | |
virtual GMatrix * | transduceInner (GMatrix &features1, GMatrix &labels1, GMatrix &features2) |
See the comment for GTransducer::transduce. Only supports one-dimensional labels. | |
virtual bool | canImplicitlyHandleContinuousLabels () |
See the comment for GTransducer::canImplicitlyHandleContinuousLabels. | |
Protected Attributes | |
size_t | m_neighborCount |
size_t * | m_pNeighbors |
double * | m_pDistances |
A transduction algorithm that uses a max-flow/min-cut graph-cut algorithm to partition the data until each class is in a separate cluster. Unlabeled points are then assigned the label of the cluster in which they fall.
GClasses::GGraphCutTransducer::GGraphCutTransducer | ( | GRand & | rand | ) |
virtual GClasses::GGraphCutTransducer::~GGraphCutTransducer | ( | ) | [virtual] |
Uses cross-validation to find a set of parameters that works well with the provided data.
virtual bool GClasses::GGraphCutTransducer::canImplicitlyHandleContinuousLabels | ( | ) | [inline, protected, virtual] |
See the comment for GTransducer::canImplicitlyHandleContinuousLabels.
Reimplemented from GClasses::GTransducer.
size_t GClasses::GGraphCutTransducer::neighbors | ( | ) | [inline] |
Returns the number of neighbors to which each point is connected.
void GClasses::GGraphCutTransducer::setNeighbors | ( | size_t | k | ) |
Sets the number of neighbors to use to form the graph. The default is 12.
virtual GMatrix* GClasses::GGraphCutTransducer::transduceInner | ( | GMatrix & | features1, |
GMatrix & | labels1, | ||
GMatrix & | features2 | ||
) | [protected, virtual] |
See the comment for GTransducer::transduce. Only supports one-dimensional labels.
Implements GClasses::GTransducer.
size_t GClasses::GGraphCutTransducer::m_neighborCount [protected] |
double* GClasses::GGraphCutTransducer::m_pDistances [protected] |
size_t* GClasses::GGraphCutTransducer::m_pNeighbors [protected] |