Function S-rough sets and law identification

By introducing element equivalence class that proposes dynamic characteristic into Pawlak Z rough sets theory, the first author of this paper improved Pawlak Z rough sets and put forward S-rough sets (singular rough sets). S-rough sets are defined by element equivalence class that proposes dynamic c...

Full description

Saved in:
Bibliographic Details
Published in:Science China. Information sciences 2008-05, Vol.51 (5), p.499-510
Main Authors: Shi, KaiQuan, Yao, BingXue
Format: Article
Language:English
Subjects:
Computer Science
Dynamic characteristics
Equivalence
Information Systems and Communication Service
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:By introducing element equivalence class that proposes dynamic characteristic into Pawlak Z rough sets theory, the first author of this paper improved Pawlak Z rough sets and put forward S-rough sets (singular rough sets). S-rough sets are defined by element equivalence class that proposes dynamic characteristic. S-rough sets have dynamic characteristic. By introducing the function equivalence class (law equivalence class) that proposes dynamic characteristic into S-rough sets, the first author improved S-rough sets and put forward function S-rough sets (function singular rough sets). Function S-rough sets have dynamic characteristic and law characteristic, and a function is a law. By using function S-rough sets, this paper presents law identification, law identification theorem, and law identification criterion and applications. Function S-rough sets are a new research direction of rough sets theory, and it is also a new tool to the research of system law identification.
ISSN:1009-2757
1674-733X
1862-2836
1869-1919
DOI:10.1007/s11432-008-0050-0