# RoughSets: Data Analysis Using Rough Set and Fuzzy Rough Set Theories

Implementations of algorithms for data analysis based on the rough set theory (RST) and the fuzzy rough set theory (FRST). We not only provide implementations for the basic concepts of RST and FRST but also popular algorithms that derive from those theories. The methods included in the package can be divided into several categories based on their functionality: discretization, feature selection, instance selection, rule induction and classification based on nearest neighbors. RST was introduced by Zdzisław Pawlak in 1982 as a sophisticated mathematical tool to model and process imprecise or incomplete information. By using the indiscernibility relation for objects/instances, RST does not require additional parameters to analyze the data. FRST is an extension of RST. The FRST combines concepts of vagueness and indiscernibility that are expressed with fuzzy sets (as proposed by Zadeh, in 1965) and RST.

- Author
- Lala Septem Riza [aut], Andrzej Janusz [aut], Dominik Ślęzak [ctb], Chris Cornelis [ctb], Francisco Herrera [ctb], Jose Manuel Benitez [ctb], Christoph Bergmeir [ctb, cre], Sebastian Stawicki [ctb]
- Date of publication
- 2015-09-05 09:37:46
- Maintainer
- Christoph Bergmeir <c.bergmeir@decsai.ugr.es>
- License
- GPL (>= 2)
- Version
- 1.3-0
- URLs

## Man pages

- A.Introduction-RoughSets
- Introduction to Rough Set Theory
- as.character.RuleSetRST
- The 'as.character' method for RST rule sets
- as.list.RuleSetRST
- The 'as.list' method for RST rule sets
- BC.discernibility.mat.FRST
- The decision-relative discernibility matrix based on fuzzy...
- BC.discernibility.mat.RST
- Computation of a decision-relative discernibility matrix...
- BC.IND.relation.FRST
- The indiscernibility relation based on fuzzy rough set theory
- BC.IND.relation.RST
- Computation of indiscernibility classes based on the rough...
- BC.LU.approximation.FRST
- The fuzzy lower and upper approximations based on fuzzy rough...
- BC.LU.approximation.RST
- Computation of lower and upper approximations of decision...
- BC.positive.reg.FRST
- Positive region based on fuzzy rough set
- BC.positive.reg.RST
- Computation of a positive region
- B.Introduction-FuzzyRoughSets
- Introduction to Fuzzy Rough Set Theory
- C.FRNN.FRST
- The fuzzy-rough nearest neighbor algorithm
- C.FRNN.O.FRST
- The fuzzy-rough ownership nearest neighbor algorithm
- C.POSNN.FRST
- The positive region based fuzzy-rough nearest neighbor...
- D.discretization.RST
- The wrapper function for discretization methods
- D.discretize.equal.intervals.RST
- Unsupervised discretization into intervals of equal length.
- D.discretize.quantiles.RST
- The quantile-based discretization
- D.global.discernibility.heuristic.RST
- Supervised discretization based on the maximum discernibility...
- D.local.discernibility.heuristic.RST
- Supervised discretization based on the local discernibility...
- FS.all.reducts.computation
- A function for computing all decision reducts of a decision...
- FS.DAAR.heuristic.RST
- The DAAR heuristic for computation of decision reducts
- FS.feature.subset.computation
- The superreduct computation based on RST and FRST
- FS.greedy.heuristic.reduct.RST
- The greedy heuristic algorithm for computing decision reducts...
- FS.greedy.heuristic.superreduct.RST
- The greedy heuristic method for determining superreduct based...
- FS.nearOpt.fvprs.FRST
- The near-optimal reduction algorithm based on fuzzy rough set...
- FS.one.reduct.computation
- Computing one reduct from a discernibility matrix
- FS.permutation.heuristic.reduct.RST
- The permutation heuristic algorithm for computation of a...
- FS.quickreduct.FRST
- The fuzzy QuickReduct algorithm based on FRST
- FS.quickreduct.RST
- QuickReduct algorithm based on RST
- FS.reduct.computation
- The reduct computation methods based on RST and FRST
- IS.FRIS.FRST
- The fuzzy rough instance selection algorithm
- IS.FRPS.FRST
- The fuzzy rough prototype selection method
- MV.conceptClosestFit
- Concept Closest Fit
- MV.deletionCases
- Missing value completion by deleting instances
- MV.globalClosestFit
- Global Closest Fit
- MV.missingValueCompletion
- Wrapper function of missing value completion
- MV.mostCommonVal
- Replacing missing attribute values by the attribute mean or...
- MV.mostCommonValResConcept
- The most common value or mean of an attribute restricted to a...
- predict.RuleSetFRST
- The predicting function for rule induction methods based on...
- predict.RuleSetRST
- Prediction of decision classes using rule-based classifiers.
- print.FeatureSubset
- The print method of FeatureSubset objects
- print.RuleSetRST
- The print function for RST rule sets
- RI.AQRules.RST
- Rule induction using the AQ algorithm
- RI.CN2Rules.RST
- Rule induction using a version of CN2 algorithm
- RI.GFRS.FRST
- Generalized fuzzy rough set rule induction based on FRST
- RI.hybridFS.FRST
- Hybrid fuzzy-rough rule and induction and feature selection
- RI.indiscernibilityBasedRules.RST
- Rule induction from indiscernibility classes.
- RI.laplace
- Quality indicators of RST decision rules
- RI.LEM2Rules.RST
- Rule induction using the LEM2 algorithm
- RoughSetData
- Data set of the package
- RoughSets-package
- Getting started with the RoughSets package
- SF.applyDecTable
- Apply for obtaining a new decision table
- SF.asDecisionTable
- Converting a data.frame into a 'DecisionTable' object
- SF.asFeatureSubset
- Converting custom attribute name sets into a FeatureSubset...
- SF.read.DecisionTable
- Reading tabular data from files.
- sub-.RuleSetRST
- The '[.' method for '"RuleSetRST"' objects
- summary.IndiscernibilityRelation
- The summary function for an indiscernibility relation
- summary.LowerUpperApproximation
- The summary function of lower and upper approximations based...
- summary.PositiveRegion
- The summary function of positive region based on RST and FRST
- summary.RuleSetFRST
- The summary function of rules based on FRST
- summary.RuleSetRST
- The summary function of rules based on RST
- X.entropy
- The entropy measure
- X.gini
- The gini-index measure
- X.laplace
- Rule voting by the Laplace estimate
- X.nOfConflicts
- The discernibility measure
- X.rulesCounting
- Rule voting by counting matching rules
- X.ruleStrength
- Rule voting by strength of the rule

