1. F̄-ladder knowledge and F̄-hiding knowledge discovery
- Author
-
Tongtong Ren, Yanli Zhang, and Xiumei Hao
- Subjects
Discrete mathematics ,Theoretical computer science ,Knowledge extraction ,Degree (graph theory) ,Rough set theory data mining ,Condensed Matter::Strongly Correlated Electrons ,Rough set ,Hardware_ARITHMETICANDLOGICSTRUCTURES ,Dual (category theory) ,Mathematics - Abstract
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.
- Published
- 2015