/* ======================================================================== *\ ! ! * ! * This file is part of MARS, the MAGIC Analysis and Reconstruction ! * Software. It is distributed to you in the hope that it can be a useful ! * and timesaving tool in analysing Data of imaging Cerenkov telescopes. ! * It is distributed WITHOUT ANY WARRANTY. ! * ! * Permission to use, copy, modify and distribute this software and its ! * documentation for any purpose is hereby granted without fee, ! * provided that the above copyright notice appear in all copies and ! * that both that copyright notice and this permission notice appear ! * in supporting documentation. It is provided "as is" without express ! * or implied warranty. ! * ! ! ! Author(s): Thomas Hengstebeck 3/2003 ! ! Copyright: MAGIC Software Development, 2000-2003 ! ! \* ======================================================================== */ ///////////////////////////////////////////////////////////////////////////// // // MRanForestCalc // // Calculates the hadroness of an event. It calculates a mean value of all // classifications by the trees in a previously grown random forest. // // To use only n trees for your calculation use: // MRanForestCalc::SetUseNumTrees(n); // //////////////////////////////////////////////////////////////////////////// #include "MRanForestCalc.h" #include "MHMatrix.h" // must be before MLogManip.h #include "MDataArray.h" #include "MLog.h" #include "MLogManip.h" #include "MParList.h" #include "MRanTree.h" #include "MRanForest.h" #include "MHadronness.h" ClassImp(MRanForestCalc); static const TString gsDefName = "MRanForestCalc"; static const TString gsDefTitle = "Tree Classification Loop 1/2"; // -------------------------------------------------------------------------- // // Setup histograms and the number of distances which are used for // avaraging in CalcDist // MRanForestCalc::MRanForestCalc(const char *name, const char *title) : fNum(100), fData(NULL) { // // set the name and title of this object // fName = name ? name : gsDefName.Data(); fTitle = title ? title : gsDefTitle.Data(); } // -------------------------------------------------------------------------- // // Delete the data chains // MRanForestCalc::~MRanForestCalc() { // delete fData; } // -------------------------------------------------------------------------- // // Needs: // - MatrixGammas [MHMatrix] // - MatrixHadrons {MHMatrix] // - MHadronness // - all data containers used to build the matrixes // // The matrix object can be filles using MFillH. And must be of the same // number of columns (with the same meaning). // Bool_t MRanForestCalc::PreProcess(MParList *plist) { fRanForest = (MRanForest*)plist->FindObject("MRanForest"); if (!fRanForest) { *fLog << err << dbginf << "MRanForest not found... aborting." << endl; return kFALSE; } fRanTree = (MRanTree*)plist->FindObject("MRanTree"); if (!fRanTree) { *fLog << err << dbginf << "MRanTree not found... aborting." << endl; return kFALSE; } /*if(!fRanForest->GetCurTree()) { *fLog << err << dbginf << "MRanForest does not contain trees... aborting." << endl; return kFALSE; }*/ fData = fRanTree->GetRules(); if (!fData) { *fLog << err << dbginf << "Error matrix doesn't contain columns... aborting." << endl; return kFALSE; } if (!fData->PreProcess(plist)) { *fLog << err << dbginf << "PreProcessing of the MDataArray failed for the columns failed... aborting." << endl; return kFALSE; } fHadroness = (MHadronness*)plist->FindCreateObj("MHadronness"); if (!fHadroness) return kFALSE; return kTRUE; } // -------------------------------------------------------------------------- // // Bool_t MRanForestCalc::Process() { const Double_t ncols = fData->GetNumEntries(); TVector event(ncols); for (int i=0; iGetNumEntries(); i++) event(i) = (*fData)(i); Double_t hadroness=fRanForest->CalcHadroness(event); fHadroness->SetHadronness(hadroness); return kTRUE; }