一种高效并行关联规则挖掘新算法

提出了一种在微机集群上实现的高效并行算法。该算法利用矩阵理论中上三角矩阵的良好性质，通过数据库约简、投影等操作，在微机集群的各节点上开展并行挖掘，从而提高挖掘算法的效率和可扩性。在微机集群上的实验证明，该算法能大大提高关联规则的挖掘效率，并具有良好的可扩性。

A Fast and Parallel Algorithm for Mining Association Rules Based on PC Cluster

Mining association rules is an important issue in data mining community. Fruitful achievements have been made in this field during the past years. Many algorithms were proposed on the subject. However, effectiveness, scalability of the algorithms and attribute's contribution are still bottle necks to mining association rules. A fast and parallel algorithm for mining association rules based on PC cluster was presented in this paper. The algorithm works on the knots of the PC cluster after reducing and projecting operation according to the excellent properties of the upper triangle matrix. An experiment on the PC cluster testifies that the algorithm has the advantage of improving the effectiveness and scalability of mining association rules.