43 fDeltaPruneStrength(0),
45 fLogger( new
MsgLogger(
"ExpectedErrorPruneTool") )
65 Log() <<
kWARNING <<
"Sorry autmoatic pruning strength determination is not implemented yet" <<
Endl;
67 if( dt ==
NULL || (IsAutomatic() && validationSample ==
NULL) ) {
76 Log() <<
kFATAL <<
"Sorry autmoatic pruning strength determination is not implemented yet" <<
Endl;
147 return new PruningInfo( -1.0, fPruneStrength, fPruneSequence );
159 this->FindListOfNodes(l);
160 this->FindListOfNodes(r);
161 if (this->GetSubTreeError(node) >= this->GetNodeError(node)) {
163 fPruneSequence.push_back(node);
184 return this->GetNodeError(node);
210 errorRate =
std::min(1.0,(1.0 - (f-fPruneStrength*df)));
static Vc_ALWAYS_INLINE int_v min(const int_v &x, const int_v &y)
MsgLogger & Endl(MsgLogger &ml)
Double_t GetNodePurityLimit() const
virtual DecisionTreeNode * GetRight() const
Int_t GetNodeType(void) const
virtual DecisionTreeNode * GetLeft() const
virtual DecisionTreeNode * GetRoot() const
Float_t GetPurity(void) const
Float_t GetNEvents(void) const
Bool_t IsTerminal() const
Double_t Sqrt(Double_t x)