基于apriori算法和olap的关联规则挖掘模型设计-计算机应用专业论文.docxVIP

AbstractAbstract Abstract Abstract When enters for the 21st century,Many Enterprise and another organizations have gradually finished to management by MIS(Management information system) and another information Systems,and these organizations accumulation massive amounts of data．How to obtain useful and hidden knowledge from these hlIge numbers of data has already be．A：0me important part of information technology．Data mining aims at the task of the above work．Association mles mining is a form of data mining to discover previously unknown,interesting relationships among attributes from large databases．Market-basket analysis is a classic application of association rules mining．It analyses the customers’habits by find the relationships between the purchases they put in theirs marker-baskets．It啪tell which products were often purchased together．The result can help arrange the commodity layout and establish sales strategy etc． Apriori algorithm is a classis algorithm of association rules mining,But along with the scale increasing of the database，it have disadvantages．Apriori gets candidate itemsets。and then delete un—frequent itemscts．Take count of every candidate itemset will use much CPU time． OLAP is a fast query and analyze technology of sharable multidimensional data． This paper analyses the characteristics of the Apriori algorithm and then proposes a design method of OLAP mining model accord to the algorithm．The design of the dimensions and measures in data cube fully consider the characteristics of the Apriori algorithm to make the data cube materialize morg middle data the algorithm needed． Then adapt the algorithm to the data cube．Study shows that this method presents well on flexibility and efficiency． Keyword：association rules；Market·basket analysis；Apriod algorithm；OLAP；data cube H 第一章绪论第一章绪论 第一章绪论 第一章绪论 1．1问题的提出 进入21世纪，很多企业或其他机构都逐步实现了管理的信息化。随着信息 化程度的不断提高，电子信息和数据以爆炸般的速度膨胀并存在于商业或其他领 域的各个环节制之中。如何从如此海量的数据中获得有用的信息并加以学习利 用，己经成为信息技术发展与应用的重要课题。虽然现代计算机技术与数据库技 术己经可以支持存