Incremental mining alogorithm Pre-FP in association rules based on FP-tree
At present, most of association rule mining are static mining algorithms. However, in real Web applications, new transactions are usually incrementally inserted into database, the previous algorithms couldnt satisfy the rapid growth like this. In this paper, we proposed the incremental mining algorithms called Pre-FP based on PUFP-tree and Per-large-itemsets. This algorithm dont need rescan the original database when the new transactions surpass the fixed threshold , especially when each time the small fraction of transactions are inserted, Pre-FP can achieve a good execution efficiency for renewing construction of frequent pattern tree.
Data Mining web usage mining association rule incremental mining
LIU Jian-ping WANG Ying YANG Fan-ding
The College of Informatics & Electronics Zhejiang Sci-Tech University Hangzhou, China
国际会议
杭州
英文
199-203
2010-10-21（万方平台首次上网日期，不代表论文的发表时间）