## Files in this package

RoughSets |

RoughSets/src |

RoughSets/src/indiscernibility.cpp |

RoughSets/src/discretization.cc |

RoughSets/src/RcppExports.cpp |

RoughSets/NAMESPACE |

RoughSets/demo |

RoughSets/demo/FS.permutation.heuristic.reduct.RST.R |

RoughSets/demo/FRNN.O.iris.R |

RoughSets/demo/FS.QuickReduct.FRST.Ex3.R |

RoughSets/demo/RI.classification.FRST.R |

RoughSets/demo/FS.QuickReduct.FRST.Ex5.R |

RoughSets/demo/FRNN.iris.R |

RoughSets/demo/DiscernibilityMatrix.FRST.R |

RoughSets/demo/FS.QuickReduct.FRST.Ex4.R |

RoughSets/demo/IS.FRPS.FRST.R |

RoughSets/demo/GettingStarted.B.R |

RoughSets/demo/FS.greedy.heuristic.reduct.RST.R |

RoughSets/demo/POSNN.iris.R |

RoughSets/demo/SimulationDataAnalysisWine.R |

RoughSets/demo/FS.QuickReduct.FRST.Ex2.R |

RoughSets/demo/RI.indiscernibilityBasedRules.RST.R |

RoughSets/demo/FS.greedy.heuristic.superreduct.RST.R |

RoughSets/demo/BasicConcept.FRST.R |

RoughSets/demo/D.discretize.quantiles.RST.R |

RoughSets/demo/IS.FRIS.FRST.R |

RoughSets/demo/BasicConcept.RST.R |

RoughSets/demo/RI.regression.FRST.R |

RoughSets/demo/FS.QuickReduct.FRST.Ex1.R |

RoughSets/demo/00Index |

RoughSets/demo/D.discretize.equal.intervals.RST.R |

RoughSets/demo/FS.nearOpt.fvprs.FRST.R |

RoughSets/demo/GettingStarted.A.R |

RoughSets/demo/MV.simpleData.R |

RoughSets/demo/D.global.discernibility.heuristic.RST.R |

RoughSets/demo/FS.QuickReduct.RST.R |

RoughSets/demo/DiscernibilityMatrix.RST.R |

RoughSets/data |

RoughSets/data/RoughSetData.RData |

RoughSets/R |

RoughSets/R/BasicFuzzyRoughSets.R |

RoughSets/R/InstanceSelection.R |

RoughSets/R/BasicRoughSets.OtherFuncCollections.R |

RoughSets/R/Discretization.R |

RoughSets/R/InstanceSelection.OtherFuncCollections.R |

RoughSets/R/IOFunctions.R |

RoughSets/R/FeatureSelection.R |

RoughSets/R/MissingValue.R |

RoughSets/R/FuzzyRoughSets-introduction.R |

RoughSets/R/RoughSets-package.R |

RoughSets/R/RuleInduction.OtherFuncCollections.R |

RoughSets/R/FeatureSelection.OtherFuncCollections.R |

RoughSets/R/RcppExports.R |

