This diploma thesis presents description on several algorithms for decision trees induction and software RapidMiner. The first part of the thesis deals with partition and terminology of decision trees. There’re described all algorithms for decision tree construction in RapidMiner. The second part deals with implementation and comparison of chosen algorithms. The application was developed in C++. Based on the real datesets the comparisson of different algorithms was realized using Rapid Miner 4.0.

The ADtree, a data structure useful for caching sufficient statistics, has been successfully adapted to grow lazily when memory is limited and to update sequentially with an incrementally updated dataset. However, even these modified forms of the ADtree still exhibit inefficiencies in terms of both space usage and query time, particularly on datasets with very high dimensionality and with high arity features. We propose five modifications to the ADtree, each of which can be used to improve size and query time under specific types of datasets and features. These modifications also provide an increased ability to precisely control how an ADtree is built and to tune its size given external memory or speed requirements.