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 (CS&P)
Guest editors: Ludwik Czaja, Wojciech Penczek and Krzysztof Stencel
Article type: Research Article
Authors: Bazan, Jan G.a; * | Bazan-Socha, Stanislawab | Buregwa-Czuma, Sylwiac | Dydo, Lukaszd | Rzasa, Wojcieche | Skowron, Andrzejf
Affiliations: [a] Interdisciplinary Centre for Computational Modelling, University of Rzeszów, Pigonia 1, 35-310 Rzeszów, Poland. [email protected] | [b] II Department of Internal Medicine, Jagiellonian University Medical College, Skawinska 8, 31-066 Krakow, Poland. [email protected] | [c] Interdisciplinary Centre for Computational Modelling, University of Rzeszów, Pigonia 1, 35-310 Rzeszów, Poland. [email protected] | [d] Interdisciplinary Centre for Computational Modelling, University of Rzeszów, Pigonia 1, 35-310 Rzeszów, Poland. [email protected] | [e] Interdisciplinary Centre for Computational Modelling, University of Rzeszów, Pigonia 1, 35-310 Rzeszów, Poland. [email protected] | [f] Institute of Mathematics, University of Warsaw, Banacha 2, 02-097 Warsaw, Poland, and Systems Research Institute, Polish Academy of Sciences, Newelska 6, 01�447 Warsaw, Poland. [email protected]
Correspondence: [*] Address for correspondence: Interdisciplinary Centre for Computational Modelling, University of Rzeszów, Pigonia 1, 35-310 Rzeszów, Poland
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.
Keywords: rough sets, discretization, concept approximation, classifiers
DOI: 10.3233/FI-2016-1300
Journal: Fundamenta Informaticae, vol. 143, no. 1-2, pp. 1-18, 2016
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]