A threshold of ln n for approximating set cover (preliminary version)
STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
A tight analysis of the greedy algorithm for set cover
STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Rough Sets: Theoretical Aspects of Reasoning about Data
Rough Sets: Theoretical Aspects of Reasoning about Data
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
Approximation algorithms for set cover and related problems
Approximation algorithms for set cover and related problems
Approximation algorithms for combinatorial problems
Journal of Computer and System Sciences
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
On partial covers, reducts and decision rules
Transactions on rough sets VIII
Fundamenta Informaticae
Ensembles of Classifiers Based on Approximate Reducts
Fundamenta Informaticae - Concurrency Specification and Programming (CS&P'2000)
Normalized Decision Functions and Measures for Inconsistent Decision Tables Analysis
Fundamenta Informaticae
| Hi-index | 0.00 |
In the paper the accuracy of greedy algorithmfor construction of partial tests (superreducts) and partial decision rules is considered. Results of experiments with greedy algorithm are described.