RoughSets

Data Analysis Using Rough Set and Fuzzy Rough Set Theories

Last update: 23 January 2024

Copyright license: GNU General Public License, version 3.0, GNU General Public License, version 2.0

Software version identifier: 1.3-7, 1.0-0, 1.1-0, 1.2-0, 1.2-1, 1.3-0, 1.3-8

Source code repository: https://github.com/cran/RoughSets

Description

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.

Related Items (8)

NEC: a nested equivalence class-based dependency calculation approach for fast feature selection using rough set theory ⋮ Object similarity measures and Pawlak's indiscernibility on decision tables ⋮ Recent fuzzy generalisations of rough sets theory: a systematic review and methodological critique of the literature ⋮ A novel attribute reduction approach for multi-label data based on rough set theory ⋮ Parallel attribute reduction in dominance-based neighborhood rough set ⋮ Distributed approach for computing rough set approximations of big incomplete information systems ⋮ Unnamed Item ⋮ Applications of rough sets in big data analysis: an overview

This page was built for software: RoughSets