README.md

Simplify decision tables using Rough Set Theory

This package allows users to reduce knowledge by simplifying rules in decision tables according to Rough Set theory. It is not a complete implementation of Rough Set theory; it just has the minimum functions to simplify decision tables.

The "RoughSetKnowledgeReduction" package pretends to be an R implementation of the section 6.3 "Simplification of Decision Tables" of the book written by Pawlak (Rough Sets: Theoretical Aspects of Reasoning About Data). In the context of artificial intelligence, Rough Set theory is considered a solution alternative to the classificatory problem, allowing to discard superfluous or irrelevant information to focus in the most determinant conditions for taking a decision. Rough Set theory is known for being able to deal with contradictory or even incomplete information, making no assumptions about the internal structure of the data. Rough Sets theory is unable to deal with continuous variables which is a clear disadvantage. For more details about Rough Set theory consult Pawlak's book.

For more details, download the PDF at https://github.com/albhasan/RoughSetKnowledgeReduction/blob/master/vignettes/howto.pdf?raw=true



Try the RoughSetKnowledgeReduction package in your browser

Any scripts or data that you put into this service are public.

RoughSetKnowledgeReduction documentation built on May 2, 2019, 4 p.m.