// As part of learning, we also prune some of the nodes where the ratio of correctly-classified pairs to those incorrectly classified is comparable.
// The significant advantage of not pruning is that the result is no longer sensitive to the order of elements in the tree and hence does not depend on the order in which elements have been obtained by concurrent threads.
//final weka.classifiers.lazy.IB1 ib1 = new weka.classifiers.lazy.IB1();
//final weka.classifiers.trees.J48 classifier = new weka.classifiers.trees.J48();
final Classifier classifier = repTree;
classifier.buildClassifier(dataCollector.trainingData);
System.out.println("Entries in the classifier: "+dataCollector.trainingData.numInstances());
System.out.println(classifier);
dataCollector=null;// throw all the training data away.
{// serialise the classifier, this is the only way to store it.