baseclearn - Base level Classification Algorithm

This program builds a classification model that will assign either the most frequent class label encountered, or a random class label (or rather, the first class label that happens to be listed in the "names" file for the database). This algorithm can be used to create the class label files and the necessary timing information needed for comparing more advanced learning algorithms with a reasonable "minimum" or "base-level" algorithm.


baseclearn {-t|-e} -f filestem -l N -m modelfile -p predictionfile -n N [-v] [-h]

  • -t: Run the training phase - a model file to be created must be specified with the -m flag.
  • -e: Run the evaluation phase - a model file to be used must be specified with the -m flag and a prediction file to be created with the -p flag.
  • -f filestem: The filestem (full path without the extension) of the database files: for training files named <filestem>.names and <filestem>.data will be used, for evaluation the files named <filestem>.names and <filestem>.test
  • -l N: N=1: use the first label encountered in the .names file. N=2: use the most frequent label encountered in the .data file (in case of a tie, the most frequen class which is encountered first in the names file is picked).
  • -m modelfile: The full path of the model file to be created or used.
  • -p predictionfile: The full path of the prediction file to be created.
  • -n N: The maximum number of cases to be read during the training phase. The value 0 means no limit.
  • -v: Show additional messages on standard error.
  • -h: Show usage info and exit.


Source code: baseclearn-src.tgz (~4K)


This software is distributed under the terms of the GNU General Public License.