基于粗糙集理论的属性约简及应用研究-计算机应用技术专业论文.docxVIP

Research Research ofAttributes Reduction and Application Based OR Rough Set Theory Abstract The rough set theory is a mathematics tool in processing inaccm如．inconsistent and incomplete problems,which can find the implicit knowledge and potenfial regulations by directly analyzing and deducing the data withom any prior information except the data set．Since the end of 1980s，the theory and applications of rough set graduaJly have become the focus of intellectual information processing，and used in the fields ofdata mining,machine Icaming”pattern reconguition and decision analysis, etc． m aRribute reduction is a important problem of the rough set theory，which delete the redudant attribtes on the condition of keeping 011 the invariable classifying ability and the fast algorithm ofreduction is one ofthe main research contents ofthe theory ofrough set,which is a key step ofknowledge acquisition．Therefore，attribute reduction is focused on in this dissertation．n坞main content is divided as follows． (1)Relevant knowledge of the mush set theory is introduced and some classic attribute reduction algorithms ale analyzed systematically (2)An improved algorithm of attribute reduction based on discernibility matrix IAARBDM(Improved Algorithm of Attribute Reduction Based on Discernibility Matrix)is proposed,which reduces the redundant elements by a judugemcnt machanism before the s1飘K由玳of one-dimensional array is designed for storing the elements of the matrix,simplifies the discernibility function and enhances the efficiency．Furtherly an algorithm of AARSDM(Acquiring Attribute Reduction from the Simplified Discernibility Matrix)based on IAARBDM algorithm is proposed for the complex problems of discmibility function in larger database，which is useful for obtaining optimum or relatively optimum reducfiom． (3)A kind of heuristic fast algorithm for attribute reduction algorithm HAARDT(Heuristic Algorithm of Attribute Reduction for Decision Tabl曲is given, wlfich utilizes the matrix elemen