CluE  1.0
 All Classes Namespaces Files Functions Variables Typedefs Enumerations Enumerator Macros Groups Pages
birchconfig.h
Go to the documentation of this file.
1 #ifndef BIRCHCONFIG_H
2 #define BIRCHCONFIG_H
3 
4 #include "../base/algorithm.h"
5 #include "../clustering/cfentry.h"
6 
7 namespace CluE
8 {
9 
16 template<typename T> struct BirchConfig
17 {
23  virtual Algorithm* phase3(std::vector<CFEntry<T>*> const * input) const = 0;
24 
30  virtual Algorithm* phase4(std::vector<T*> const * input) const = 0;
31 
35  virtual double calcNewThreshold(double oldThreshold) const = 0;
36 
41 
46 
51 
56 
61 
65  double threshold;
66 
70  int maxSize;
71 };
72 
73 }
74 
75 #endif
BIRCH configuration class.
Definition: birchconfig.h:16
virtual Algorithm * phase3(std::vector< CFEntry< T > * > const *input) const =0
Returns a ready-to-compute Algorithm object of the phase 3 algorithm.
int innerBranching
Maximum number of siblings of inner nodes.
Definition: birchconfig.h:55
Abstract base class for attribute calculation (e.g. diameter).
AttributeCalculator< CFEntry< T > > * thresholdAttribute
Cluster size (e.g. diameter) calculator.
Definition: birchconfig.h:50
EuclideanSpaceProvider< T > * euclidianProvider
Euclidean space provider.
Definition: birchconfig.h:40
DissimilarityMeasure< CFEntry< T > > * clusterDistanceMeasure
Cluster distance (e.g. average inter-cluster distance) calculator.
Definition: birchconfig.h:45
virtual double calcNewThreshold(double oldThreshold) const =0
Returns the new threshold for rebuilding the clustering feature tree.
virtual Algorithm * phase4(std::vector< T * > const *input) const =0
Returns a ready-to-compute Algorithm object of the phase 4 algorithm.
Abstract base class for algorithms.
Definition: algorithm.h:17
int maxSize
Maximum number of nodes.
Definition: birchconfig.h:70
Abstract base class for dissimilarity measurement.
Clustering feature tree entry.
Definition: cfentry.h:22
int leafBranching
Maximum number of siblings of leaf nodes.
Definition: birchconfig.h:60