Partial Covers, Reducts and Decision Rules in Rough Sets: Theory and ApplicationsSpringer Science & Business Media, 12/02/2009 - 152 من الصفحات This book covers the theoretical and experimental study of partial reducts and partial decision rules on the basis of the study of partial covers. It details the results of numerous experiments with randomly generated and real-life decision tables. |
ما يقوله الناس - كتابة مراجعة
لم نعثر على أي مراجعات في الأماكن المعتادة.
المحتوى
Introduction | 1 |
Partial Covers Reducts and Decision Rules | 7 |
Partial Covers Reducts and Decision Rules with | 50 |
Construction of All Irreducible Partial Covers All Partial | 97 |
Experiments with RealLife Decision Tables | 117 |
Universal Attribute Reduction Problem | 135 |
Final Remarks | 143 |
149 | |
طبعات أخرى - عرض جميع المقتطفات
عبارات ومصطلحات مألوفة
a-cover a-test algorithm with equal algorithm with thresholds apply arbitrary assume assumptions average binary information systems called Cgreedy(a clear Cmin(a columns labeled conditional attributes constructed contains corresponding decision attribute decision tables depending different elements equal equal thresholds exact example exists find first follows fraction greedy algorithm greedy algorithm chooses group of experiments holds i-th inequality intersection labeled with attributes least Lemma length less Let us consider Let us denote log2 lower bound maximal means minimal cardinality minimal weight natural number Note number of tables objects obtain pairs parameter partial covers partial decision rules partial reducts partial test polynomial algorithm polynomial approximate algorithms problem with weights Proof Proposition prove randomly real number relatively Results of experiments Rough Sets Sect separates set cover problem statement subsets t-decision Theorem upper bound weight function