A New Definition Of Reduction In Rough Sets And Its Fuzzy Generalization

In rough set theory,the reduetion in the algebra view 15 only eoneerned aboutthe eonsistent Part in a database.While in the information view reduetion 15eoneerned about the all data,ineonsistent Part ineluded.Reduetion in informationview tries to embody the discernibility relation between the all data.Whereas thistry 15 not Perfeet.50 this PaPer gives a new definition ofredtLetion,whieh isjusttoredeem this laek and it ean eomPletely embody the diseernibility relation After thereseareh in the reduetion algorithm,a new heuristie reduetinlgorilllm basedo1inconsisteney inereasing funetion 15 ProPosed.This algorithm Proves its validity intheory and in exPeriment.As we all know, it 15 signifieant to generalize someeoneePts and results definedon a crisP set to eounterPart defined on a fuzzy set.We generalize the key eoneePtsreduetion and core defined on a erisP set to theireounterPartfuzzy reduetion and fuzzy eore,This work 15 exPeeted to initiateanew fuzzyrough theory.