On Partial Covers, Reducts and Decision Rules

In the paper, the accuracy of greedy algorithms for construction of partial covers, reducts and decision rules is considered. Bounds on the minimal complexity of partial covers, reducts and decision rules based on an information about greedy algorithm work are studied. The results of experiments with greedy algorithms are described.

[1]  Carlo Vercellis,et al.  A probabilistic analysis of the set covering problem , 1984, Ann. Oper. Res..

[2]  Jakub Wroblewski,et al.  Ensembles of Classifiers Based on Approximate Reducts , 2001, Fundam. Informaticae.

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

[4]  Jerzy W. Grzymala-Busse,et al.  Transactions on Rough Sets VI, Commemorating the Life and Work of Zdzislaw Pawlak, Part I , 2007, Trans. Rough Sets.

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

[6]  A. A. Li︠a︡punov.  Problems in Cybernetics , 1961, Nature.

[7]  Uriel Feige.  A threshold of ln n for approximating set cover (preliminary version) , 1996, STOC '96.

[8]  László Lovász,et al.  On the ratio of optimal integral and fractional covers , 1975, Discret. Math..

[9]  Ran Raz,et al.  A sub-constant error-probability low-degree test, and a sub-constant error-probability PCP characterization of NP , 1997, STOC '97.

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

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

[12]  Raymond E. Miller,et al.  Complexity of Computer Computations , 1972 .

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

[14]  Z. Pawlak.  Rough Sets: Theoretical Aspects of Reasoning about Data , 1991 .

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

[16]  A. Skowron,et al.  Methodology and applications , 1998 .

[17]  Roman Słowiński,et al.  Intelligent Decision Support , 1992, Theory and Decision Library.

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

[19]  Dyneley Hussey,et al.  Annals of Opera , 1943 .

[20]  Mohamed Quafafou,et al.  alpha-RST: a generalization of rough set theory , 2000, Inf. Sci..

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

[22]  E. Kleinberg,et al.  Approximation algorithms for set cover and related problems , 1998 .

[23]  Andrzej Skowron,et al.  The Discernibility Matrices and Functions in Information Systems , 1992, Intelligent Decision Support.

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

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

[26]  Richard M. Karp,et al.  Reducibility Among Combinatorial Problems , 1972, 50 Years of Integer Programming.

[27]  David S. Johnson,et al.  Approximation algorithms for combinatorial problems , 1973, STOC.

[28]  Mikhail Ju. Moshkov,et al.  On Partial Covers, Reducts and Decision Rules with Weights , 2007, Trans. Rough Sets.