Using the Structure of Prelarge Trees to Incrementally Mine Frequent Itemsets

• Published in: New generation computing Vol. 28; no. 1; pp. 5 - 20
• Main Authors: Lin, Chun-Wei, Hong, Tzung-Pei, Lu, Wen-Hsiang
• Format: Journal Article
• Language: English
• Published: Heidelberg Verlag Omsha Tokio 2010
• Subjects: Artificial Intelligence; Computer Hardware; Computer Science; Computer Systems Organization and Communication Networks; Software Engineering/Programming and Operating Systems; Prelarge-tree Algorithm; Incremental Mining; Data Mining; FP-tree; Maintenance
• ISSN: 0288-3635; 1882-7055
• DOI: 10.1007/s00354-008-0072-6

The frequent pattern tree (FP-tree. is an efficient data structure for association-rule mining without generation of candidate itemsets. It was used to compress a database into a tree structure which stored only large items. It, however, needed to process all transactions in a batch way. In the past, we proposed a Fast Updated FP-tree (FUFP-tree. structure to efficiently handle new transactions and to make the tree update process become easier. In this paper, we propose the structure of prelarge trees to incrementally mine association rules based on the concept of pre-large itemsets. Due to the properties of pre-large concepts, the proposed approach does not need to rescan the original database until a number of new transactions have been inserted. The proposed approach can thus achieve a good execution time for tree construction especially when a small number of transactions are inserted each time. Experimental results also show that the proposed approach has a good performance for incrementally handling new transactions.