高效关联规则数据挖掘算法研究

Research of efferent data mining alg orithm for assocoation rule

关联规则挖掘是数据挖掘领域的一个重要问题.由于关联规则挖掘通常是基于超大型数据库或数据仓库,算法的效率在一定程度上决定挖掘的成败.针对关联规则挖掘中的主要任务———频集发现过程中存在的几个问题,提出了项目树的概念,引出了一种新的挖掘模式,并设计了相应的高效挖掘算法,大大提高了挖掘效率.

One of the most important projects in data mining is the mining for associa tion rules.Generally,the mining of association rule is based o n huge database and data warehouse,s o whether the project can be carried out successfully mostly depend on th e significance of the mining algorit hm.In allusion to the main task.find ing the supported items,in association rule mining.The notion of items -tre e is suggestedand and is developed .A new pattern of association rule mini ng based on items -tree is founded.An efferent algorithm for the new model and testified it.The mining efficie ncy is improved signisicantly.