Searching for just a few words should be enough to get started. If you need to make more complex queries, use the tips below to guide you.
Issue title: Concurrency, Specification, and Programming: Special Issue of Selected Papers of CS&P 2017
Guest editors: Wojciech Penczek, Holger Schlingloff and Piotr Wasilewski
Article type: Research Article
Authors: Bazan, Jan G.a; * | Szczur, Adama | Skowron, Andrzejb; † | Rzepko, Marianc | Król, Pawełc | Bajorek, Wojciechc | Czarny, Wojciechc
Affiliations: [a] Interdisciplinary Centre for Computational Modelling, University of Rzeszów, Pigonia 1, 35-310 Rzeszów, Poland. [email protected], [email protected] | [b] Systems Research Institute, Polish Academy of Sciences, Newelska 6, 01-447 Warsaw, Poland. [email protected] | [c] Physical Education Faculty, University of Rzeszów, Towarnickiego 3, 35-959 Rzeszów, Poland. [email protected], [email protected], [email protected], [email protected]
Correspondence: [*] Address for correspondence: Interdisciplinary Centre for Computational Modelling, University of Rzeszów, Pigonia 1, 35-310 Rzeszów, Poland
Note: [†] Also affiliated at: Digital Science and Technology Centre of UKSW, Dewajtis 5, 01-815 Warsaw, Poland
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.
Keywords: rough sets, discretization, classifiers, temporal cuts, temporal data
DOI: 10.3233/FI-2019-1785
Journal: Fundamenta Informaticae, vol. 165, no. 3-4, pp. 263-281, 2019
IOS Press, Inc.
6751 Tepper Drive
Clifton, VA 20124
USA
Tel: +1 703 830 6300
Fax: +1 703 830 2300
[email protected]
For editorial issues, like the status of your submitted paper or proposals, write to [email protected]
IOS Press
Nieuwe Hemweg 6B
1013 BG Amsterdam
The Netherlands
Tel: +31 20 688 3355
Fax: +31 20 687 0091
[email protected]
For editorial issues, permissions, book requests, submissions and proceedings, contact the Amsterdam office [email protected]
Inspirees International (China Office)
Ciyunsi Beili 207(CapitaLand), Bld 1, 7-901
100025, Beijing
China
Free service line: 400 661 8717
Fax: +86 10 8446 7947
[email protected]
For editorial issues, like the status of your submitted paper or proposals, write to [email protected]
如果您在出版方面需要帮助或有任何建, 件至: [email protected]