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.
CITATION STYLE
Moshkov, M. J. (2005). Decision trees and reducts for distributed decision tables. In Advances in Soft Computing (Vol. 28, pp. 239–248). Springer Verlag. https://doi.org/10.1007/3-540-32370-8_17
Mendeley helps you to discover research relevant for your work.