On Covering Attribute Sets by Reducts

Authors:
Mikhail Ju. Moshkov;Andrzej Skowron;Zbigniew Suraj
Affiliations:
Institute of Computer Science, University of Silesia, Bedzińska 39, 41-200 Sosnowiec, Poland;Institute of Mathematics, Warsaw University, Banacha 2, 02-097 Warsaw, Poland;Chair of Computer Science, University of Rzeszów, Rejtana 16A, 35-310 Rzeszów, Poland
Venue:
RSEISP '07 Proceedings of the international conference on Rough Sets and Intelligent Systems Paradigms
Year:
2007

Citing 3
Cited 4

Rough Sets: Theoretical Aspects of Reasoning about Data

Rough Sets: Theoretical Aspects of Reasoning about Data
Graphical representation of information on the set of reducts

RSKT'07 Proceedings of the 2nd international conference on Rough sets and knowledge technology
Pairwise cores in information systems

RSFDGrC'05 Proceedings of the 10th international conference on Rough Sets, Fuzzy Sets, Data Mining, and Granular Computing - Volume Part I

Extracting Relevant Information about Reduct Sets from Data Tables

Transactions on Rough Sets IX
DRSA decision algorithm analysis in stylometric processing of literary texts

RSCTC'10 Proceedings of the 7th international conference on Rough sets and current trends in computing
Application of DRSA-ANN classifier in computational stylistics

ISMIS'11 Proceedings of the 19th international conference on Foundations of intelligent systems
Decision rule length as a basis for evaluation of attribute relevance

Journal of Intelligent & Fuzzy Systems: Applications in Engineering and Technology - Recent Advances in Soft Computing: Theories and Applications

Quantified Score

Hi-index	0.00

Visualization

Abstract

For any fixed natural k, there exists a polynomial in time algorithm which for a given decision table Tand given kconditional attributes recognizes if there exist a decision reduct of Tcontaining these kattributes.