On variable consistency dominance-based rough set approaches

J. Blaszczynski, Salvatore Greco, R. Slowinski, M. Szelag

    Research output: Chapter in Book/Report/Conference proceedingChapter (peer-reviewed)peer-review


    We consider different variants of Variable Consistency Dominance-based Rough Set Approach (VC-DRSA). These variants produce more general (extended) lower approximations than those computed by Dominance-based Rough Set Approach (DRSA), (i.e., lower approximations that are supersets of those computed by DRSA). They define lower approximations that contain objects characterized by a strong but not necessarily certain relation with approximated sets. This is achieved by introduction of parameters that control consistency of objects included in lower approximations. We show that lower approximations generalized in this way enable us to observe dependencies that remain undiscovered by DRSA. Extended lower approximations are also a better basis for rule generation. In the paper, we focus our considerations on different definitions of generalized lower approximations. We also show definitions of VC-DRSA decision rules, as well as their application to classification/sorting and ranking/choice problems.
    Original languageEnglish
    Title of host publicationRough Sets and Current Trends in Computing: Proceedings of the 5th International Conference
    EditorsSalvatore Greco, Y. Hata, S. Hirano, M. Inuiguchi, S. Miyamoto, H. Nguyen, R. Slowinski
    Place of PublicationBerlin
    Number of pages12
    ISBN (Print)9783540476931
    Publication statusPublished - 2006

    Publication series

    NameLecture Notes in Computer Science
    ISSN (Print)0302-9743


    Dive into the research topics of 'On variable consistency dominance-based rough set approaches'. Together they form a unique fingerprint.

    Cite this