RoughSets/R/Discretization.OtherFuncCollections.R |

RoughSets/R/docData.R |

RoughSets/R/RuleInduction.R |

RoughSets/R/NearestNeigbour.OtherFuncCollections.R |

RoughSets/R/BasicRoughSets.R |

RoughSets/R/NearestNeigbour.R |

RoughSets/R/RoughSets-introduction.R |

RoughSets/MD5 |

RoughSets/DESCRIPTION |

RoughSets/man |

RoughSets/man/print.RuleSetRST.Rd |

RoughSets/man/X.rulesCounting.Rd |

RoughSets/man/X.ruleStrength.Rd |

RoughSets/man/FS.feature.subset.computation.Rd |

RoughSets/man/predict.RuleSetRST.Rd |

RoughSets/man/A.Introduction-RoughSets.Rd |

RoughSets/man/BC.positive.reg.RST.Rd |

RoughSets/man/IS.FRIS.FRST.Rd |

RoughSets/man/FS.permutation.heuristic.reduct.RST.Rd |

RoughSets/man/C.POSNN.FRST.Rd |

RoughSets/man/SF.read.DecisionTable.Rd |

RoughSets/man/D.discretize.equal.intervals.RST.Rd |

RoughSets/man/RI.CN2Rules.RST.Rd |

RoughSets/man/RI.indiscernibilityBasedRules.RST.Rd |

RoughSets/man/RI.GFRS.FRST.Rd |

RoughSets/man/predict.RuleSetFRST.Rd |

RoughSets/man/RI.laplace.Rd |

RoughSets/man/MV.missingValueCompletion.Rd |

RoughSets/man/SF.asFeatureSubset.Rd |

RoughSets/man/BC.discernibility.mat.RST.Rd |

RoughSets/man/MV.globalClosestFit.Rd |

RoughSets/man/C.FRNN.FRST.Rd |

RoughSets/man/C.FRNN.O.FRST.Rd |

RoughSets/man/B.Introduction-FuzzyRoughSets.Rd |

RoughSets/man/IS.FRPS.FRST.Rd |

RoughSets/man/summary.RuleSetFRST.Rd |

RoughSets/man/MV.mostCommonVal.Rd |

RoughSets/man/print.FeatureSubset.Rd |

RoughSets/man/BC.IND.relation.FRST.Rd |

RoughSets/man/RoughSetData.Rd |

RoughSets/man/FS.one.reduct.computation.Rd |

RoughSets/man/as.list.RuleSetRST.Rd |

RoughSets/man/BC.LU.approximation.FRST.Rd |

RoughSets/man/FS.greedy.heuristic.reduct.RST.Rd |

RoughSets/man/MV.conceptClosestFit.Rd |

RoughSets/man/summary.PositiveRegion.Rd |

RoughSets/man/BC.discernibility.mat.FRST.Rd |

RoughSets/man/BC.IND.relation.RST.Rd |

RoughSets/man/RI.hybridFS.FRST.Rd |

RoughSets/man/RoughSets-package.Rd |

RoughSets/man/FS.all.reducts.computation.Rd |

RoughSets/man/MV.deletionCases.Rd |

RoughSets/man/FS.greedy.heuristic.superreduct.RST.Rd |

RoughSets/man/X.gini.Rd |

RoughSets/man/FS.quickreduct.RST.Rd |

RoughSets/man/D.local.discernibility.heuristic.RST.Rd |

RoughSets/man/X.entropy.Rd |

RoughSets/man/FS.DAAR.heuristic.RST.Rd |

RoughSets/man/summary.RuleSetRST.Rd |

RoughSets/man/BC.positive.reg.FRST.Rd |

RoughSets/man/D.discretization.RST.Rd |

RoughSets/man/D.discretize.quantiles.RST.Rd |

RoughSets/man/summary.IndiscernibilityRelation.Rd |

RoughSets/man/MV.mostCommonValResConcept.Rd |

RoughSets/man/FS.reduct.computation.Rd |

RoughSets/man/FS.quickreduct.FRST.Rd |

RoughSets/man/SF.asDecisionTable.Rd |

RoughSets/man/D.global.discernibility.heuristic.RST.Rd |

RoughSets/man/X.nOfConflicts.Rd |

RoughSets/man/RI.AQRules.RST.Rd |

RoughSets/man/summary.LowerUpperApproximation.Rd |

RoughSets/man/X.laplace.Rd |

RoughSets/man/RI.LEM2Rules.RST.Rd |

RoughSets/man/SF.applyDecTable.Rd |

RoughSets/man/BC.LU.approximation.RST.Rd |

RoughSets/man/as.character.RuleSetRST.Rd |

RoughSets/man/sub-.RuleSetRST.Rd |

RoughSets/man/FS.nearOpt.fvprs.FRST.Rd |