Changeset 8203 for trunk/MagicSoft/Mars/mranforest/MRanForest.cc

Timestamp:

11/02/06 09:00:59 (18 years ago)

Author:

tbretz

Message:

*** empty log message ***

File:

• trunk/MagicSoft/Mars/mranforest/MRanForest.cc (modified) (5 diffs)

trunk/MagicSoft/Mars/mranforest/MRanForest.cc

@@ -1 +1 @@
 /* ======================================================================== *\
+! $Name: not supported by cvs2svn $:$Id: MRanForest.cc,v 1.26 2006-11-02 08:57:00 tbretz Exp $
+! --------------------------------------------------------------------------
 !
 ! *
@@ -17 +19 @@
 !
 !   Author(s): Thomas Hengstebeck 3/2003 <mailto:hengsteb@physik.hu-berlin.de>
+!   Author(s): Thomas Bretz <mailto:tbretz@astro.uni-wuerzburg.de>
 !
-!   Copyright: MAGIC Software Development, 2000-2005
+!   Copyright: MAGIC Software Development, 2000-2006
 !
 !
@@ -498 +501 @@
     // error-estimates from out-of-bag data (oob data):
     //
-    // For a single tree the events not(!) contained in the bootstrap sample of
-    // this tree can be used to obtain estimates for the classification error of
-    // this tree.
-    // If you take a certain event, it is contained in the oob-data of 1/3 of
-    // the trees (see comment to ModifyData). This means that the classification error
-    // determined from oob-data is underestimated, but can still be taken as upper limit.
-
+    // For a single tree the events not(!) contained in the bootstrap
+    // sample of this tree can be used to obtain estimates for the
+    // classification error of this tree.
+    // If you take a certain event, it is contained in the oob-data of
+    // 1/3 of the trees (see comment to ModifyData). This means that the
+    // classification error determined from oob-data is underestimated,
+    // but can still be taken as upper limit.
     Int_t ninbag = 0;
     for (Int_t ievt=0;ievt<numdata;ievt++)
@@ -584 +587 @@
         TMath::Sort(numdata,v.GetArray(),isort.GetArray(),kFALSE);
 
-        // this sorts the v[n] in ascending order. isort[n] is the event number
-        // of that v[n], which is the n-th from the lowest (assume the original
-        // event numbers are 0,1,...).
+        // this sorts the v[n] in ascending order. isort[n] is the
+        // event number of that v[n], which is the n-th from the
+        // lowest (assume the original event numbers are 0,1,...).
 
         // control sorting
@@ -608 +611 @@
             const Int_t n2=isort[n+1];
 
-            // FIXME: Copying isort[n] to fDataSort[mvar*numdata] can be accelerated!
+            // FIXME: Copying isort[n] to fDataSort[mvar*numdata]
+            // can be accelerated!
             fDataSort[mvar*numdata+n]=n1;
             if(n==0) fDataRang[mvar*numdata+n1]=0;