Abstract
Decision tree algorithms such as See5 (or C5) are typicallyused in data mining for classi¯cation and prediction purposes. In thisstudy we propose EXPLORE, a novel decision tree algorithm, which is amodi¯cation of See5. The modi¯cations are made to improve the capabilityof a tree in extracting hidden patterns. Justi¯cation of the proposedmodi¯cations is also presented. We experimentally compare EXPLOREwith some existing algorithms such as See5, REPTree and J48 on severalissues including quality of extracted rules/patterns, simplicity, and classi¯cation accuracy of the trees. Our initial experimental results indicateadvantages of EXPLORE over existing algorithms.
Original language | English |
---|---|
Pages (from-to) | 55-71 |
Number of pages | 17 |
Journal | Lecture Notes in Computer Science |
Volume | 6121 |
DOIs | |
Publication status | Published - 2012 |