In the paper greedy algorithms for construction of decision trees and relative reducts for joint decision table generated by distributed decision tables are studied. Two ways for definition of joint decision table are considered: based on the assumption that the universe of joint table is the intersection of universes of distributed tables, and based on the assumption that the universe of joint table is the union of universes of distributed tables. Furthermore, a case is considered when the information about distributed decision tables is given in the form of decision rule systems.© Springer-Verlag Berlin Heidelberg 2005.
Bibliographical noteGenerated from Scopus record by KAUST IRTS on 2023-09-21
ASJC Scopus subject areas
- Computational Mechanics
- Computer Science (miscellaneous)
- Computer Science Applications