Propositional Satisfiability Algorithm to Find Minimal Reducts for Data Mining

@article{Bakar2002PropositionalSA,
  title={Propositional Satisfiability Algorithm to Find Minimal Reducts for Data Mining},
  author={Azuraliza Abu Bakar and Md Nasir Sulaiman and Mohamed Othman and Mohd Hasan Selamat},
  journal={Int. J. Comput. Math.},
  year={2002},
  volume={79},
  pages={379-389}
}

From This Paper

Figures, tables, and topics from this paper.

References

Publications referenced by this paper.
Showing 1-10 of 11 references

Fuzzy Sets, Rough Sets and Decision Making Processes, Springer-Verlag Singapore Pte Ltd. TABLE VI Comparison of BIP method to other methods Method AUS(20) CLEV(30) LYM(40) BIP

  • T. Mollestad, Komorowski, J.A
  • Rough Set Framework of Propositional Default…
  • 1998
Highly Influential
4 Excerpts

Approximation Spaces, Reducts and Representative

  • J. Stepaniuk
  • 1998
2 Excerpts

ROSETTA technical Reference Manual

  • A. Ohrm
  • 1998

ROSETTA technical Reference Manual. Knowlegde System Group, Norwegian University of Science and Technology, Trondheim, Norway

  • A. Ohrm
  • 1998
1 Excerpt

Rough Set Framework of Propositional Default Rules Data Mining

  • T. Mollestad
  • 1998

Finding Minimal Reducts Using Genetic Algorithm

  • J. Wroblewski
  • Proc. of the 2nd Annual Join Conference on…
  • 1995
1 Excerpt

Improvements to Propositional Satisfiability Search Algorithm

  • J. W. Freeman
  • PhD Thesis. University of Pennsylvania
  • 1995
1 Excerpt

Rough Set: Theoretical Aspect of Reasoning about Data

  • Z. Pawlak
  • 1991
1 Excerpt

Similar Papers

Loading similar papers…