Summary
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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Feige U (1996) A threshold of ln n for approximating set cover (Preliminary version). In: Proceedings of 28th Annual ACM Symposium on the Theory of Computing
Johnson D S (1974) J Comput System Sci 9:256–278
Moshkov M Ju (1982) Academy of Sciences Doklady 265:550–552 (in Russian); English translation: Sov Phys Dokl 27:528–530
Moshkov M Ju (1983) Conditional tests. In: Yablonskii S V (ed) Problems of Cybernetics 40. Nauka Publishers, Moscow (in Russian)
Moshkov M Ju (1997) Algorithms for constructing of decision trees. In: Proceedings of the First European Symposium Principles of Data Mining and Knowledge Discovery, LNCS 1263, Springer-Verlag
Moshkov M Ju (2001) On transformation of decision rule systems into decision trees. In: Proceedings of the Seventh International Workshop Discrete Mathematics and its Applications 1 (in Russian)
Nigmatullin R G (1969) Method of steepest descent in problems on cover. In: Memoirs of Symposium Problems of Precision and Efficiency of Computing Algorithms 5 (in Russian)
Pawlak Z (1991) Rough Sets — Theoretical Aspects of Reasoning about Data. Kluwer Academic Publishers, Dordrecht Boston London
Skowron A, Rauszer C (1992) The discernibility matrices and functions in information systems. In: Slowinski R (ed) Intelligent Decision Support. Handbook of Applications and Advances of the Rough Set Theory. Kluwer Academic Publishers, Dordrecht Boston London
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Moshkov, M.J. (2005). Decision Trees and Reducts for Distributed Decision Tables. In: Monitoring, Security, and Rescue Techniques in Multiagent Systems. Advances in Soft Computing, vol 28. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-32370-8_17
Download citation
DOI: https://doi.org/10.1007/3-540-32370-8_17
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-23245-2
Online ISBN: 978-3-540-32370-9
eBook Packages: EngineeringEngineering (R0)