Universal Attribute Reduction Problem

Authors:
Mikhail Ju. Moshkov;Marcin Piliszczuk;Beata Zielosko
Affiliations:
Institute of Computer Science, University of Silesia, 39, Bedzińska St., Sosnowiec, 41-200, Poland;ING Bank Ślaski S.A., 34, Sokolska St., Katowice, 40-086, Poland;Institute of Computer Science, University of Silesia, 39, Bedzińska St., Sosnowiec, 41-200, Poland
Venue:
RSEISP '07 Proceedings of the international conference on Rough Sets and Intelligent Systems Paradigms
Year:
2007

Citing 16
Cited 2

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
Rules in incomplete information systems

Information Sciences: an International Journal
&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 Construction of Partial Reducts and Irreducible Partial Decision Rules

Fundamenta Informaticae - New Frontiers in Scientific Discovery - Commemorating the Life and Work of Zdzislaw Pawlak
Approximation algorithms for combinatorial problems

Journal of Computer and System Sciences
On partial covers, reducts and decision rules with weights

Transactions on rough sets VI
On partial covers, reducts and decision rules

Transactions on rough sets VIII
Approximate boolean reasoning: foundations and applications in data mining

Transactions on Rough Sets V

Universal Problem of Attribute Reduction

Transactions on Rough Sets IX
Upper bounds on minimum cardinality of exact and approximate reducts

RSCTC'10 Proceedings of the 7th international conference on Rough sets and current trends in computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

In the paper, some generalizations of the notions of reduct and test (superreduct) are considered. The accuracy of greedy algorithm for construction of partial test is investigated. A lower bound on the minimal cardinality of partial reducts based on an information on greedy algorithm work is studied. Results of an experiment with greedy algorithm are described.