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 Weights | 50 |
Construction of All Irreducible Partial Covers All Partial Reducts and All Irreducible Partial Decision Rules | 97 |
Experiments with RealLife Decision Tables | 117 |
Universal Attribute Reduction Problem | 135 |
FinalRemarks | 143 |
References | 145 |
| 149 | |
طبعات أخرى - عرض جميع المقتطفات
عبارات ومصطلحات مألوفة
0.5-hypothesis 1-uniform a-cover a-decision a-test algorithm with equal algorithm with thresholds attributes f1 Bi₁ binary decision tables binary information systems classifiers based Cmin Cmin(a columns labeled conditional attributes decision attribute decision rule problem DIS(T equal thresholds exact cover exists fi₁ follows given set cover greedy algorithm chooses group of experiments inequality irreducible t-covers irreducible t-decision rules j-th labeled with attributes Lemma Let us consider Let us denote log2 log2 n log2n lymphography minimal cardinality minimal weight modification of greedy Moshkov natural number NP-hard number of tables obtain pairs partial decision rules partial reducts partial test polynomial algorithm polynomial approximate algorithms problem with weights Proposition real number reducts and decision Results of experiments rough set theory Rough Sets Sect set cover problem step number step the greedy subsets t-reducts Theorem tic-tac-toe tuple values weight function δε δο