Decision Trees and Reducts for Distributed Decision Tables
Conference paper
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.
Key words
distributed decision tables decision trees relative reducts greedy algorithmsPreview
Unable to display preview. Download preview PDF.
References
- 1.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 ComputingGoogle Scholar
- 2.Johnson D S (1974) J Comput System Sci 9:256–278MATHMathSciNetCrossRefGoogle Scholar
- 3.Moshkov M Ju (1982) Academy of Sciences Doklady 265:550–552 (in Russian); English translation: Sov Phys Dokl 27:528–530MATHGoogle Scholar
- 4.Moshkov M Ju (1983) Conditional tests. In: Yablonskii S V (ed) Problems of Cybernetics 40. Nauka Publishers, Moscow (in Russian)Google Scholar
- 5.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-VerlagGoogle Scholar
- 6.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)Google Scholar
- 7.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)Google Scholar
- 8.Pawlak Z (1991) Rough Sets — Theoretical Aspects of Reasoning about Data. Kluwer Academic Publishers, Dordrecht Boston LondonMATHGoogle Scholar
- 9.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 LondonGoogle Scholar
Copyright information
© Springer-Verlag Berlin Heidelberg 2005