Learn R Programming

⚠️There's a newer version (1.3-8) of this package.Take me there.

RoughSets (version 1.1-0)

Data Analysis Using Rough Set and Fuzzy Rough Set Theories.

Description

This package provides comprehensive implementations of algorithms based on rough set theory (RST) and fuzzy rough set theory (FRST), and integrates these two theories into a single package. It provides implementations, not only for the basic concepts of RST and FRST, but also most common methods based on them for handling some: discretization, feature selection, instance selection, rule induction, and classification based on nearest neighbors. RST was introduced by Zdzislaw Pawlak in 1982 as a sophisticated mathematical tool based on indiscernibility relations to model and process imprecise or incomplete information. It works on symbolic-valued datasets for tackling the data analysis problems. 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. In addition, we provide a new feature in this version which is missing value completion. Finally, our package should be considered as an alternative software library for analyzing data based on RST and FRST. Furthermore, in this version we provide some algorithms for dealing with missing values.

Copy Link

Version

Install

install.packages('RoughSets')

Monthly Downloads

354

Version

1.1-0

License

GPL (>= 2)

Maintainer

Christoph Bergmeir

Last Published

June 19th, 2014

Functions in RoughSets (1.1-0)

BC.positive.reg.RST

Regions based on rough set theory
C.FRNN.FRST

The fuzzy-rough nearest neighbor algorithm
D.global.discernibility.heuristic.RST

The global maximum discernibility heuristic
C.FRNN.O.FRST

The fuzzy-rough ownership nearest neighbor algorithm
C.POSNN.FRST

The positive region based fuzzy-rough nearest neighbor algorithm
D.discretize.equal.intervals.RST

The "equal interval size" discretization algorithm
D.discretize.quantiles.RST

The "quantile-based" discretization algorithm
BC.discernibility.mat.RST

The decision-relative discernibility matrix based on rough set theory
BC.discernibility.mat.FRST

The decision-relative discernibility matrix based on fuzzy rough set theory
BC.positive.reg.FRST

Positive region based on fuzzy rough set
BC.LU.approximation.RST

The lower and upper approximations based on rough set
D.local.discernibility.matrix.RST

The local strategy algorithm
FS.all.reducts.computation

The function for computing all reducts
X.bestFirst

the best-first voting strategy function
D.max.discernibility.matrix.RST

The maximal discernibility algorithm
BC.LU.approximation.FRST

The fuzzy lower and upper approximations based on fuzzy rough set theory
SF.applyDecTable

Apply for obtaining a new decision table
FS.greedy.heuristic.reduct.RST

The greedy heuristic algorithm for determining a reduct
FS.nearOpt.fvprs.FRST

The near-optimal reduction algorithm based on fuzzy rough set theory
summary.PositiveRegion

The summary function of positive region based on RST and FRST
SF.read.DecisionTable

The importing function
X.nOfConflictsSqrt

The discernibility measure function based on sqrt
X.entropy

The information gain measure function
summary.LowerUpperApproximation

The summary function of lower and upper approximations based on RST and FRST
FS.one.reduct.computation

The function for computing one reducts
FS.greedy.heuristic.superreduct.RST

The greedy heuristic method for determining superreduct based on RST
RI.indiscernibilityBasedRules.RST

Rule induction based on RST
FS.quickreduct.RST

QuickReduct algorithm based on RST
MV.globalClosestFit

Global Closest Fit
X.nOfConflictsLog

The discernibility measure function based on log2
summary.RuleSetRST

The summary function of rules based on RST
BC.IND.relation.RST

Indiscernibility relation based on rough set theory
SF.asDecisionTable

The construction function
IS.FRIS.FRST

The fuzzy rough instance selection algorithm
B.Introduction-FuzzyRoughSets

Introduction to Fuzzy Rough Set Theory
RI.GFRS.FRST

Generalized fuzzy rough set rule induction based on FRST
MV.conceptClosestFit

Concept Closest Fit
FS.permutation.heuristic.reduct.RST

The permutation heuristic algorithm for determining a reduct
summary.RuleSetFRST

The summary function of rules based on FRST
X.gini

The gini-index gain measure function
MV.mostCommonValResConcept

The most common value or mean of an attribute restricted to a concept
FS.reduct.computation

The reduct computation methods based on RST and FRST
predict.RuleSetRST

The predicting function for rule induction methods based on RST
predict.RuleSetFRST

The predicting function for rule induction methods based on FRST
FS.quickreduct.FRST

The fuzzy QuickReduct algorithm based on FRST
RI.hybridFS.FRST

Hybrid fuzzy-rough rule and induction and feature selection
MV.missingValueCompletion

Wrapper function of missing value completion
MV.deletionCases

Missing value completion by deleting instances
MV.mostCommonVal

Replacing missing attribute values by the attribute mean or common values
FS.feature.subset.computation

The superreduct computation based on RST and FRST
D.discretization.RST

The wrapper function of discretization methods
RoughSetData

Data set of the package
BC.IND.relation.FRST

The indiscernibility relation based on fuzzy rough set theory
IS.FRPS.FRST

The fuzzy rough prototype selection method
X.nOfConflicts

The discernibility measure function
RoughSets-package

Getting started with the RoughSets package
summary.IndiscernibilityRelation

The summary function of indiscernibility relation based on RST and FRST
A.Introduction-RoughSets

Introduction to Rough Set Theory