RoughSets (Q43519)

From MaRDI portal
Revision as of 23:01, 21 March 2024 by Swh import (talk | contribs) (SWHID from Software Heritage)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Data Analysis Using Rough Set and Fuzzy Rough Set Theories
Language Label Description Also known as
English
RoughSets
Data Analysis Using Rough Set and Fuzzy Rough Set Theories

    Statements

    0 references
    1.3-7
    15 December 2019
    0 references
    1.0-0
    4 February 2014
    0 references
    1.1-0
    19 June 2014
    0 references
    1.2-0
    19 March 2015
    0 references
    1.2-1
    24 March 2015
    0 references
    1.3-0
    5 September 2015
    0 references
    1.3-8
    23 January 2024
    0 references
    0 references
    23 January 2024
    0 references
    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.
    0 references
    0 references
    0 references
    0 references

    Identifiers