F̄-ladder knowledge and F̄-hiding knowledge discovery

By employing dual of one direction S-rough sets (dual of one direction singular rough sets) and its dynamic characteristic, this paper presents the concepts of F̄-ladder knowledge and F̄-ladder degree. Using these concepts, the discernibility theorem of F̄-ladder knowledge, the hiding-discovery theo...

Full description

Saved in:
Bibliographic Details
Published in2015 12th International Conference on Fuzzy Systems and Knowledge Discovery (FSKD) pp. 976 - 982
Main Authors Xiumei Hao, Tongtong Ren, Yanli Zhang
Format Conference Proceeding
LanguageEnglish
Published IEEE 01.08.2015
Subjects
application Introduction
Character recognition
dual of one direction S-rough sets
Economics
Finance
Finite element analysis
F̄-ladder degree
F̄-ladder knowledge
hiding principle
Knowledge discovery
Rough sets
the hiding-discovery criterion
the hiding-discovery theorem
Online AccessGet full text

Cover

More Information
Summary:By employing dual of one direction S-rough sets (dual of one direction singular rough sets) and its dynamic characteristic, this paper presents the concepts of F̄-ladder knowledge and F̄-ladder degree. Using these concepts, the discernibility theorem of F̄-ladder knowledge, the hiding-discovery theorem of maximum F̄-ladder knowledge, the hiding-discovery theorem of maximum F̄-ladder knowledge and the dependence-filter theorem of knowledge discovery are proposed, and the interior hiding principle of F̄-ladder knowledge, the hiding-discovery criterion of F̄-ladder knowledge and its applications are given. The results given in this paper show the new characteristics of dual of one direction S-rough sets and the new applications of the dynamic characteristic of dual of one direction S-rough sets.
DOI:10.1109/FSKD.2015.7382076