This tutorial describes how to use the Waikato Environment for Knowledge Analysis-WEKA. WEKA is a software workbench that provides a consistent graphical user interface to a variety of machine learning algorithms, and facilities of displaying and evaluating the output of those algorithms.
These are some important points you should know:
The WEKA main screen contains the following information:

It also includes menus for selecting machine learning schemes, datasets, activating data and result viewers, generation of dataset summary information and a link to the WEKA WWW home page.
Here is an example which gets you to run a machine learning algorithm on a simple dataset. The "golf" dataset contains four features that describe the weather and a class that says whether or not golf was played. You are to use the C4.5 scheme to induce a decision tree to build a model describing the decisions to play golf.
In this example you will be working with the dataset:
golf.arff
Sometimes it is better to have a rule set than a decision tree. C4.5 allows you to generate a rule set from a decision tree. Use the dataset:
iris.arff
When you come to configuring the C4.5 parameters make sure that the "Rules" check box is checked. You can leave the "Tree" check box checked if you want.
C4.5 generates rules that are evaluated in a top-down fashion and also allows a confusion matrix to be generated.
Sometimes you wish to generate a rule set from some data, and then evaluate how well those rules do on some other data. The first dataset is called the training set and the second dataset the test set.
There are other schemes in WEKA and here two other than C4.5 will be discussed. FOIL is a first-order inductive learner. It generates rules. 1R only generates one simple rule, i.e. the most informative rule.
Most schemes don't have a built-in evaluators to run test data through. However WEKA has a program called "Preval" (PROLOG Rule EVALuator) that will take a rule set in PROLOG and run a test set again it. If you check the "External Evaluation" option in a scheme's configuration dialog, then the rules will be automatically translated into PROLOG and "Preval" invoked.
Run the labor negotiations data from section 6 through C4.5, FOIL, and other schemes with external evaluation turned on.
Run Netscape and look at the WEKA/Machine Learning home page:
http://www.cs.waikato.ac.nz/~ml