Decision tree construction for genetic applications based on association rules

A decision tree is an effective means of data classification from which rules can be both expressive and precise. However decision tree is only applicable in the applications that the data is expressed with attribute-value pairs. Since genetic data are not attribute-pairs, the only method that we know of to make decision-tree for them is based on a greedy graph-based data mining algorithm known as DT-GBI. Due to its greedy nature, some of the important rules may be missed. Even though recently some attempts to make the algorithm complete has been presented, the computational complexity of algorithm increased so much that is not appropriate for practical purposes. In this paper we present an approach to make decision tree for DNA based data, which basically uses regular association-rule algorithms. Thus it has computational complexity which is much more tractable. Our contribution in this paper is to convert DNA based problems to regular data mining methods and by this conversion we present a method that can be applied to all classes of classification based on association rules.