111 Log() << kFATAL <<
"<PDEFoamDiscriminantDensity::Density()> Binary tree not set!" <<
Endl;
114 std::vector<Double_t> lb(
GetBox().size());
115 std::vector<Double_t> ub(
GetBox().size());
122 lb[idim] = xev[idim] -
GetBox().at(idim) / 2.0;
123 ub[idim] = xev[idim] +
GetBox().at(idim) / 2.0;
127 std::vector<const TMVA::BinarySearchTreeNode*> nodes;
133 event_density = nodes.size() * probevolume_inv;
137 for (std::vector<const TMVA::BinarySearchTreeNode*>::const_iterator it = nodes.begin();
138 it != nodes.end(); ++it) {
139 if ((*it)->GetClass() ==
fClass)
140 n_sig += (*it)->GetWeight();
144 return (n_sig / (sumOfWeights + 0.1)) * probevolume_inv;
MsgLogger & Endl(MsgLogger &ml)
const std::vector< Double_t > & GetBox() const
void box(Int_t pat, Double_t x1, Double_t y1, Double_t x2, Double_t y2)
Volume for BinarySearchTree.
MsgLogger & Log() const
message logger
Double_t GetBoxVolume()
Returns the volume of range searching box fBox.
PDEFoamDiscriminantDensity()
Abstract ClassifierFactory template that handles arbitrary types.
virtual Double_t Density(std::vector< Double_t > &Xarg, Double_t &event_density)
This function is needed during the foam buildup.
This is an abstract class, which provides an interface for a PDEFoam density estimator.
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 ...
This is a concrete implementation of PDEFoam.