// 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