基于粗糙集的数据约简算法研究与应用-计算机应用技术专业论文.docxVIP

Research Research of Data Reduction and Application Based on Rough Sets Abstract Data mining is to extract and analyze some subtle relationships inside the enormous data sets，and then comes to a useful and understandable conclusion．The theory of rough sets is a mathematical tool for processing ambiguous and inaccurate problem．It is well—known that multitudes of practical problems can’t be solved by the present computer systems，especially those like machine learning， pattern recognition and artificial intelligence，which make the algorithm for describing individuals impossible．The theory of rough sets and its expansion can provide an accurate mathematical technology for rough description of such individuals． With development of knowledge economy and the coming of information society,more and more information accumulates within its system．Solving the problem of information expansion is not only the research subject of the system itself,but also an important study field on the Internet．The reduction of information system can reduce the information volume by removing irrelevant and unnecessary information without affecting its functions．After reduction，the information will be rearranged and new rules obtained．These rules different from the previous ones in terms of their premise and conclusion information．However, the same or similar results can be achieved through deduction． This thesis mainly introduces the basic theories and present researches of rou【gh sets，analyses data reduction，the core of data·mining process，and suggests a data reduction algorithm of informational system，based Oll Binary Trees．This algorithm makes attribute reduction consistent with its value reduction，shortens the reduction time，and lowers the complication degrees of time and space． The major achievements and innovations made in this thesis are as follows： (1)The present data reduction algorithm is studied，which needs to go through all data in the decision-form to lower the complication degree