X-Git-Url: https://www.fleuret.org/cgi-bin/gitweb/gitweb.cgi?a=blobdiff_plain;f=decision_tree.h;h=1601836e9e07f725976dfe7041d5fff8315bcd26;hb=71a84ea2658cd96726bcf4e582010c24bf2583cf;hp=59dba57c7b3e4a28c4d8c3540f60312547d32ff7;hpb=d922ad61d35e9a6996730bec24b16f8bf7bc426c;p=folded-ctf.git

diff --git a/decision_tree.h b/decision_tree.h
index 59dba57..1601836 100644
--- a/decision_tree.h
+++ b/decision_tree.h
@@ -12,10 +12,22 @@
 // You should have received a copy of the GNU General Public License     //
 // along with this program. If not, see <http://www.gnu.org/licenses/>.  //
 //                                                                       //
-// Written by Francois Fleuret, (C) IDIAP                                //
+// Written by Francois Fleuret                                           //
+// (C) Idiap Research Institute                                          //
+//                                                                       //
 // Contact <francois.fleuret@idiap.ch> for comments & bug reports        //
 ///////////////////////////////////////////////////////////////////////////
 
+/*
+
+  An implementation of the classifier with a decision tree. Each node
+  simply thresholds one of the component, and is chosen for maximum
+  loss reduction locally during training. The leaves are labelled with
+  the classifier response, which is chosen again for maximum loss
+  reduction.
+
+ */
+
 #ifndef DECISION_TREE_H
 #define DECISION_TREE_H