On partial covers, reducts and decision rules

Authors:
Mikhail Ju. Moshkov;Marcin Piliszczuk;Beata Zielosko
Affiliations:
Institute of Computer Science, University of Silesia, Sosnowiec, Poland;ING Bank Śląski S.A., Katowice, Poland;Institute of Computer Science, University of Silesia, Sosnowiec, Poland
Venue:
Transactions on rough sets VIII
Year:
2008

Citing 11
Cited 7

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
A sub-constant error-probability low-degree test, and a sub-constant error-probability PCP characterization of NP

STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
&agr;-RST: a generalization of rough set theory

Information Sciences—Informatics and Computer Science: An International Journal
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
Approximate entropy reducts

Fundamenta Informaticae
Approximation algorithms for set cover and related problems

Approximation algorithms for set cover and related problems
Normalized Decision Functions and Measures for Inconsistent Decision Tables Analysis

Fundamenta Informaticae
Ensembles of Classifiers Based on Approximate Reducts

Fundamenta Informaticae - Concurrency Specification and Programming (CS&P'2000)
On partial covers, reducts and decision rules with weights

Transactions on rough sets VI

Universal Attribute Reduction Problem

RSEISP '07 Proceedings of the international conference on Rough Sets and Intelligent Systems Paradigms
Universal Problem of Attribute Reduction

Transactions on Rough Sets IX
Greedy Algorithm for Construction of Partial Association Rules

Fundamenta Informaticae
On Construction of Partial Association Rules

RSKT '09 Proceedings of the 4th International Conference on Rough Sets and Knowledge Technology
Lower bounds on minimal weight of partial reducts and partial decision rules

RSKT'06 Proceedings of the First international conference on Rough Sets and Knowledge Technology
Greedy Algorithm for Construction of Partial Association Rules

Fundamenta Informaticae
Greedy Algorithm for Attribute Reduction

Fundamenta Informaticae - Concurrency Specification and Programming (CS&P)

Quantified Score

Hi-index	0.00

Visualization

Abstract

In the paper, the accuracy of greedy algorithms for construction of partial covers, reducts and decision rules is considered. Bounds on the minimal complexity of partial covers, reducts and decision rules based on an information about greedy algorithm work are studied. The results of experiments with greedy algorithms are described.