Research Simplification Of Decision Tables Of Rough Set Based On Binary Scale

Z. Pawlak,a Poland, has put forward Rough Set -a kind of new mathematics data analysis tool in the enghty of the 20th century . It does deal with the unaccuracy and uncertain problem by the strict mathematics formula,and has three kinds of ability of deducing , summing up and general knowledge reasoning. So, Rough collects the theory is widely used study in the machine soon, such respects as knowledge acquisition, decision analysis,database knowledge finnding,expert system and pattern-recognition,etc . It already becomes the focus-studied in information processing.Rough Set is a kind of tool that treats unaccurate and fuzzy question. Its main thought is that on the premise of keeping categorised ability unchange , leads the decision or categorised rule through Reduction of knowledge. Simplification of Decision tables in Roouh set is order to lead decision rule or categorised rule at the least on the basis of the least condition attribute and minimum redundant attribute value.The main innovation : Improving differentiation matrix method ,the method has the same time complexity:O(n~2),but this method spend less time and the speed is faster than the diferentiation matrix;Putting forward the concept unclear proprerty mode,unclear proprerty relation, unclear proprerty degree; Applying the binary scale and operation to simplification property and simplification property value,which makes the process more convenient and more simple.