ROOT 6.08/07 Reference Guide |
#include <iostream>
#include <algorithm>
#include <vector>
#include <limits>
#include <fstream>
#include <cassert>
#include "TRandom3.h"
#include "TMath.h"
#include "TMatrix.h"
#include "TMVA/MsgLogger.h"
#include "TMVA/DecisionTree.h"
#include "TMVA/DecisionTreeNode.h"
#include "TMVA/BinarySearchTree.h"
#include "TMVA/Tools.h"
#include "TMVA/GiniIndex.h"
#include "TMVA/CrossEntropy.h"
#include "TMVA/MisClassificationError.h"
#include "TMVA/SdivSqrtSplusB.h"
#include "TMVA/Event.h"
#include "TMVA/BDTEventWrapper.h"
#include "TMVA/IPruneTool.h"
#include "TMVA/CostComplexityPruneTool.h"
#include "TMVA/ExpectedErrorPruneTool.h"
Functions | |
bool | almost_equal_double (double x, double y, int ulp=4) |
bool | almost_equal_float (float x, float y, int ulp=4) |
default constructor using the GiniIndex as separation criterion, no restrictions on minium number of events in a leave note or the separation gain in the node splitting More... | |
bool almost_equal_double | ( | double | x, |
double | y, | ||
int | ulp = 4 |
||
) |
Definition at line 106 of file DecisionTree.cxx.
bool almost_equal_float | ( | float | x, |
float | y, | ||
int | ulp = 4 |
||
) |
default constructor using the GiniIndex as separation criterion, no restrictions on minium number of events in a leave note or the separation gain in the node splitting
Definition at line 98 of file DecisionTree.cxx.