Using J48 algorithm in the present work
A standard tree induced with c5.0 (or possibly ID3 or c4.5) consists
of a number of branches, one root, a number of nodes and a
number of leaves. One branch is a chain of nodes from root to a
leaf; and each node involves one attribute. The occurrence of an
attribute in a tree provides the information about the importance
of the associated attribute as explained by Peng, Flach, Brazdil,
and Soares (2002). A decision tree is a tree-based knowledge representation
methodology used to represent classification rules.
J48 algorithm (A WEKA implementation of c4.5 Algorithm) is a
widely used one to construct decision trees as explained by
Sugumaran et al. (2007).