30#ifndef ROOT_TMVA_BinarySearchTree
31#define ROOT_TMVA_BinarySearchTree
79 virtual const char*
ClassName()
const {
return "BinarySearchTree"; }
105 Double_t Fill(
const std::vector<TMVA::Event*>& events,
const std::vector<Int_t>& theVars,
Int_t theType = -1 );
148 void NormalizeTree( std::vector< std::pair< Double_t, const TMVA::Event* > >::iterator,
149 std::vector< std::pair< Double_t, const TMVA::Event* > >::iterator,
UInt_t );
153 std::vector<const TMVA::BinarySearchTreeNode*>* events );
#define ClassDef(name, id)
#define TMVA_VERSION_CODE
Node for the BinarySearch or Decision Trees.
A simple Binary search tree including a volume search method.
BinarySearchTreeNode * Search(Event *event) const
search the tree to find the node matching "event"
virtual BinaryTree * CreateTree() const
void SetNormalize(Bool_t norm)
Bool_t InVolume(const std::vector< Float_t > &, Volume *) const
test if the data points are in the given volume
std::vector< Float_t > fMax[2]
virtual ~BinarySearchTree(void)
destructor
Double_t Fill(const std::vector< TMVA::Event * > &events, const std::vector< Int_t > &theVars, Int_t theType=-1)
create the search tree from the event collection using ONLY the variables specified in "theVars"
void NormalizeTree()
Normalisation of tree.
std::vector< Double_t > fSumSq[2]
Float_t RMS(Types::ESBType sb, UInt_t var)
virtual const char * ClassName() const
Double_t GetSumOfWeights(void) const
return the sum of event (node) weights
virtual Node * CreateNode(UInt_t) const
std::vector< Float_t > fMeans[2]
static BinarySearchTree * CreateFromXML(void *node, UInt_t tmva_Version_Code=TMVA_VERSION_CODE)
re-create a new tree (decision tree or search tree) from XML
Float_t Min(Types::ESBType sb, UInt_t var)
UInt_t GetPeriode(void) const
std::vector< Double_t > fSum[2]
void Clear(TMVA::Node *n=0)
clear nodes
BinarySearchTree(void)
default constructor
Bool_t fStatisticsIsValid
void CalcStatistics(TMVA::Node *n=0)
calculate basic statistics (mean, rms for each variable)
Double_t SearchVolume(Volume *, std::vector< const TMVA::BinarySearchTreeNode * > *events=0)
search the whole tree and add up all weights of events that lie within the given volume
void Insert(const Event *)
insert a new "event" in the binary tree
std::vector< Float_t > fMin[2]
Int_t SearchVolumeWithMaxLimit(TMVA::Volume *, std::vector< const TMVA::BinarySearchTreeNode * > *events=0, Int_t=-1)
recursively walk through the daughter nodes and add up all weights of events that lie within the give...
std::vector< std::pair< Double_t, const TMVA::Event * > > fNormalizeTreeTable
void DestroyNode(BinarySearchTreeNode *)
std::vector< Float_t > fRMS[2]
Float_t Max(Types::ESBType sb, UInt_t var)
Float_t Mean(Types::ESBType sb, UInt_t var)
Base class for BinarySearch and Decision Trees.
Node for the BinarySearch or Decision Trees.
Volume for BinarySearchTree.
A TTree represents a columnar dataset.
create variable transformations