Abstract
Decision tree algorithms such as See5 (or C5) are typically used in data mining for classification and prediction purposes. In this study we propose EXPLORE, a novel decision tree algorithm, which is a modification of See5. The modifications are made to improve the capability of a tree in extracting hidden patterns. Justification of the proposed modifications is also presented. We experimentally compare EXPLORE with some existing algorithms such as See5, REPTree and J48 on several issues including quality of extracted rules/patterns, simplicity, and classification accuracy of the trees. Our initial experimental results indicate advantages of EXPLORE over existing algorithms.
Original language | English |
---|---|
Title of host publication | Data Security and Security Data |
Subtitle of host publication | Proceedings of the 27th British National Conference on Databases (BNCOD 27) |
Editors | Lachlan M. Mackinnon |
Place of Publication | Germany |
Publisher | Springer |
Pages | 55-71 |
Number of pages | 17 |
Volume | 6121 |
ISBN (Electronic) | 9783642257049 |
ISBN (Print) | 9783642257032 |
DOIs | |
Publication status | Published - 2012 |
Event | 27th British National Conference on Databases: BNCOD 27 - Dundee, UK, Dundee, United Kingdom Duration: 29 Jun 2010 → 01 Jul 2010 http://www.wikicfp.com/cfp/servlet/event.showcfp?eventid=7346©ownerid=2 |
Publication series
Name | |
---|---|
ISSN (Print) | 0302-9743 |
Conference
Conference | 27th British National Conference on Databases |
---|---|
Abbreviated title | Data Security and Security Data |
Country/Territory | United Kingdom |
City | Dundee |
Period | 29/06/10 → 01/07/10 |
Internet address |