Note: this page autoupdates while a run is in progress
(see end of log file)
8m31s
37M
DocumentClassification
Log file
===== MAIN: learn based on training data =====
=== START program1: ./run learn ../dataset2/train
rm: cannot remove `task.*': No such file or directory
Copyright 2001 AT&T. All rights reserved.
***tu*** bad class name
=== END program1: ./run learn ../dataset2/train --- FAILED [569s]
Run specification
supervised-learning: Main entry for supervised learning for training and testing a program on a dataset.
(learner:Program) boostexter-bigram: Adaboost on single-level deicision trees / tokenizer+stemmer+2gram bag-of-words, AT&T's closed-source implementation. See http://www.cs.princeton.edu/~schapire/boostexter.html for details.
(dataset:Dataset) wordlists-language: Wordlists from a vocabulary training program. The documents are lists of words and short sentences, in five languages: nl,en,fr,de,es. The users entered the words and labeled the language of each list. (Some lists have the wrong label.)
(stripper:Program[Strip]) document-classification-utils: Inspects DocumentClassification datasets and evaluates DocumentClassification performance.
(evaluator:Program[Evaluate]) document-classification-utils: Inspects DocumentClassification datasets and evaluates DocumentClassification performance.
When you generate a run, you can set a time limit for the run (no more than 24 hours). After that point, we will terminate the program.
Your program can use 1.5GB of memory. More information here.
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.
Must be logged in to post comments.