An Efficient Algorithm for Discovering Association Rules Based on Vertical Data Layout
基于垂直数据分布的关联规则高效发现算法

In this paper, the authors analyze the methods to generate and test frequent itemsets in existing algorithms in KDD research, and put forward a new efficient algorithm for discovering association rules based on vertical data layout. This algorithm has no need of Hash data structure and makes only two databases scans. As a result, the algorithm not only facilitates the implementation, but also improves the efficiency.