@INCOLLECTION { Rsds4799,
author = {Moshkov, Mikhail}, 
title = {Decision Trees and Reducts for Distributed Decision Tables}, 
booktitle = {Monitoring. Security, and Rescue Techniques in Multiagent Systems}, 
series =  = {Advances in Soft Computing}, 
pages = {239--248}, 
publisher = {Springer-Verlag}, 
address = {Heidelberg - Berlin, Germany}, 
year = 2005, 
url = {http://www.springerlink.com/content/c540656w30l04112/?p=dc8a4af04a734f9c97016149510eb70e&pi=0}, 
isbn = {3-540-23245-1}, 
abstract = {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.}, 
keywords = {distributed decision tables, decision trees, relative reducts, greedy algorithms, }, 
}