1. A New decision Tree Induction Using Composite Splitting Criterion
- Author
-
Kiran Kumar Reddi, Mrithyumjaya Rao Kuppa, and Ali Mirza Mahmood
- Subjects
Decision trees ,Gain Ratio ,Composite Splitting Criterion ,Hill Climbing ,Mathematics ,QA1-939 ,Electronic computers. Computer science ,QA75.5-76.95 - Abstract
C4.5 algorithm is the most widely used algorithm in the decision trees so far and obviously the most popular heuristic function is gain ratio. This heuristic function has a serious disadvantage – towards dealing with irrelevant featured data sources. The hill climbing is a machine learning technique used in searching. It has good searching mechanism. Considering the relationship between hill climbing and greedy searching, it can be used as the heuristic function of decision tree, in order to overcome the disadvantage of gain ratio.This paper proposes a composite splitting criterion equal to a greedy hill climbing approach and gain ratio. The experimental results shown that the proposed new heuristic function can Scale up accuracy, especially when processing high dimension datasets.
- Published
- 2010