Suppose that frequent itemsets are saved for a large transactional database, (D B). Discuss how to efficiently

Question:

Suppose that frequent itemsets are saved for a large transactional database, \(D B\). Discuss how to efficiently mine the (global) association rules under the same minimum support threshold, if a set of new transactions, denoted as \(\triangle D B\), is (incrementally) added in?

Fantastic news! We've Found the answer you've been seeking!

Step by Step Answer:

Related Book For  book-img-for-question

Data Mining Concepts And Techniques

ISBN: 9780128117613

4th Edition

Authors: Jiawei Han, Jian Pei, Hanghang Tong

Question Posted: