关联规则算法的研究

Research of Association Rules Algorithm

Apriori算法是发现频繁项目集的经典算法,但是该算法需反复扫描数据库,因此效率较低。文中针对传统的Apri-ori算法需要多次扫描数据库,由此导致的性能瓶颈及效率问题,提出了一种改进的关联规则挖掘算法(AAC算法)。该算法只需一次扫描数据库即可完成所有频繁项集的搜索,极大地提高了算法的效率。

Apriori algorithm is the classic method which used to detect frequent item sets. But due to the algorithm need to be repeated scanning the database, it has less efficiency. The article for the traditional Apriori algorithm necessary to scan the database many times and the resulting efficiency and performance bottlenecks, raising an improved method of mining association rules （AAC algorithm） , it only need to scan the database one time to finish all the frequent item sets detecting,greatly improve the efficiency of the algorithm.