PrologMethods/Classification/hoeffding_tree.md

@@ -3,11 +3,11 @@
 An implementation of Hoeffding trees, a form of streaming decision tree for classification. Given labeled data, a Hoeffding tree can be used for predicting the classifications of new points.
 
 ```prolog
-:- use_module('path/to/.../src/methods/adaboost/adaboost.pl').
+:- use_module('path/to/.../src/methods/hoeffding_tree/hoeffding_tree.pl').
 
 %% usage example
-adaboost_initModelWithTraining([5.1,3.5,1.4, 4.9,3.0,1.4, 4.7,3.2,1.3, 4.6,3.1,1.5], 3, [0,0,1,0], 2, perceptron, 50, 0.0001),
-adaboost_classify([3,2,0, 5,1,4, 0,0,4, 3,3,5, 0,5,5, 2,5,5], 3, PredictionList, ProbabilitiesList, _).
+hoeffding_tree_initAndBuildModel(gini_hoeffding, [5.1,3.5,1.4, 4.9,3.0,1.4, 4.7,3.2,1.3, 4.6,3.1,1.5], 3, [0,1,0,1], 2, 0, 0.95, 5000, 100, 100, 10, 100),
+hoeffding_tree_classify([3,2,0, 5,1,4, 0,0,4, 3,3,5, 0,5,5, 2,5,5], 3, PredicList, ProbsList).
 ```
 
 # Available Predicates