A threshold of ln n for approximating set cover
Journal of the ACM (JACM)
Rough Sets: Theoretical Aspects of Reasoning about Data
Rough Sets: Theoretical Aspects of Reasoning about Data
Fast Algorithms for Mining Association Rules in Large Databases
VLDB '94 Proceedings of the 20th International Conference on Very Large Data Bases
On Algorithm for Constructing of Decision Trees with Minimal Number of Nodes
RSCTC '00 Revised Papers from the Second International Conference on Rough Sets and Current Trends in Computing
Approximate Reducts and Association Rules - Correspondence and Complexity Results
RSFDGrC '99 Proceedings of the 7th International Workshop on New Directions in Rough Sets, Data Mining, and Granular-Soft Computing
Classification Rule Discovery with Ant Colony Optimization
IAT '03 Proceedings of the IEEE/WIC International Conference on Intelligent Agent Technology
Semantics-Preserving Dimensionality Reduction: Rough and Fuzzy-Rough-Based Approaches
IEEE Transactions on Knowledge and Data Engineering
Partial Covers, Reducts and Decision Rules in Rough Sets: Theory and Applications
Partial Covers, Reducts and Decision Rules in Rough Sets: Theory and Applications
An evolutionary memetic algorithm for rule extraction
Expert Systems with Applications: An International Journal
Attribute selection with fuzzy decision reducts
Information Sciences: an International Journal
Hierarchical decision rules mining
Expert Systems with Applications: An International Journal
Order based genetic algorithms for the search of approximate entropy reducts
RSFDGrC'03 Proceedings of the 9th international conference on Rough sets, fuzzy sets, data mining, and granular computing
ENDER: a statistical framework for boosting decision rules
Data Mining and Knowledge Discovery
On algorithm for building of optimal α-decision trees
RSCTC'10 Proceedings of the 7th international conference on Rough sets and current trends in computing
Sequential covering rule induction algorithm for variable consistency rough set approaches
Information Sciences: an International Journal
Online learning algorithm for ensemble of decision rules
RSFDGrC'11 Proceedings of the 13th international conference on Rough sets, fuzzy sets, data mining and granular computing
Decision rule-based data models using TRS and NetTRS – methods and algorithms
Transactions on Rough Sets XI
Approximate boolean reasoning: foundations and applications in data mining
Transactions on Rough Sets V
Paper: Modeling by shortest data description
Automatica (Journal of IFAC)
Ensembles of Classifiers Based on Approximate Reducts
Fundamenta Informaticae - Concurrency Specification and Programming (CS&P'2000)
On Algorithm for Constructing of Decision Trees with Minimal Depth
Fundamenta Informaticae
Normalized Decision Functions and Measures for Inconsistent Decision Tables Analysis
Fundamenta Informaticae
Optimization of inhibitory decision rules relative to length and coverage
RSKT'12 Proceedings of the 7th international conference on Rough Sets and Knowledge Technology
Dynamic Programming Approach for Partial Decision Rule Optimization
Fundamenta Informaticae - Concurrency Specification and Programming (CS&P)
Optimization of β-decision rules relative to number of misclassifications
ICCCI'12 Proceedings of the 4th international conference on Computational Collective Intelligence: technologies and applications - Volume Part II
KES'12 Proceedings of the 16th international conference on Knowledge Engineering, Machine Learning and Lattice Computing with Applications
An interpretable classification rule mining algorithm
Information Sciences: an International Journal
Classifiers Based on Optimal Decision Rules
Fundamenta Informaticae - To Andrzej Skowron on His 70th Birthday
Relationships Between Length and Coverage of Decision Rules
Fundamenta Informaticae - Dedicated to the Memory of Professor Manfred Kudlek
Hi-index | 0.07 |
This paper is devoted to the study of an extension of dynamic programming approach which allows sequential optimization of approximate decision rules relative to the length and coverage. We introduce an uncertainty measure R(T) which is the number of unordered pairs of rows with different decisions in the decision table T. For a nonnegative real number @b, we consider @b-decision rules that localize rows in subtables of T with uncertainty at most @b. Our algorithm constructs a directed acyclic graph @D"@b(T) which nodes are subtables of the decision table T given by systems of equations of the kind ''attribute=value''. This algorithm finishes the partitioning of a subtable when its uncertainty is at most @b. The graph @D"@b(T) allows us to describe the whole set of so-called irredundant @b-decision rules. We can describe all irredundant @b-decision rules with minimum length, and after that among these rules describe all rules with maximum coverage. We can also change the order of optimization. The consideration of irredundant rules only does not change the results of optimization. This paper contains also results of experiments with decision tables from UCI Machine Learning Repository.