中文

Journal of Applied Sciences ›› 2004, Vol. 22 ›› Issue (2): 200-204.

• Articles • Previous Articles     Next Articles

The One-Time Scanning Incremental Mining Algorithm of Association Rules Based on a Transaction Thread Tree

YE Ning1,2, DONG Yisheng1, WANG Houli2   

  1. 1. Department of Computer Science and Engineering, Southeast University, Nanjing 210096, China;
    2. Department of Computer, Nanjing Forestry University, Nanjing 210037, China
  • Received:2003-01-30 Revised:2003-04-22 Online:2004-06-30 Published:2004-06-30

PDF

91

Abstract: A novel incremental mining algorithm of association rules is presented in this paper. First, transaction database is compressed and stored in a transaction thread tree (TT-tree). Then the index table of the nodes is established. Finally, all paths from leaf node to root node are obtained with the reverse search method. The frequent sets are included in these paths. The algorithm is very efficient since it scans transaction database only one time. In addition to efficiency, our algorithm is both scalable and incremental. The experimental results show that our algorithm is 10 times faster than that of the Apriori method.

Key words: frequency set, incremental, transaction thread tree(TT-tree), scalability

CLC Number: