Taxonomy of tree based classification algorithm

In this paper we are suggesting improvements over an existing C4.5 Algorithm. This is a very popular tree based classification algorithm, used to generate decision tree from a set of training examples. The heuristic function used in this algorithm is based on the concept of information entropy. We are proposing two new heuristic functions which are better than the one used by C4.5 Algorithm by some way or the other. First heuristic function is better in terms of execution time. Second heuristic function is more realistic, gives importance to realistic attributes and thus gives more accurate and reasonable results. So in this way we are proposing two new improvements over J48/C4.5 Algorithm. Throughout the paper we will be using two case studies (examples), one of weather and the other one of student classification for comparing the performance of algorithms.