Efficient Computation of Frequent Itemsets In A Subcollection of Multiple Set Families
Many applications need to deal with the additive and multiplicative subcollections over a group of set families (databases). This paper presents two efficient algorithms for computing the frequent itemsets in these two types of subcollections respectively. Let T be a given subcollection of set families of total size m whose elements are drawn from a domain of size n. We show that ifT is an additive subcollection we can compute all frequent itemsets in T in O(m2n/(pn) + log p) time on an EREW...[Show more]
|Collections||ANU Research Publications|
Items in Open Research are protected by copyright, with all rights reserved, unless otherwise indicated.