Note: this page autoupdates while a run is in progress
(see end of log file)
Note: ./weka/classifiers/functions/MultilayerPerceptron.java uses unchecked or unsafe operations.
Note: Recompile with -Xlint:unchecked for details.
===== MAIN: learn based on training data =====
=== START program1: ./run learn ../dataset2/train
Worker killed run: Current time usage 5h0m exceeds allowed 5h0m
supervised-learning: Main entry for supervised learning for training and testing a program on a dataset.
(learner:Program) MultilayerPerceptron_weka_nominal: This programs is part of the WEKA classifier library. The code used to generate this program is from the java class 'weka/classifiers/functions/MultilayerPerceptron.java' from WEKA's libraries.
The following description was taken from this classes JavaDoc information:
A Classifier that uses backpropagation to classify instances.
This network can be built by hand, created by an algorithm or both. The network can also be monitored and modified during training time. The nodes in this network are all sigmoid (except for when the class is numeric in which case the the output nodes become unthresholded linear units).
NOTE: This algorithm has no parameter tuning, it is using the default WEKA parameters
NOTE: WEKA's Classifiers read a data in the .arff format. For Multiclass datasets, the SVMlight format converted to .arff multiclass format so they can be read by WEKA programs
Go to the page for the run and look at the log file for signs of the responsible error.
You can also download the run and run it locally on your machine (a README file should
be included in the download which provides more information).
We said that a run was simply a program/dataset pair, but that's not the full story.
A run actually includes other helper programs such as the evaluation program and
various programs for reductions (e.g., one-versus-all, hyperparameter tuning).
More formally, a run is a given by a run specification,
which can be found on the page for any run.
A run specification is a tree where each internal node represents a program
and its children represents the arguments to be passed into its constructor.
For example, the one-versus-all program takes your binary classification program
as a constructor argument and behaves like a multiclass classification program.