An attribute fast reduction algorithm based on modified discernable matrix of S-rough sets

To the information system which possesses dynamic characteristic, the discernable matrix of S-rough set is put forward based on S-rough set attribute transfer theory, and a new fast attribute reduction algorithm is presented based on discernable matrix of S-rough set in this paper. The algorithm makes up the localization of Z.Pawlak rough set theory in disposing dynamic system knowledge discovery, the incomplete information system is extended by attribute transfer, then reduction rules can be obtained simply; as a result, the algorithm complexity is reduced greatly.