Name
Abstract | ||
|---|---|---|
A new method of decision tree construction from temporal data is proposed in the paper. This method uses the so-called temporal cuts for binary partition of data in tree nodes. The novelty of the proposed approach is that the quality of cuts is calculated not on the basis of the discernibility of objects (related to time points), but on the basis of the discernibility of time windows labeled with different decision classes. The paper includes results of experiments performed on our data sets and collections from machine learning repositories. In order to evaluate the presented method, we compared its performance with the classification results of a local discretization decision tree, and other methods well known from literature. Our new method outperforms these known methods. |
Year | DOI | Venue |
|---|---|---|
2019 | 10.3233/FI-2019-1785 | FUNDAMENTA INFORMATICAE |
Keywords | Field | DocType |
rough sets,discretization,classifiers,temporal cuts,temporal data | Decision tree,Discrete mathematics,Artificial intelligence,Classifier (linguistics),Mathematics,Machine learning | Journal |
Volume | Issue | ISSN |
165 | 3-4 | 0169-2968 |
Citations | PageRank | References |
1 | 0.36 | 0 |
Authors | ||
7 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Jan G. Bazan | 1 | 291 | 22.71 |
| Adam Szczur | 2 | 1 | 0.69 |
| Andrzej Skowron | 3 | 5062 | 421.31 |
| Marian Rzepko | 4 | 1 | 0.36 |
| Pawel Król | 5 | 1 | 0.36 |
| Wojciech Bajorek | 6 | 1 | 0.36 |
| Wojciech Czarny | 7 | 1 | 0.36 |