Name
Abstract | ||
|---|---|---|
This article introduces a new method of a decision tree construction. Such construction is performed using additional cuts applied for a verification of the cuts' quality in tree nodes during the classification of objects. The presented approach allows us to exploit the additional knowledge represented in the attributes which could be eliminated using greedy methods. The paper includes the results of experiments performed on data sets from a biomedical database and machine learning repositories. In order to evaluate the presented method, we compared its performance with the classification results of a local discretization decision tree, well known from literature. Our new method outperforms the existing method, which is also confirmed by statistical tests. |
Year | DOI | Venue |
|---|---|---|
2016 | 10.3233/FI-2016-1300 | FUNDAMENTA INFORMATICAE |
Keywords | Field | DocType |
rough sets,discretization,concept approximation,classifiers | Data mining,Discretization,Decision tree,Data set,Computer science,Exploit,Rough set,Artificial intelligence,Classifier (linguistics),Machine learning,Statistical hypothesis testing,Incremental decision tree | Journal |
Volume | Issue | ISSN |
143 | 1-2 | 0169-2968 |
Citations | PageRank | References |
5 | 0.56 | 8 |
Authors | ||
6 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Jan G. Bazan | 1 | 172 | 12.28 |
| Stanislawa Bazan-Socha | 2 | 38 | 5.32 |
| Sylwia Buregwa-Czuma | 3 | 17 | 3.52 |
| Lukasz Dydo | 4 | 6 | 1.96 |
| Wojciech Rzasa | 5 | 94 | 13.42 |
| Andrzej Skowron | 6 | 5062 | 421.31 |