| A.Introduction-RoughSets-package | Introduction to Rough Set Theory |
| B.Introduction-FuzzyRoughSets-package | Introduction to Fuzzy Rough Set Theory |
| RoughSets-package | Getting started with the RoughSets package |
| A.Introduction-RoughSets | Introduction to Rough Set Theory |
| B.Introduction-FuzzyRoughSets | Introduction to Fuzzy Rough Set Theory |
| BC.discernibility.mat.FRST | The decision-relative discernibility matrix based on fuzzy rough set theory |
| BC.discernibility.mat.RST | The decision-relative discernibility matrix based on rough set theory |
| BC.IND.relation.FRST | The indiscernibility relation based on fuzzy rough set theory |
| BC.IND.relation.RST | Indiscernibility relation based on rough set theory |
| BC.LU.approximation.FRST | The fuzzy lower and upper approximations based on fuzzy rough set theory |
| BC.LU.approximation.RST | The lower and upper approximations based on rough set |
| BC.positive.reg.FRST | Positive region based on fuzzy rough set |
| BC.positive.reg.RST | Regions based on 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 algorithm |
| D.discretization.RST | The wrapper function of discretization methods |
| D.discretize.equal.intervals.RST | The "equal interval size" discretization algorithm |
| D.discretize.quantiles.RST | The "quantile-based" discretization algorithm |
| D.global.discernibility.heuristic.RST | The global maximum discernibility heuristic |
| D.local.discernibility.matrix.RST | The local strategy algorithm |
| D.max.discernibility.matrix.RST | The maximal discernibility algorithm |
| FS.all.reducts.computation | The function for computing all reducts |
| FS.feature.subset.computation | The superreduct computation based on RST and FRST |
| FS.greedy.heuristic.reduct.RST | The greedy heuristic algorithm for determining a reduct |
| FS.greedy.heuristic.superreduct.RST | The greedy heuristic method for determining superreduct based on RST |
| FS.nearOpt.fvprs.FRST | The near-optimal reduction algorithm based on fuzzy rough set theory |
| FS.one.reduct.computation | The function for computing one reducts |
| FS.permutation.heuristic.reduct.RST | The permutation heuristic algorithm for determining a reduct |
| 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 |
| FuzzyRoughSets-intro | Introduction to Fuzzy Rough Set Theory |
| 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 common values |
| MV.mostCommonValResConcept | The most common value or mean of an attribute restricted to a concept |
| predict.FRST | The predicting function for rule induction methods based on FRST |
| predict.RST | The predicting function for rule induction methods based on RST |
| predict.RuleSetFRST | The predicting function for rule induction methods based on FRST |
| predict.RuleSetRST | The predicting function for rule induction methods based on RST |
| 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 based on RST |
| RoughSetData | Data set of the package |
| RoughSets | Getting started with the RoughSets package |
| RoughSets-intro | Introduction to Rough Set Theory |
| SF.applyDecTable | Apply for obtaining a new decision table |
| SF.asDecisionTable | The construction function |
| SF.read.DecisionTable | The importing function |
| summary.IndiscernibilityRelation | The summary function of indiscernibility relation based on RST and FRST |
| summary.LowerUpperApproximation | The summary function of lower and upper approximations based on RST and FRST |
| 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.bestFirst | the best-first voting strategy function |
| X.entropy | The information gain measure function |
| X.gini | The gini-index gain measure function |
| X.nOfConflicts | The discernibility measure function |
| X.nOfConflictsLog | The discernibility measure function based on 'log2' |
| X.nOfConflictsSqrt | The discernibility measure function based on 'sqrt' |