On partial tests and partial reducts for decision tables

Authors:
Mikhail Ju. Moshkov;Marcin Piliszczuk
Affiliations:
Institute of Computer Science, University of Silesia, Sosnowiec, Poland;Institute of Computer Science, University of Silesia, Sosnowiec, Poland
Venue:
RSFDGrC'05 Proceedings of the 10th international conference on Rough Sets, Fuzzy Sets, Data Mining, and Granular Computing - Volume Part I
Year:
2005

Citing 4
Cited 2

A tight analysis of the greedy algorithm for set cover

STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of 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
Approximate entropy reducts

Fundamenta Informaticae
Normalized Decision Functions and Measures for Inconsistent Decision Tables Analysis

Fundamenta Informaticae

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
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

Quantified Score

Hi-index	0.00

Visualization

Abstract

In the paper a greedy algorithm for construction of partial tests is considered. Bounds on minimal cardinality of partial reducts are obtained. Results of experiments with software implementation of the greedy algorithm are described.