论文信息 - On Covering Attribute Sets by Reducts

On Covering Attribute Sets by Reducts

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.

[1] P. Hammer,et al. Dual subimplicants of positive Boolean functions , 1998 .

[2] Andrzej Skowron,et al. Rough sets and Boolean reasoning , 2007, Inf. Sci..

[3] Andrzej Skowron,et al. Rudiments of rough sets , 2007, Inf. Sci..

[4] Mikhail Ju. Moshkov,et al. Graphical Representation of Information on the Set of Reducts , 2007, RSKT.

[5] Janusz Zalewski,et al. Rough sets: Theoretical aspects of reasoning about data , 1996 .

[6] Catherine Blake,et al. UCI Repository of machine learning databases , 1998 .

[7] Jakub Wroblewski. Pairwise Cores in Information Systems , 2005, RSFDGrC.