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
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?
Step by Step Solution
3.37 Rating (147 Votes )
There are 3 Steps involved in it
Mining global association rules in a large transactional database involves finding all the rules that meet a certain minimum support threshold If a se... View full answer
Get step-by-step solutions from verified subject matter experts
