基于粗糙集的数据挖掘算法的研究与应用-系统分析与集成专业论文.docxVIP

ABSTRACTABSTRACT：Data ABSTRACT ABSTRACT：Data mining is a technique that aims to analyze and understand large source data and reveals knowledge hidden in the data and is an active research field of AI researching．As all efficient mathematic tool to deal wit】[1 the vagueness and uncertainty,rough set theory provides a new approach of data mining． In this thesis，Data mining based on rough set is studied in the theory and application witll respect to the problem that the traditional data mining method Can not handle noisy data effectively．Main topics of this dissertation are as follows： (1)In this paper,we re-interpreted the basic concept of classical rough set theory based on VPRS，we also analyse the features and process of the application of rough set theory in data mining and pointed out the direction of the research． (2)To finding out minimal reduct，all attribute reduct algorithrn based on entropy is proposed in this dissertation．This algorithm employs core of attribute as the start of reduction and the tilted Matrix as the selection criteria of candidate attributes and employs entroy of attribution as heuristic information．Experiment shows that this algorithm，compared to other algorithm，c锄reduce the risk of of useful attribute’S loss and accelerate the pace of attribute reduction． (3)A new method of decision tree based on VPRS is proposed in this thesis．In order to settle the problem that traditional methods Can not classify noisy data,the algorithm c -hooses the boundary region ofrough sets as the criteria of selecting partitional attribute —es．In addition，the conception ofConfidence ofleafnodes is redefined，which makes the method more understandable．Experiment shows that，Decision Tree built in this way is more effective and comprehensible． (4)After study and analyses on construction data of stations and security risks of station’S construction,this paper employs techniques of data mining to predict the security risks．The first step is data cleaning,integration