Classification Trees & Weka Docs
Decision trees are used for all sorts of things in bioinformatics: predicting genetic regulatory response to different experiments in yeast, determining the extent of resistance to antiretroviral drugs in HIV patients and protein annotation, for example.
Adhanom's guide explains how decision trees work, how they are created and what the advantages of using them are.
Simplistically: imagine that you have a training set of data labeled either class A or B. A tree building algorithm will start off with a single node, representing the entire training set. It'll then decide on a "split" which produces two child nodes, each representing a subset of the training data. The goal of each split is to maximize the purity of the child nodes: a node is purest when it only contains one class. Each child node can have further splits, producing child nodes of child nodes... and so on and so forth. Eventually you end up with a tree like structure with a "root" node at the base representing your entire training set (a mix of As and Bs) and lots of pure leaf nodes at the top (some of which are all As and some of which are all Bs, ideally).
You can then feed a different, unlabeled dataset into that tree and by following the splits, classify each element of that dataset on the basis of which leaf node it ends up in.
One advantage of decision trees is that they can easily handle categorical as well as numerical variables. Another is that (depending on the algorithm you use and how many variables are involved) it can be a lot easier to interpret a tree than the workings of a "black box" neural network or an SVM.
Weka contains a number of different tree building algorithms. Another option linked to from the page above, though, is Shih Data Miner, which I hadn't heard of before: it seems to be quite well documented, and feedback is a bit more visual: maybe it would be a good place to start experimenting?
