快速分类关联规则挖掘算法研究-计算机应用技术专业毕业论文.docxVIP

AbstractWith Abstract With the deVelopment and extensiVe application of modern technology of database，the quantity of data and the complexity are increasing sharpIy in database．It is necessary to describe and discover the inf．0rmation and the relationships concealed in these data with a new technology．Data mining，which is a method of extracting preViously unknown and potentially usef．ul patterns and relationships f-rom data，is widely used in business management，production control，market analysis，projects design and science exploring，etc． The relationships between patterns in database are explained by the rule that is an imponm锄t fieId in data mining．Generally，the rule is divided into two categories． One is association rules which connect with problems of market basket in transaction database， and the other one is classification rules which relate with prediction in relational database．In this disseIrtation，we will mainly discuss class association rules that mine classification rules with association rules algoritllIns． Relational databases are oRen denser than transaction databases，so mining on them for class association mles may be dimcult．For example：surplus redundant rules．Thereforthis paper introduce锄optimal class association mIe mining algorithm， is named OCARA．Since OCARA uses optimal association ruIe mining algorithm，锄d the rule set is sorted by priority of mles，it results in a more accurate classifier．This algorithm is compared with C4．5，CBA，RMR on UCI eight data sets respectively． Experiment results show that it has better performance． In addition，the scale and time of mining class association rules will increase sharply in incomplete relational database when it is higher dimension．In this paper，a rough set theory based fast ORD algorithm for mining association rules is presented． It uses the attribute reduction algorithm to reduct attributes firstly．Then the fast and efncient algorithm for pruning redundant itemsets and redundant rules， ORD algorithm is ap