![Institutional Repository [SANDBOX]](images/dias.logo.png "Institutional Repository [SANDBOX]"){kind=logo}
Institutional Repository [SANDBOX]
Technical University of Crete
Technical University of Crete
EN
|
EL
| URI | http://purl.tuc.gr/dl/dias/04355E5F-CBEB-4FC0-A75C-59EF43C5C18F | - |
| Identifier | http://link.springer.com/article/10.1023%2FA%3A1022445500761 | - |
| Identifier | 10.1023/A:1022445500761 | - |
| Language | en | - |
| Extent | 28 pages | en |
| Title | Building decision trees with constraints | en |
| Creator | Garofalakis Minos | en |
| Creator | Γαροφαλακης Μινως | el |
| Creator | Hyun Dongjoon | en |
| Creator | Rastogi Rajeev | en |
| Creator | Shim Kyuseok | en |
| Publisher | Kluwer | en |
| Content Summary | Classification is an important problem in data mining. Given a database of records, each with a class label, a classifier generates a concise and meaningful description for each class that can be used to classify subsequent records. A number of popular classifiers construct decision trees to generate class models. Frequently, however, the constructed trees are complex with hundreds of nodes and thus difficult to comprehend, a fact that calls into question an often-cited benefit that decision trees are easy to interpret. In this paper, we address the problem of constructing “simple” decision trees with few nodes that are easy for humans to interpret. By permitting users to specify constraints on tree size or accuracy, and then building the “best” tree that satisfies the constraints, we ensure that the final tree is both easy to understand and has good accuracy. We develop novel branch-and-bound algorithms for pushing the constraints into the building phase of classifiers, and pruning early tree nodes that cannot possibly satisfy the constraints. Our experimental results with real-life and synthetic data sets demonstrate that significant performance speedups and reductions in the number of nodes expanded can be achieved as a result of incorporating knowledge of the constraints into the building step as opposed to applying the constraints after the entire tree is built. | en |
| Type of Item | Peer-Reviewed Journal Publication | en |
| Type of Item | Δημοσίευση σε Περιοδικό με Κριτές | el |
| License | http://creativecommons.org/licenses/by/4.0/ | en |
| Date of Item | 2015-10-29 | - |
| Date of Publication | 2003 | - |
| Subject | Algorithmic knowledge discovery | en |
| Subject | Factual data analysis | en |
| Subject | KDD (Information retrieval) | en |
| Subject | Knowledge discovery in data | en |
| Subject | Knowledge discovery in databases | en |
| Subject | Mining, Data | en |
| Subject | data mining | en |
| Subject | algorithmic knowledge discovery | en |
| Subject | factual data analysis | en |
| Subject | kdd information retrieval | en |
| Subject | knowledge discovery in data | en |
| Subject | knowledge discovery in databases | en |
| Subject | mining data | en |
| Subject | Classification | en |
| Subject | Decision tree | en |
| Subject | Branch-and-bound algorithm | en |
| Subject | Constraint | en |
| Bibliographic Citation | M. Garofalakis, D. Hyun, R. Rastogi and K. Shim, "Building decision trees with constraints", Data Min. Knowl. Disc., vol 7, no. 2, pp. 187-214, Apr. 2003. doi:10.1023/A:1022445500761 | en |
Copyright © DIAS 2013
