论文信息 - On Partial Tests and Partial Reducts for Decision Tables

On Partial Tests and Partial Reducts for Decision Tables

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.

Mikhail Ju. Moshkov | Marcin Piliszczuk | M. Moshkov | M. Piliszczuk

[1] Petr Slavík,et al. A tight analysis of the greedy algorithm for set cover , 1996, STOC '96.

[2] Alan Bundy,et al. Constructing Induction Rules for Deductive Synthesis Proofs , 2006, CLASE.

[3] Andrzej Skowron,et al. New Directions in Rough Sets, Data Mining, and Granular-Soft Computing , 1999, Lecture Notes in Computer Science.

[4] Dominik Slezak,et al. Approximate Entropy Reducts , 2002, Fundam. Informaticae.

[5] Dominik Slezak,et al. Normalized Decision Functions and Measures for Inconsistent Decision Tables Analysis , 2000, Fundam. Informaticae.

[6] Mikhail Ju. Moshkov,et al. Greedy Algorithm for Set Cover in Context of Knowledge Discovery Problems , 2003, RSKD.

[7] Dominik Slezak,et al. Approximate Reducts and Association Rules - Correspondence and Complexity Results , 1999, RSFDGrC.

[8] Z. Pawlak. Rough set elements , 1998 .

[9] Marcin Szczuka,et al. Rough Sets in KDD , 2005 .

[10] Lech Polkowski,et al. Rough Sets in Knowledge Discovery 2 , 1998 .