Data Dynamic Mining and Its Attribute Logic Relation

Singular rough sets or S-rough sets, which have dynamic characteristics, are proposed by improving rough sets of Z. Pawlak. Two structures of S-rough sets: one direction singular rough sets and dual of one direction singular sets, are used to work out data dynamic mining which satisfies the attribute disjunction characteristics. Then the authors further work out the concepts of inner-data, outer-data and inner-outer data and discuss their attribute disjunction contraction-expansion. Finally, dynamic data mining-separation is presented, and the disjuction criterion of inner-outer dynamic mining-attribute and applications of the data are given.